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

About the Execution of LoLa+red for NeighborGrid-PT-d4n3m2c23

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.060 35474.00 47525.00 776.40 162 162 162 162 162 162 162 162 162 162 162 162 162 162 162 162 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.r263-smll-167863537700101.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 NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537700101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 8.3K Feb 26 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 26 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 469K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678718239709

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d4n3m2c23
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 14:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 14:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:37:23] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-13 14:37:23] [INFO ] Transformed 81 places.
[2023-03-13 14:37:23] [INFO ] Transformed 1632 transitions.
[2023-03-13 14:37:23] [INFO ] Parsed PT model containing 81 places and 1632 transitions and 3264 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1632 rows 81 cols
[2023-03-13 14:37:24] [INFO ] Computed 1 place invariants in 62 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :608
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :35
[2023-03-13 14:37:24] [INFO ] Invariant cache hit.
[2023-03-13 14:37:24] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-13 14:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:25] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-13 14:37:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:25] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-13 14:37:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 152 ms.
[2023-03-13 14:37:26] [INFO ] Added : 0 causal constraints over 0 iterations in 341 ms. Result :sat
Minimization took 118 ms.
[2023-03-13 14:37:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 14:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:26] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-13 14:37:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 156 ms.
[2023-03-13 14:37:27] [INFO ] Added : 0 causal constraints over 0 iterations in 347 ms. Result :sat
Minimization took 191 ms.
[2023-03-13 14:37:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:28] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-13 14:37:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:28] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2023-03-13 14:37:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 124 ms.
[2023-03-13 14:37:28] [INFO ] Added : 0 causal constraints over 0 iterations in 307 ms. Result :sat
Minimization took 147 ms.
[2023-03-13 14:37:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:29] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-13 14:37:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 128 ms.
[2023-03-13 14:37:29] [INFO ] Added : 0 causal constraints over 0 iterations in 317 ms. Result :sat
Minimization took 183 ms.
[2023-03-13 14:37:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:30] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-13 14:37:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:31] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2023-03-13 14:37:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 141 ms.
[2023-03-13 14:37:31] [INFO ] Added : 0 causal constraints over 0 iterations in 311 ms. Result :sat
Minimization took 156 ms.
[2023-03-13 14:37:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:32] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-13 14:37:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 147 ms.
[2023-03-13 14:37:32] [INFO ] Added : 0 causal constraints over 0 iterations in 333 ms. Result :sat
Minimization took 183 ms.
[2023-03-13 14:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:33] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2023-03-13 14:37:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:33] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-13 14:37:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 122 ms.
[2023-03-13 14:37:34] [INFO ] Added : 0 causal constraints over 0 iterations in 255 ms. Result :sat
Minimization took 98 ms.
[2023-03-13 14:37:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:34] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-13 14:37:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:35] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-13 14:37:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-13 14:37:35] [INFO ] Added : 0 causal constraints over 0 iterations in 229 ms. Result :sat
Minimization took 102 ms.
[2023-03-13 14:37:35] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:36] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-13 14:37:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-13 14:37:36] [INFO ] Added : 0 causal constraints over 0 iterations in 251 ms. Result :sat
Minimization took 179 ms.
[2023-03-13 14:37:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:37] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-13 14:37:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-13 14:37:37] [INFO ] Added : 0 causal constraints over 0 iterations in 308 ms. Result :sat
Minimization took 186 ms.
[2023-03-13 14:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:38] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-13 14:37:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:38] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2023-03-13 14:37:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 139 ms.
[2023-03-13 14:37:39] [INFO ] Added : 0 causal constraints over 0 iterations in 302 ms. Result :sat
Minimization took 145 ms.
[2023-03-13 14:37:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:39] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-13 14:37:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 141 ms.
[2023-03-13 14:37:40] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 184 ms.
[2023-03-13 14:37:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:41] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-13 14:37:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:41] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-13 14:37:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 151 ms.
[2023-03-13 14:37:41] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 151 ms.
[2023-03-13 14:37:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:42] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-13 14:37:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:43] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2023-03-13 14:37:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 141 ms.
[2023-03-13 14:37:43] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 144 ms.
[2023-03-13 14:37:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 14:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:44] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-13 14:37:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-13 14:37:44] [INFO ] Added : 0 causal constraints over 0 iterations in 190 ms. Result :sat
Minimization took 148 ms.
[2023-03-13 14:37:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:45] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-13 14:37:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:37:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 14:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:37:45] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-13 14:37:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 138 ms.
[2023-03-13 14:37:46] [INFO ] Added : 0 causal constraints over 0 iterations in 302 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162] Max seen :[17, 57, 17, 52, 57, 47, 57, 57, 17, 22, 5, 38, 14, 67, 30, 57]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-09 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-08 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-07 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-06 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-05 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-04 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-03 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-02 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-01 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-00 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 30529 ms.
ITS solved all properties within timeout

BK_STOP 1678718275183

--------------------
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 UpperBounds -timeout 360 -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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 NeighborGrid-PT-d4n3m2c23, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537700101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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