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

About the Execution of Smart+red for StigmergyCommit-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
466.243 83720.00 135137.00 912.70 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r473-smll-167912661100262.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 smartxred
Input is StigmergyCommit-PT-03b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r473-smll-167912661100262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 359K Mar 5 18:23 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679407128221

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 13:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-21 13:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 13:58:52] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-21 13:58:52] [INFO ] Transformed 1231 places.
[2023-03-21 13:58:52] [INFO ] Transformed 1476 transitions.
[2023-03-21 13:58:52] [INFO ] Found NUPN structural information;
[2023-03-21 13:58:52] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 427 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1222 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 16 ms
Free SCC test removed 72 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 924 transitions
Trivial Post-agglo rules discarded 924 transitions
Performed 924 trivial Post agglomeration. Transition count delta: 924
Iterating post reduction 0 with 924 rules applied. Total rules applied 925 place count 1159 transition count 472
Reduce places removed 924 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 940 rules applied. Total rules applied 1865 place count 235 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1869 place count 231 transition count 456
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1869 place count 231 transition count 412
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1957 place count 187 transition count 412
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 2077 place count 127 transition count 352
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2097 place count 117 transition count 370
Applied a total of 2097 rules in 147 ms. Remains 117 /1231 variables (removed 1114) and now considering 370/1476 (removed 1106) transitions.
[2023-03-21 13:58:52] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
// Phase 1: matrix 358 rows 117 cols
[2023-03-21 13:58:52] [INFO ] Computed 5 place invariants in 28 ms
[2023-03-21 13:58:53] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-21 13:58:53] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 13:58:53] [INFO ] Invariant cache hit.
[2023-03-21 13:58:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-21 13:58:53] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-21 13:58:53] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 13:58:53] [INFO ] Invariant cache hit.
[2023-03-21 13:58:54] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 117/1231 places, 370/1476 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1867 ms. Remains : 117/1231 places, 370/1476 transitions.
Discarding 102 transitions out of 370. Remains 268
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1508 resets, run finished after 1124 ms. (steps per millisecond=8 ) properties (out of 267) seen :34
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 233) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 233) seen :0
Running SMT prover for 233 properties.
[2023-03-21 13:58:55] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 13:58:55] [INFO ] Invariant cache hit.
[2023-03-21 13:58:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-21 13:59:05] [INFO ] After 9129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:233
[2023-03-21 13:59:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-21 13:59:13] [INFO ] After 6025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :233
[2023-03-21 13:59:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-21 13:59:20] [INFO ] After 6437ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :233
[2023-03-21 13:59:20] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 10 ms to minimize.
[2023-03-21 13:59:20] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 2 ms to minimize.
[2023-03-21 13:59:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2023-03-21 13:59:21] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2023-03-21 13:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-21 13:59:21] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2023-03-21 13:59:21] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-21 13:59:21] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 1 ms to minimize.
[2023-03-21 13:59:21] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-21 13:59:22] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2023-03-21 13:59:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 978 ms
[2023-03-21 13:59:22] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2023-03-21 13:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-21 13:59:22] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2023-03-21 13:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-21 13:59:22] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2023-03-21 13:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-21 13:59:29] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-21 13:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-21 13:59:29] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-21 13:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-21 13:59:30] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2023-03-21 13:59:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-21 13:59:30] [INFO ] After 16438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :232
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 13:59:30] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :232
Fused 233 Parikh solutions to 231 different solutions.
Parikh walk visited 0 properties in 2249 ms.
Support contains 89 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 370/370 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 117 transition count 357
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 113 transition count 353
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 113 transition count 353
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 109 transition count 349
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 109 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 105 transition count 345
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 105 transition count 345
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 57 place count 105 transition count 325
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 73 place count 105 transition count 309
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 105 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 104 transition count 308
Applied a total of 75 rules in 119 ms. Remains 104 /117 variables (removed 13) and now considering 308/370 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 104/117 places, 308/370 transitions.
Interrupted random walk after 728613 steps, including 100712 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 210
Incomplete Best-First random walk after 100001 steps, including 1573 resets, run finished after 421 ms. (steps per millisecond=237 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 888 resets, run finished after 749 ms. (steps per millisecond=133 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 100001 steps, including 892 resets, run finished after 526 ms. (steps per millisecond=190 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 100001 steps, including 873 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 879 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 885 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 100001 steps, including 883 resets, run finished after 456 ms. (steps per millisecond=219 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 100001 steps, including 880 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 100000 steps, including 886 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 100001 steps, including 875 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 100001 steps, including 877 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 100001 steps, including 873 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 308 rows 104 cols
[2023-03-21 14:00:07] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 14:00:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-21 14:00:08] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 14:00:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-21 14:00:08] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 14:00:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-21 14:00:08] [INFO ] After 131ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 14:00:08] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2023-03-21 14:00:08] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-21 14:00:08] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2023-03-21 14:00:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 1 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-03-21 14:00:09] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2023-03-21 14:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-21 14:00:10] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2023-03-21 14:00:10] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2023-03-21 14:00:10] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-21 14:00:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2023-03-21 14:00:10] [INFO ] After 2226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-21 14:00:10] [INFO ] After 2577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 196 steps, including 9 resets, run visited all 5 properties in 7 ms. (steps per millisecond=28 )
Parikh walk visited 5 properties in 6 ms.
Able to resolve query QuasiLiveness after proving 268 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 78928 ms.
ITS solved all properties within timeout

BK_STOP 1679407211941

--------------------
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 QuasiLiveness -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="StigmergyCommit-PT-03b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-03b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r473-smll-167912661100262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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