fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r245-tall-171654350600749
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PGCD-PT-D02N006

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
550.903 7820.00 15590.00 77.90 19 19 19 17 19 17 19 19 17 19 19 17 19 19 19 19 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654350600749.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PGCD-PT-D02N006, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350600749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.1K Apr 11 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.6K May 18 16:43 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 PGCD-PT-D02N006-UpperBounds-00
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-01
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-02
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-03
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-04
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-05
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-06
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-07
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-08
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-09
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-10
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-11
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-12
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-13
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-14
FORMULA_NAME PGCD-PT-D02N006-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716705877043

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N006
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 06:44:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 06:44:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 06:44:38] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-26 06:44:38] [INFO ] Transformed 9 places.
[2024-05-26 06:44:38] [INFO ] Transformed 9 transitions.
[2024-05-26 06:44:38] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 8
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 6, 1, 1, 6, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 6, 1, 1, 6, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 06:44:38] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 6, 1, 1, 6, 1, 1] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
RANDOM walk for 10007 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 80006 steps (16 resets) in 77 ms. (1025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 15, 13, 15, 15, 13, 15, 15] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
[2024-05-26 06:44:38] [INFO ] Invariant cache hit.
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 06:44:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:44:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-26 06:44:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:44:38] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-26 06:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-05-26 06:44:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:38] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 8 ms to minimize.
[2024-05-26 06:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-26 06:44:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 06:44:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:38] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 06:44:39] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:39] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 06:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-26 06:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-26 06:44:39] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:44:39] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:39] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 06:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:39] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:39] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 15, 13, 15, 15, 13, 15, 15] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 19, 17, 19, 19, 17, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:44:39] [INFO ] Invariant cache hit.
[2024-05-26 06:44:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 06:44:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 19, 17, 19, 19, 17, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
RANDOM walk for 1000014 steps (2 resets) in 267 ms. (3731 steps per ms)
BEST_FIRST walk for 8000005 steps (16 resets) in 1907 ms. (4192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 19, 17, 19, 19, 17, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
[2024-05-26 06:44:41] [INFO ] Invariant cache hit.
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:44:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:44:41] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-26 06:44:41] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:44:41] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned unsat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-26 06:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-26 06:44:42] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:44:42] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned unsat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[19, 19, 17, 19, 19, 17, 19, 19] Max Struct:[19, 19, 21, 19, 19, 21, 19, 19]
FORMULA PGCD-PT-D02N006-UpperBounds-14 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-15 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-12 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-09 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-06 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-04 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-07 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-10 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-00 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 06:44:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 17] Max Struct:[21, 21]
RANDOM walk for 1000002 steps (2 resets) in 195 ms. (5102 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 435 ms. (4587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2024-05-26 06:44:42] [INFO ] Invariant cache hit.
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-26 06:44:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:44:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:44:42] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:44:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-26 06:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-26 06:44:42] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 17] Max Struct:[21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:44:43] [INFO ] Invariant cache hit.
[2024-05-26 06:44:43] [INFO ] Implicit Places using invariants in 30 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35 ms. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-05-26 06:44:43] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[17, 17] Max Struct:[21, 21]
RANDOM walk for 1000003 steps (2 resets) in 313 ms. (3184 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 347 ms. (5747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2024-05-26 06:44:43] [INFO ] Invariant cache hit.
[2024-05-26 06:44:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:44:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:44:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:44:43] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:44:43] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:44:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:44:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:44:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:44:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:44:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:44:43] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 06:44:43] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 17] Max Struct:[21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:44:43] [INFO ] Invariant cache hit.
[2024-05-26 06:44:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 06:44:43] [INFO ] Invariant cache hit.
[2024-05-26 06:44:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:44:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 06:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:44:43] [INFO ] Invariant cache hit.
[2024-05-26 06:44:43] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40018 steps (8 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
Probably explored full state space saw : 15670 states, properties seen :0
Probabilistic random walk after 101911 steps, saw 15670 distinct states, run finished after 285 ms. (steps per millisecond=357 ) properties seen :0
Explored full state space saw : 15670 states, properties seen :0
Exhaustive walk after 101911 steps, saw 15670 distinct states, run finished after 114 ms. (steps per millisecond=893 ) properties seen :0
FORMULA PGCD-PT-D02N006-UpperBounds-08 17 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N006-UpperBounds-05 17 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N006-UpperBounds-11 17 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N006-UpperBounds-03 17 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 6654 ms.
ITS solved all properties within timeout

BK_STOP 1716705884863

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PGCD-PT-D02N006"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PGCD-PT-D02N006, 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 r245-tall-171654350600749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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