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.r246-tall-171654352300749.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 itstools
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 r246-tall-171654352300749
=====================================================================

--------------------
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 1716722420131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-26 11:20:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 11:20:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 11:20:21] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-26 11:20:21] [INFO ] Transformed 9 places.
[2024-05-26 11:20:21] [INFO ] Transformed 9 transitions.
[2024-05-26 11:20:21] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 11:20:21] [INFO ] Computed 4 invariants in 6 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 20 ms. (476 steps per ms)
BEST_FIRST walk for 80003 steps (16 resets) in 70 ms. (1126 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 11:20:21] [INFO ] Invariant cache hit.
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 11:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 11:20:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 11:20:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:21] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 11:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 11:20:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:21] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 6 ms to minimize.
[2024-05-26 11:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:22] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:22] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-26 11:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 11:20:22] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 11:20:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:22] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 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 10 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 11:20:22] [INFO ] Invariant cache hit.
[2024-05-26 11:20:22] [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 67 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 46 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 143ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 11:20:22] [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 1000003 steps (2 resets) in 517 ms. (1930 steps per ms)
BEST_FIRST walk for 8000004 steps (16 resets) in 2162 ms. (3698 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 11:20:25] [INFO ] Invariant cache hit.
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 11:20:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:25] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-26 11:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-26 11:20:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 11:20:25] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:25] [INFO ] [Nat]Absence check using state equation in 8 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 2 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 2 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 11:20:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 17] Max Struct:[21, 21]
RANDOM walk for 1000000 steps (2 resets) in 202 ms. (4926 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 412 ms. (4842 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2024-05-26 11:20:26] [INFO ] Invariant cache hit.
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 11:20:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 11:20:26] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-26 11:20:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 11:20:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-26 11:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-26 11:20:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 11:20:26] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 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 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.
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 11:20:26] [INFO ] Invariant cache hit.
[2024-05-26 11:20:26] [INFO ] Implicit Places using invariants in 34 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 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 39 ms. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-05-26 11:20:26] [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 1000001 steps (2 resets) in 233 ms. (4273 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 361 ms. (5524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2024-05-26 11:20:27] [INFO ] Invariant cache hit.
[2024-05-26 11:20:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 11:20:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 11:20:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 11:20:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 11:20:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 11:20:27] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 11:20:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 11:20:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 11:20:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 11:20:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 11:20:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 11:20:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 11:20:27] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 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 0 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 0 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 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 11:20:27] [INFO ] Invariant cache hit.
[2024-05-26 11:20:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 11:20:27] [INFO ] Invariant cache hit.
[2024-05-26 11:20:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 11:20:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-26 11:20:27] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 11:20:27] [INFO ] Invariant cache hit.
[2024-05-26 11:20:27] [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 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]
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 40 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 83ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
[2024-05-26 11:20:27] [INFO ] Flatten gal took : 27 ms
[2024-05-26 11:20:27] [INFO ] Flatten gal took : 3 ms
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
[2024-05-26 11:20:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7401149186431645179.gal : 4 ms
[2024-05-26 11:20:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9877087304577362268.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7401149186431645179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9877087304577362268.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9877087304577362268.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 60
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :60 after 161
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2712 after 2875
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :11132 after 11206
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,15670,0.031693,4292,2,144,12,4149,10,0,49,4000,0
Total reachable state count : 15670

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.03218,4292,1,0,12,4149,10,0,50,4000,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.032516,4552,1,0,12,4149,10,0,50,4000,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.032637,4552,1,0,12,4149,10,0,50,4000,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.032754,4552,1,0,12,4149,10,0,50,4000,0
Probably explored full state space saw : 15670 states, properties seen :0
Probabilistic random walk after 101911 steps, saw 15670 distinct states, run finished after 408 ms. (steps per millisecond=249 ) 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 176 ms. (steps per millisecond=579 ) 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 7290 ms.

BK_STOP 1716722428637

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r246-tall-171654352300749"
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 ;