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.r215-smll-167840357800178.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 ltsminxred
Input is HealthRecord-PT-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-167840357800178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 26 18:00 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 67K 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 1678618362478

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:52:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 10:52:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:52:45] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-12 10:52:45] [INFO ] Transformed 155 places.
[2023-03-12 10:52:45] [INFO ] Transformed 320 transitions.
[2023-03-12 10:52:45] [INFO ] Found NUPN structural information;
[2023-03-12 10:52:45] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 213 ms.
Graph (trivial) has 262 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 5 ms
Free SCC test removed 7 places
Structural test allowed to assert that 32 places are NOT stable. Took 13 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 781 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 123) seen :43
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 80) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 80) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 78) 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 78) 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 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 78) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) 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 77) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 75) seen :5
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) 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 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 70) 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 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) 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 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) 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 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 70) 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 70) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 68) 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 68) seen :2
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 66) 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 66) 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 66) 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 66) 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 66) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) 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 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Running SMT prover for 65 properties.
[2023-03-12 10:52:46] [INFO ] Flow matrix only has 269 transitions (discarded 19 similar events)
// Phase 1: matrix 269 rows 148 cols
[2023-03-12 10:52:46] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-12 10:52:47] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:65
[2023-03-12 10:52:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-12 10:52:47] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 10:52:48] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :65
[2023-03-12 10:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 10:52:49] [INFO ] After 725ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :65
[2023-03-12 10:52:49] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 10 ms to minimize.
[2023-03-12 10:52:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-12 10:52:49] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2023-03-12 10:52:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-12 10:52:50] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2023-03-12 10:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-12 10:52:50] [INFO ] After 2227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :65
Attempting to minimize the solution found.
Minimization took 722 ms.
[2023-03-12 10:52:51] [INFO ] After 4541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :65
Fused 65 Parikh solutions to 49 different solutions.
Parikh walk visited 0 properties in 652 ms.
Support contains 65 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 288/288 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 148 transition count 264
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 32 place count 144 transition count 260
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 144 transition count 256
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 137 transition count 256
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 76 place count 104 transition count 190
Iterating global reduction 2 with 33 rules applied. Total rules applied 109 place count 104 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 101 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 101 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 101 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 128 place count 95 transition count 208
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 95 transition count 202
Applied a total of 134 rules in 58 ms. Remains 95 /148 variables (removed 53) and now considering 202/288 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 95/148 places, 202/288 transitions.
Interrupted random walk after 911681 steps, including 275957 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 27
Incomplete Best-First random walk after 100001 steps, including 5318 resets, run finished after 644 ms. (steps per millisecond=155 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5376 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5420 resets, run finished after 639 ms. (steps per millisecond=156 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5384 resets, run finished after 633 ms. (steps per millisecond=157 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5381 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5435 resets, run finished after 623 ms. (steps per millisecond=160 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 5330 resets, run finished after 654 ms. (steps per millisecond=152 ) properties (out of 38) seen :4
Incomplete Best-First random walk after 100001 steps, including 5357 resets, run finished after 618 ms. (steps per millisecond=161 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5368 resets, run finished after 624 ms. (steps per millisecond=160 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5435 resets, run finished after 626 ms. (steps per millisecond=159 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5353 resets, run finished after 605 ms. (steps per millisecond=165 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5381 resets, run finished after 602 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5433 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5405 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5438 resets, run finished after 652 ms. (steps per millisecond=153 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5352 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100000 steps, including 5415 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100000 steps, including 5388 resets, run finished after 595 ms. (steps per millisecond=168 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5402 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100000 steps, including 5425 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5403 resets, run finished after 632 ms. (steps per millisecond=158 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100000 steps, including 5332 resets, run finished after 625 ms. (steps per millisecond=160 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5418 resets, run finished after 416 ms. (steps per millisecond=240 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5374 resets, run finished after 433 ms. (steps per millisecond=230 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5343 resets, run finished after 366 ms. (steps per millisecond=273 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5399 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5412 resets, run finished after 612 ms. (steps per millisecond=163 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5331 resets, run finished after 578 ms. (steps per millisecond=173 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5351 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5424 resets, run finished after 582 ms. (steps per millisecond=171 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5310 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100000 steps, including 5306 resets, run finished after 587 ms. (steps per millisecond=170 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5328 resets, run finished after 576 ms. (steps per millisecond=173 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5389 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 5318 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-12 10:53:42] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
// Phase 1: matrix 192 rows 95 cols
[2023-03-12 10:53:42] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-12 10:53:42] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-12 10:53:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 10:53:43] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-12 10:53:43] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-12 10:53:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 10:53:44] [INFO ] After 428ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2023-03-12 10:53:44] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2023-03-12 10:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-12 10:53:44] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2023-03-12 10:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-12 10:53:44] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 363 ms.
[2023-03-12 10:53:45] [INFO ] After 2418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Fused 34 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 202/202 transitions.
Graph (complete) has 452 edges and 95 vertex of which 86 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions 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 5 place count 86 transition count 198
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 82 transition count 197
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 20 place count 72 transition count 177
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 72 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 72 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 71 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 71 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 37 place count 71 transition count 170
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 4 with 2 rules applied. Total rules applied 39 place count 70 transition count 169
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 47 place count 66 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 49 place count 66 transition count 175
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 66 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 51 place count 65 transition count 170
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 65 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 58 place count 65 transition count 164
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 73 place count 65 transition count 164
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 87 place count 65 transition count 164
Applied a total of 87 rules in 54 ms. Remains 65 /95 variables (removed 30) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 65/95 places, 164/202 transitions.
Incomplete random walk after 1000000 steps, including 324243 resets, run finished after 28258 ms. (steps per millisecond=35 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 100001 steps, including 5405 resets, run finished after 329 ms. (steps per millisecond=303 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5387 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5344 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 5244 resets, run finished after 360 ms. (steps per millisecond=277 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5368 resets, run finished after 373 ms. (steps per millisecond=268 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 5370 resets, run finished after 329 ms. (steps per millisecond=303 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5348 resets, run finished after 339 ms. (steps per millisecond=294 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5445 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5408 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 5313 resets, run finished after 505 ms. (steps per millisecond=198 ) properties (out of 32) seen :4
Incomplete Best-First random walk after 100000 steps, including 5294 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 5410 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 5373 resets, run finished after 501 ms. (steps per millisecond=199 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 5384 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 5369 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 5290 resets, run finished after 490 ms. (steps per millisecond=204 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 100001 steps, including 5343 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5268 resets, run finished after 486 ms. (steps per millisecond=205 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5416 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5323 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 5419 resets, run finished after 501 ms. (steps per millisecond=199 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5379 resets, run finished after 483 ms. (steps per millisecond=207 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5364 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5386 resets, run finished after 490 ms. (steps per millisecond=204 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5365 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5277 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 5464 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 10:54:25] [INFO ] Flow matrix only has 153 transitions (discarded 11 similar events)
// Phase 1: matrix 153 rows 65 cols
[2023-03-12 10:54:25] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 10:54:26] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-12 10:54:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:54:26] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 10:54:26] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-12 10:54:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-12 10:54:26] [INFO ] After 234ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-12 10:54:26] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 4 ms to minimize.
[2023-03-12 10:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-12 10:54:27] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2023-03-12 10:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-12 10:54:27] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-12 10:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-12 10:54:27] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-12 10:54:27] [INFO ] After 1386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 22 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 164/164 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 60 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 60 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 55 transition count 164
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 55 transition count 163
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 55 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 54 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 54 transition count 159
Applied a total of 25 rules in 27 ms. Remains 54 /65 variables (removed 11) and now considering 159/164 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 54/65 places, 159/164 transitions.
Incomplete random walk after 1000000 steps, including 323140 resets, run finished after 27002 ms. (steps per millisecond=37 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 100001 steps, including 5347 resets, run finished after 569 ms. (steps per millisecond=175 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 5342 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5346 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5384 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5393 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5280 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5420 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5407 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5347 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5311 resets, run finished after 516 ms. (steps per millisecond=193 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5340 resets, run finished after 507 ms. (steps per millisecond=197 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5333 resets, run finished after 488 ms. (steps per millisecond=204 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 5351 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 5285 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5334 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5385 resets, run finished after 493 ms. (steps per millisecond=202 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 5400 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 5336 resets, run finished after 519 ms. (steps per millisecond=192 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-12 10:55:04] [INFO ] Flow matrix only has 148 transitions (discarded 11 similar events)
// Phase 1: matrix 148 rows 54 cols
[2023-03-12 10:55:04] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 10:55:04] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 10:55:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:55:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-12 10:55:04] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-12 10:55:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 10:55:04] [INFO ] After 176ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-12 10:55:05] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-12 10:55:05] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-12 10:55:05] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-12 10:55:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-03-12 10:55:05] [INFO ] After 696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-12 10:55:05] [INFO ] After 1263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 18 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 159/159 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 51 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 51 transition count 160
Applied a total of 7 rules in 23 ms. Remains 51 /54 variables (removed 3) and now considering 160/159 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 51/54 places, 160/159 transitions.
Incomplete random walk after 1000000 steps, including 323896 resets, run finished after 29408 ms. (steps per millisecond=34 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 100001 steps, including 5327 resets, run finished after 504 ms. (steps per millisecond=198 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5338 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5358 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5285 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5292 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5357 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5327 resets, run finished after 530 ms. (steps per millisecond=188 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5347 resets, run finished after 507 ms. (steps per millisecond=197 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5225 resets, run finished after 512 ms. (steps per millisecond=195 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5358 resets, run finished after 507 ms. (steps per millisecond=197 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5301 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5328 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5279 resets, run finished after 464 ms. (steps per millisecond=215 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5380 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5337 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5328 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-12 10:55:43] [INFO ] Flow matrix only has 149 transitions (discarded 11 similar events)
// Phase 1: matrix 149 rows 51 cols
[2023-03-12 10:55:43] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 10:55:43] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 10:55:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:55:43] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 10:55:43] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 10:55:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-12 10:55:43] [INFO ] After 110ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 10:55:43] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2023-03-12 10:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-12 10:55:43] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-12 10:55:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-03-12 10:55:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-12 10:55:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2023-03-12 10:55:44] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-12 10:55:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-12 10:55:44] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 10:55:44] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 16 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 160/160 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 154
Applied a total of 6 rules in 14 ms. Remains 48 /51 variables (removed 3) and now considering 154/160 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 48/51 places, 154/160 transitions.
Incomplete random walk after 1000000 steps, including 323056 resets, run finished after 26380 ms. (steps per millisecond=37 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 53267 resets, run finished after 4449 ms. (steps per millisecond=224 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53398 resets, run finished after 4321 ms. (steps per millisecond=231 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53166 resets, run finished after 4269 ms. (steps per millisecond=234 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53305 resets, run finished after 4315 ms. (steps per millisecond=231 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53566 resets, run finished after 4286 ms. (steps per millisecond=233 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53178 resets, run finished after 4291 ms. (steps per millisecond=233 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53525 resets, run finished after 4321 ms. (steps per millisecond=231 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53263 resets, run finished after 4251 ms. (steps per millisecond=235 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53393 resets, run finished after 4187 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53044 resets, run finished after 4099 ms. (steps per millisecond=243 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 53363 resets, run finished after 3889 ms. (steps per millisecond=257 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53475 resets, run finished after 3783 ms. (steps per millisecond=264 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 10:57:01] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
// Phase 1: matrix 143 rows 48 cols
[2023-03-12 10:57:01] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 10:57:01] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:57:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:57:01] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 10:57:01] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 10:57:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-12 10:57:01] [INFO ] After 69ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 10:57:01] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 10:57:01] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 154/154 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 152
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 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
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 12 place count 42 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 41 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 41 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 40 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 40 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 39 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 39 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 39 transition count 143
Applied a total of 24 rules in 17 ms. Remains 39 /48 variables (removed 9) and now considering 143/154 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 39/48 places, 143/154 transitions.
Incomplete random walk after 1000000 steps, including 324386 resets, run finished after 15466 ms. (steps per millisecond=64 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 1000001 steps, including 54335 resets, run finished after 3220 ms. (steps per millisecond=310 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53744 resets, run finished after 3212 ms. (steps per millisecond=311 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 54147 resets, run finished after 3213 ms. (steps per millisecond=311 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 53758 resets, run finished after 3229 ms. (steps per millisecond=309 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 54129 resets, run finished after 3216 ms. (steps per millisecond=310 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:57:33] [INFO ] Flow matrix only has 134 transitions (discarded 9 similar events)
// Phase 1: matrix 134 rows 39 cols
[2023-03-12 10:57:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 10:57:33] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:57:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:57:33] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 10:57:33] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 10:57:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-12 10:57:33] [INFO ] After 38ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 10:57:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-12 10:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-12 10:57:33] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 10:57:33] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 143/143 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 36 transition count 144
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 36 transition count 144
Applied a total of 8 rules in 12 ms. Remains 36 /39 variables (removed 3) and now considering 144/143 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 36/39 places, 144/143 transitions.
Incomplete random walk after 1000000 steps, including 323888 resets, run finished after 9417 ms. (steps per millisecond=106 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 54064 resets, run finished after 1613 ms. (steps per millisecond=619 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 53885 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:57:46] [INFO ] Flow matrix only has 135 transitions (discarded 9 similar events)
// Phase 1: matrix 135 rows 36 cols
[2023-03-12 10:57:46] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 10:57:46] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:57:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 10:57:46] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 10:57:46] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:57:46] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-12 10:57:46] [INFO ] After 19ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:57:46] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 10:57:46] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 144/144 transitions.
Graph (complete) has 176 edges and 36 vertex of which 26 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 26 transition count 123
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 22 place count 25 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 25 transition count 122
Applied a total of 23 rules in 16 ms. Remains 25 /36 variables (removed 11) and now considering 122/144 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 25/36 places, 122/144 transitions.
Incomplete random walk after 1000000 steps, including 299709 resets, run finished after 9092 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 49405 resets, run finished after 1579 ms. (steps per millisecond=633 ) properties (out of 2) seen :0
Finished Best-First random walk after 336175 steps, including 16777 resets, run visited all 2 properties in 532 ms. (steps per millisecond=631 )
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 312711 ms.
ITS solved all properties within timeout

BK_STOP 1678618678621

--------------------
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-07"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-07, 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 r215-smll-167840357800178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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