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

About the Execution of LoLa+red for Kanban-PT-10000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
795.075 45546.00 50357.00 333.70 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 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.r231-tall-167856415900317.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 Kanban-PT-10000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415900317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679444394962

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=Kanban-PT-10000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 00:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:19:56] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 00:19:56] [INFO ] Transformed 16 places.
[2023-03-22 00:19:56] [INFO ] Transformed 16 transitions.
[2023-03-22 00:19:56] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 00:19:56] [INFO ] Computed 5 place invariants in 8 ms
FORMULA Kanban-PT-10000-UpperBounds-08 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-UpperBounds-03 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-UpperBounds-02 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :154
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :93
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :111
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :176
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :420
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :2502
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :105
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :120
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :2502
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 13) seen :2502
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 13) seen :170
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :158
[2023-03-22 00:19:56] [INFO ] Invariant cache hit.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 14 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 13 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:19:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:19:57] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 14 causal constraints over 4 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:19:57] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 00:19:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:57] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 00:19:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 00:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 00:19:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:58] [INFO ] Added : 4 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 00:19:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 00:19:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 00:19:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:19:58] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 30000, 10000, 10000, 30000, 10000, 10000, 10000, 10000, 10000, 30000] Max seen :[23, 27, 26, 47, 417, 834, 50, 23, 45, 834, 834, 45, 47]
FORMULA Kanban-PT-10000-UpperBounds-14 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-13 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-12 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-11 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-07 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-10 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-01 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-10000-UpperBounds-04 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 7 transition count 6
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 5 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 3 transition count 4
Applied a total of 17 rules in 1441 ms. Remains 3 /16 variables (removed 13) and now considering 4/16 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1441 ms. Remains : 3/16 places, 4/16 transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-03-22 00:20:39] [INFO ] Computed 1 place invariants in 1 ms
FORMULA Kanban-PT-10000-UpperBounds-15 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000106 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=12659 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 43132 ms.
ITS solved all properties within timeout

BK_STOP 1679444440508

--------------------
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="Kanban-PT-10000"
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 Kanban-PT-10000, 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 r231-tall-167856415900317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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