Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r121-smll-165264480700098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-11, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-165264480700098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.4K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 70K May 10 09:34 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 1652723049485

Running Version 202205111006
[2022-05-16 17:44:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 17:44:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:44:11] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-05-16 17:44:11] [INFO ] Transformed 159 places.
[2022-05-16 17:44:11] [INFO ] Transformed 334 transitions.
[2022-05-16 17:44:11] [INFO ] Found NUPN structural information;
[2022-05-16 17:44:11] [INFO ] Parsed PT model containing 159 places and 334 transitions in 312 ms.
Graph (trivial) has 270 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Structural test allowed to assert that 30 places are NOT stable. Took 16 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 844 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 129) seen :51
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) 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 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) 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 76) 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 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 75) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 73) 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 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 73) 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 73) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 73) 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 73) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 72) 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 72) seen :1
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 71) 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 71) 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 71) 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 71) 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 71) 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 71) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 71) 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 71) 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 71) 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 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 71) 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 71) 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 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 71) 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 71) 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 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 71) 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 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 71) 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 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 71) 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 71) 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 71) 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 71) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 71) 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 71) 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 71) 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 71) 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 71) 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 71) seen :0
Running SMT prover for 71 properties.
[2022-05-16 17:44:13] [INFO ] Flow matrix only has 285 transitions (discarded 17 similar events)
// Phase 1: matrix 285 rows 154 cols
[2022-05-16 17:44:13] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-16 17:44:14] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2022-05-16 17:44:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-05-16 17:44:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2022-05-16 17:44:16] [INFO ] After 910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2022-05-16 17:44:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:44:16] [INFO ] After 789ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :71
[2022-05-16 17:44:17] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 7 ms to minimize.
[2022-05-16 17:44:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-16 17:44:18] [INFO ] After 2204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
Attempting to minimize the solution found.
Minimization took 796 ms.
[2022-05-16 17:44:19] [INFO ] After 4772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
Fused 71 Parikh solutions to 48 different solutions.
Parikh walk visited 1 properties in 810 ms.
Support contains 70 out of 154 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 154/154 places, 302/302 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 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 20 rules applied. Total rules applied 20 place count 154 transition count 282
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 24 place count 152 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 152 transition count 278
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 29 place count 149 transition count 278
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 63 place count 115 transition count 210
Iterating global reduction 2 with 34 rules applied. Total rules applied 97 place count 115 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 112 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 112 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 112 transition count 203
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 105 transition count 233
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 105 transition count 226
Applied a total of 125 rules in 86 ms. Remains 105 /154 variables (removed 49) and now considering 226/302 (removed 76) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/154 places, 226/302 transitions.
Interrupted random walk after 783120 steps, including 181212 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 32
Incomplete Best-First random walk after 100001 steps, including 3188 resets, run finished after 515 ms. (steps per millisecond=194 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3229 resets, run finished after 579 ms. (steps per millisecond=172 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3256 resets, run finished after 528 ms. (steps per millisecond=189 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3211 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3267 resets, run finished after 686 ms. (steps per millisecond=145 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3191 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3233 resets, run finished after 575 ms. (steps per millisecond=173 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3243 resets, run finished after 754 ms. (steps per millisecond=132 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3254 resets, run finished after 586 ms. (steps per millisecond=170 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3237 resets, run finished after 631 ms. (steps per millisecond=158 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3203 resets, run finished after 658 ms. (steps per millisecond=151 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3269 resets, run finished after 995 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3244 resets, run finished after 651 ms. (steps per millisecond=153 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3220 resets, run finished after 576 ms. (steps per millisecond=173 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3226 resets, run finished after 622 ms. (steps per millisecond=160 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3246 resets, run finished after 719 ms. (steps per millisecond=139 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 3215 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3225 resets, run finished after 509 ms. (steps per millisecond=196 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3254 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3198 resets, run finished after 524 ms. (steps per millisecond=190 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 3244 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3261 resets, run finished after 527 ms. (steps per millisecond=189 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3251 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3230 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3236 resets, run finished after 528 ms. (steps per millisecond=189 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3204 resets, run finished after 547 ms. (steps per millisecond=182 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3214 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3231 resets, run finished after 578 ms. (steps per millisecond=173 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3233 resets, run finished after 599 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3217 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3213 resets, run finished after 524 ms. (steps per millisecond=190 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3206 resets, run finished after 538 ms. (steps per millisecond=185 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3272 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 3212 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3222 resets, run finished after 543 ms. (steps per millisecond=184 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3238 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3221 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 3249 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2022-05-16 17:45:12] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
// Phase 1: matrix 216 rows 105 cols
[2022-05-16 17:45:12] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 17:45:12] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2022-05-16 17:45:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 17:45:12] [INFO ] [Nat]Absence check using 10 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-16 17:45:13] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2022-05-16 17:45:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 17:45:13] [INFO ] After 389ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2022-05-16 17:45:14] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2022-05-16 17:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-16 17:45:14] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 369 ms.
[2022-05-16 17:45:14] [INFO ] After 2442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Fused 38 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 38 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 226/226 transitions.
Graph (complete) has 512 edges and 105 vertex of which 96 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 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 96 transition count 222
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 92 transition count 221
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 23 place count 79 transition count 195
Iterating global reduction 2 with 13 rules applied. Total rules applied 36 place count 79 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 78 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 78 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 78 transition count 189
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 3 with 2 rules applied. Total rules applied 44 place count 77 transition count 188
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 74 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 73 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 73 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 73 transition count 184
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 73 place count 73 transition count 184
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 87 place count 73 transition count 184
Applied a total of 87 rules in 71 ms. Remains 73 /105 variables (removed 32) and now considering 184/226 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/105 places, 184/226 transitions.
Interrupted random walk after 782118 steps, including 133959 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 9
Incomplete Best-First random walk after 100001 steps, including 2290 resets, run finished after 886 ms. (steps per millisecond=112 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 100000 steps, including 2305 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 100000 steps, including 2331 resets, run finished after 597 ms. (steps per millisecond=167 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 100001 steps, including 2283 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 100001 steps, including 2273 resets, run finished after 720 ms. (steps per millisecond=138 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 100000 steps, including 2286 resets, run finished after 898 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 2288 resets, run finished after 676 ms. (steps per millisecond=147 ) properties (out of 23) seen :4
Incomplete Best-First random walk after 100001 steps, including 2282 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100000 steps, including 2278 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 100001 steps, including 2296 resets, run finished after 486 ms. (steps per millisecond=205 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2302 resets, run finished after 504 ms. (steps per millisecond=198 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2306 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2308 resets, run finished after 538 ms. (steps per millisecond=185 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2334 resets, run finished after 614 ms. (steps per millisecond=162 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2281 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2285 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2321 resets, run finished after 505 ms. (steps per millisecond=198 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2274 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2294 resets, run finished after 467 ms. (steps per millisecond=214 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2303 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-05-16 17:45:56] [INFO ] Flow matrix only has 167 transitions (discarded 17 similar events)
// Phase 1: matrix 167 rows 73 cols
[2022-05-16 17:45:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 17:45:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-16 17:45:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 17:45:56] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-16 17:45:56] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-16 17:45:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 17:45:56] [INFO ] After 175ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-16 17:45:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2022-05-16 17:45:57] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2022-05-16 17:45:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2022-05-16 17:45:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-16 17:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-05-16 17:45:57] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-16 17:45:57] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1240 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 184/184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 60 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 60 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 59 transition count 157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 56 transition count 175
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 56 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 56 transition count 174
Applied a total of 40 rules in 32 ms. Remains 56 /73 variables (removed 17) and now considering 174/184 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/73 places, 174/184 transitions.
Interrupted random walk after 959991 steps, including 164933 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 6
Incomplete Best-First random walk after 1000001 steps, including 22877 resets, run finished after 4264 ms. (steps per millisecond=234 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 22924 resets, run finished after 4274 ms. (steps per millisecond=233 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23102 resets, run finished after 4319 ms. (steps per millisecond=231 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23083 resets, run finished after 4551 ms. (steps per millisecond=219 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23074 resets, run finished after 4561 ms. (steps per millisecond=219 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22943 resets, run finished after 4562 ms. (steps per millisecond=219 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22984 resets, run finished after 4481 ms. (steps per millisecond=223 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22921 resets, run finished after 4374 ms. (steps per millisecond=228 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 22888 resets, run finished after 4349 ms. (steps per millisecond=229 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-16 17:47:08] [INFO ] Flow matrix only has 157 transitions (discarded 17 similar events)
// Phase 1: matrix 157 rows 56 cols
[2022-05-16 17:47:08] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 17:47:08] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-16 17:47:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 17:47:08] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-16 17:47:08] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-16 17:47:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-16 17:47:08] [INFO ] After 108ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-16 17:47:08] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-16 17:47:08] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 856 ms.
Support contains 9 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 174/174 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 172
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 53 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 10 place count 51 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 51 transition count 170
Applied a total of 11 rules in 18 ms. Remains 51 /56 variables (removed 5) and now considering 170/174 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/56 places, 170/174 transitions.
Incomplete random walk after 1000000 steps, including 171989 resets, run finished after 27835 ms. (steps per millisecond=35 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000000 steps, including 22995 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22797 resets, run finished after 3678 ms. (steps per millisecond=271 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23014 resets, run finished after 3848 ms. (steps per millisecond=259 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22931 resets, run finished after 3691 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22843 resets, run finished after 3855 ms. (steps per millisecond=259 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22915 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22903 resets, run finished after 3702 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-16 17:48:03] [INFO ] Flow matrix only has 153 transitions (discarded 17 similar events)
// Phase 1: matrix 153 rows 51 cols
[2022-05-16 17:48:03] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 17:48:03] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 17:48:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 17:48:03] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 17:48:03] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 17:48:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 17:48:04] [INFO ] After 72ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-16 17:48:04] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-16 17:48:04] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 358 ms.
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 170/170 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 169
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 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 47 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 47 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 46 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 46 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 46 transition count 149
Applied a total of 16 rules in 14 ms. Remains 46 /51 variables (removed 5) and now considering 149/170 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/51 places, 149/170 transitions.
Incomplete random walk after 1000000 steps, including 171562 resets, run finished after 20372 ms. (steps per millisecond=49 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 1000001 steps, including 23128 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23188 resets, run finished after 2426 ms. (steps per millisecond=412 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 23208 resets, run finished after 2536 ms. (steps per millisecond=394 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-16 17:48:32] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 46 cols
[2022-05-16 17:48:32] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 17:48:32] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 17:48:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 17:48:32] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 17:48:32] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 17:48:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-16 17:48:32] [INFO ] After 24ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 17:48:32] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-16 17:48:32] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 46/46 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 42 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 42 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 41 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 41 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 41 transition count 128
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 18 place count 40 transition count 127
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 1 with 2 rules applied. Total rules applied 20 place count 39 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 38 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 38 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 37 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 37 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 36 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 36 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 32 place count 36 transition count 107
Applied a total of 32 rules in 18 ms. Remains 36 /46 variables (removed 10) and now considering 107/149 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/46 places, 107/149 transitions.
Incomplete random walk after 1000000 steps, including 172188 resets, run finished after 15141 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23818 resets, run finished after 2511 ms. (steps per millisecond=398 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 23812 resets, run finished after 2552 ms. (steps per millisecond=391 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23790 resets, run finished after 2593 ms. (steps per millisecond=385 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3682 steps, run visited all 3 properties in 72 ms. (steps per millisecond=51 )
Probabilistic random walk after 3682 steps, saw 1326 distinct states, run finished after 72 ms. (steps per millisecond=51 ) properties seen :3
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 283968 ms.

BK_STOP 1652723335477

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-11"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-11, 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 r121-smll-165264480700098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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