Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856500885.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is GPPP-PT-C1000N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500885
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 10:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678658742037

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 22:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:05:43] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-12 22:05:43] [INFO ] Transformed 33 places.
[2023-03-12 22:05:43] [INFO ] Transformed 22 transitions.
[2023-03-12 22:05:43] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:43] [INFO ] Invariants computation overflowed in 11 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :9137
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :7085
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :9081
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :9050
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :9088
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :9119
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :7048
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :9113
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :9085
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :9106
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :9115
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :9089
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :9115
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :9094
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :9133
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :9093
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :9094
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:43] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-12 22:05:44] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 22:05:44] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-12 22:05:44] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 22:05:44] [INFO ] Added : 14 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 23 ms.
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned unsat
[2023-03-12 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2023-03-12 22:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 22:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned unsat
[2023-03-12 22:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-12 22:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 22:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-12 22:05:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 22:05:45] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 36 ms.
[2023-03-12 22:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 22:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 22:05:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 22:05:45] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3000, 2000, -1, -1, 7, 4000, 7, 1, 7, 1, 3, 7, 3, 20, -1, -1] Max seen :[3000, 2000, 40, 4, 7, 4000, 7, 1, 7, 1, 3, 7, 3, 20, 40, 6]
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-05 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-00 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 19 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 26/33 places, 17/22 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:45] [INFO ] Invariants computation overflowed in 2 ms
Incomplete random walk after 1000000 steps, including 5115 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 4) seen :90
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=2816 ) properties (out of 4) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 4) seen :64
Incomplete Best-First random walk after 1000000 steps, including 3039 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 4) seen :82
Incomplete Best-First random walk after 1000001 steps, including 1002 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 4) seen :75
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:47] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 22:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned unsat
[2023-03-12 22:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 22:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2023-03-12 22:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 22:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
[2023-03-12 22:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 22:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [47, 7, 47, 7] Max seen :[47, 7, 47, 7]
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-14 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-02 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4386 ms.
ITS solved all properties within timeout

BK_STOP 1678658748739

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000000010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is GPPP-PT-C1000N0000000010, 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 r169-tall-167838856500885"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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