Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 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 1678610765527

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-12 08:46:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 08:46:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:46:08] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-12 08:46:08] [INFO ] Transformed 154 places.
[2023-03-12 08:46:08] [INFO ] Transformed 319 transitions.
[2023-03-12 08:46:08] [INFO ] Found NUPN structural information;
[2023-03-12 08:46:08] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 198 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 5 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 15 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 718 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 120) seen :60
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) 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 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) 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 60) 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 60) 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 60) 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 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Running SMT prover for 60 properties.
[2023-03-12 08:46:09] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2023-03-12 08:46:09] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-12 08:46:10] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:60
[2023-03-12 08:46:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2023-03-12 08:46:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-12 08:46:12] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :60
[2023-03-12 08:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:46:13] [INFO ] After 951ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :60
[2023-03-12 08:46:13] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 12 ms to minimize.
[2023-03-12 08:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-12 08:46:14] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2023-03-12 08:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-12 08:46:15] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 10 ms to minimize.
[2023-03-12 08:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-12 08:46:15] [INFO ] After 3096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :60
Attempting to minimize the solution found.
Minimization took 829 ms.
[2023-03-12 08:46:16] [INFO ] After 5544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :60
Fused 60 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 662 ms.
Support contains 60 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 287/287 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 147 transition count 263
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 143 transition count 259
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 143 transition count 255
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 136 transition count 255
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 79 place count 100 transition count 183
Iterating global reduction 2 with 36 rules applied. Total rules applied 115 place count 100 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 95 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 95 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 95 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 89 transition count 193
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 89 transition count 185
Applied a total of 151 rules in 88 ms. Remains 89 /147 variables (removed 58) and now considering 185/287 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 89/147 places, 185/287 transitions.
Interrupted random walk after 866038 steps, including 259338 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 26
Incomplete Best-First random walk after 100001 steps, including 3606 resets, run finished after 455 ms. (steps per millisecond=219 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 3642 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 3639 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 100001 steps, including 3557 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3619 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3607 resets, run finished after 390 ms. (steps per millisecond=256 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3577 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3602 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 3639 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 3640 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3582 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3492 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3671 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3613 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3643 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3623 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3606 resets, run finished after 316 ms. (steps per millisecond=316 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3668 resets, run finished after 348 ms. (steps per millisecond=287 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3605 resets, run finished after 327 ms. (steps per millisecond=305 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3639 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3586 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3648 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3680 resets, run finished after 395 ms. (steps per millisecond=253 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3612 resets, run finished after 388 ms. (steps per millisecond=257 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3599 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3650 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3618 resets, run finished after 379 ms. (steps per millisecond=263 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3577 resets, run finished after 377 ms. (steps per millisecond=265 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3625 resets, run finished after 391 ms. (steps per millisecond=255 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3624 resets, run finished after 367 ms. (steps per millisecond=272 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3662 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3608 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-12 08:46:58] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
// Phase 1: matrix 182 rows 89 cols
[2023-03-12 08:46:58] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-12 08:46:58] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 08:46:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-12 08:46:58] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-12 08:46:59] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-12 08:46:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 08:46:59] [INFO ] After 341ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-12 08:47:00] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2023-03-12 08:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-12 08:47:00] [INFO ] After 1085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-12 08:47:00] [INFO ] After 2006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 32 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 185/185 transitions.
Graph (complete) has 429 edges and 89 vertex of which 80 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 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 80 transition count 181
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 76 transition count 180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 19 place count 67 transition count 162
Iterating global reduction 2 with 9 rules applied. Total rules applied 28 place count 67 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 67 transition count 161
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 3 with 4 rules applied. Total rules applied 33 place count 65 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 39 place count 62 transition count 169
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 62 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 61 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 61 transition count 164
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 61 transition count 160
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 60 place count 61 transition count 160
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 73 place count 61 transition count 160
Applied a total of 73 rules in 67 ms. Remains 61 /89 variables (removed 28) and now considering 160/185 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 61/89 places, 160/185 transitions.
Incomplete random walk after 1000000 steps, including 311956 resets, run finished after 28234 ms. (steps per millisecond=35 ) properties (out of 32) seen :10
Incomplete Best-First random walk after 100001 steps, including 3508 resets, run finished after 329 ms. (steps per millisecond=303 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 3517 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 3511 resets, run finished after 340 ms. (steps per millisecond=294 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 100001 steps, including 3488 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3537 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3528 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3528 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3496 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3494 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3528 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3480 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3506 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 3478 resets, run finished after 396 ms. (steps per millisecond=252 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 3560 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 3492 resets, run finished after 372 ms. (steps per millisecond=268 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 3535 resets, run finished after 351 ms. (steps per millisecond=284 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 3501 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 3515 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-12 08:47:34] [INFO ] Flow matrix only has 149 transitions (discarded 11 similar events)
// Phase 1: matrix 149 rows 61 cols
[2023-03-12 08:47:34] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 08:47:35] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 08:47:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:47:35] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-12 08:47:35] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 08:47:35] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 08:47:35] [INFO ] After 117ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-12 08:47:35] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-12 08:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-12 08:47:35] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2023-03-12 08:47:35] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-12 08:47:35] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-12 08:47:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2023-03-12 08:47:35] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 08:47:35] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 160/160 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 54 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 54 transition count 146
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 16 place count 53 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
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 22 place count 50 transition count 157
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 50 transition count 156
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 50 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 49 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 49 transition count 152
Applied a total of 28 rules in 33 ms. Remains 49 /61 variables (removed 12) and now considering 152/160 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 49/61 places, 152/160 transitions.
Incomplete random walk after 1000000 steps, including 311646 resets, run finished after 25892 ms. (steps per millisecond=38 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 1000000 steps, including 35016 resets, run finished after 2541 ms. (steps per millisecond=393 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34893 resets, run finished after 2525 ms. (steps per millisecond=396 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35002 resets, run finished after 2670 ms. (steps per millisecond=374 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35048 resets, run finished after 2443 ms. (steps per millisecond=409 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35019 resets, run finished after 2426 ms. (steps per millisecond=412 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34963 resets, run finished after 2431 ms. (steps per millisecond=411 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35040 resets, run finished after 2421 ms. (steps per millisecond=413 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 08:48:19] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 49 cols
[2023-03-12 08:48:19] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 08:48:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 08:48:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:48:19] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 08:48:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 08:48:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 08:48:19] [INFO ] After 46ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 08:48:19] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 08:48:19] [INFO ] After 300ms 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 313 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 152/152 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 45 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 45 transition count 144
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 10 place count 44 transition count 143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 16 place count 41 transition count 145
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 41 transition count 145
Applied a total of 18 rules in 52 ms. Remains 41 /49 variables (removed 8) and now considering 145/152 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 41/49 places, 145/152 transitions.
Incomplete random walk after 1000000 steps, including 311464 resets, run finished after 19703 ms. (steps per millisecond=50 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 35040 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34866 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 34907 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35181 resets, run finished after 2178 ms. (steps per millisecond=459 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35097 resets, run finished after 2187 ms. (steps per millisecond=457 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 08:48:50] [INFO ] Flow matrix only has 134 transitions (discarded 11 similar events)
// Phase 1: matrix 134 rows 41 cols
[2023-03-12 08:48:50] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 08:48:50] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 08:48:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:48:50] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 08:48:50] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 08:48:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 08:48:51] [INFO ] After 54ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 08:48:51] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 08:48:51] [INFO ] After 311ms 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 121 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 145/145 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 40 transition count 144
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 39 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 38 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 38 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 130
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 36 transition count 124
Applied a total of 16 rules in 21 ms. Remains 36 /41 variables (removed 5) and now considering 124/145 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 36/41 places, 124/145 transitions.
Incomplete random walk after 1000000 steps, including 314024 resets, run finished after 14333 ms. (steps per millisecond=69 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 36043 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 36222 resets, run finished after 1537 ms. (steps per millisecond=650 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 36135 resets, run finished after 1519 ms. (steps per millisecond=658 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:49:10] [INFO ] Flow matrix only has 115 transitions (discarded 9 similar events)
// Phase 1: matrix 115 rows 36 cols
[2023-03-12 08:49:10] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 08:49:10] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:49:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 08:49:10] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 08:49:10] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:49:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-12 08:49:10] [INFO ] After 20ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:49:10] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 08:49:10] [INFO ] After 153ms 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 53 ms.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 124/124 transitions.
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 2 place count 35 transition count 123
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 34 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 33 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 33 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 32 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 32 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 31 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 31 transition count 109
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 31 transition count 103
Applied a total of 16 rules in 10 ms. Remains 31 /36 variables (removed 5) and now considering 103/124 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 31/36 places, 103/124 transitions.
Incomplete random walk after 1000000 steps, including 317030 resets, run finished after 12788 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37364 resets, run finished after 1545 ms. (steps per millisecond=647 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37249 resets, run finished after 1543 ms. (steps per millisecond=648 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37090 resets, run finished after 1557 ms. (steps per millisecond=642 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1986 steps, run visited all 3 properties in 43 ms. (steps per millisecond=46 )
Probabilistic random walk after 1986 steps, saw 699 distinct states, run finished after 43 ms. (steps per millisecond=46 ) properties seen :3
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 199632 ms.
ITS solved all properties within timeout

BK_STOP 1678610968959

--------------------
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-06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r213-smll-167840356600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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