Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 40K Apr 30 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 30 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 30 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 30 03:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 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 PolyORBNT-PT-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652972660768

Running Version 202205111006
[2022-05-19 15:04:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 15:04:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:04:22] [INFO ] Load time of PNML (sax parser for PT used): 692 ms
[2022-05-19 15:04:22] [INFO ] Transformed 664 places.
[2022-05-19 15:04:22] [INFO ] Transformed 12050 transitions.
[2022-05-19 15:04:22] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 898 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2022-05-19 15:04:23] [INFO ] Computed 92 place invariants in 132 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 31 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :9
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :4
[2022-05-19 15:04:23] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2022-05-19 15:04:23] [INFO ] Computed 92 place invariants in 91 ms
[2022-05-19 15:04:24] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2022-05-19 15:04:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 15 ms returned unsat
[2022-05-19 15:04:24] [INFO ] [Real]Absence check using 63 positive place invariants in 20 ms returned sat
[2022-05-19 15:04:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-19 15:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:25] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2022-05-19 15:04:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 114 ms returned sat
[2022-05-19 15:04:25] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2022-05-19 15:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:27] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2022-05-19 15:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 15:04:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2022-05-19 15:04:28] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 237 ms.
[2022-05-19 15:04:28] [INFO ] Added : 6 causal constraints over 2 iterations in 578 ms. Result :sat
Minimization took 529 ms.
[2022-05-19 15:04:29] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2022-05-19 15:04:29] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-19 15:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:29] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2022-05-19 15:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2022-05-19 15:04:30] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-19 15:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:33] [INFO ] [Nat]Absence check using state equation in 3434 ms returned sat
[2022-05-19 15:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-19 15:04:33] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 154 ms.
[2022-05-19 15:04:34] [INFO ] Added : 30 causal constraints over 6 iterations in 751 ms. Result :sat
Minimization took 610 ms.
[2022-05-19 15:04:35] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:35] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 13 ms returned unsat
[2022-05-19 15:04:35] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2022-05-19 15:04:35] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2022-05-19 15:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:35] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2022-05-19 15:04:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2022-05-19 15:04:36] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned sat
[2022-05-19 15:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:37] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2022-05-19 15:04:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 167 ms returned sat
[2022-05-19 15:04:37] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 127 ms.
[2022-05-19 15:04:38] [INFO ] Added : 13 causal constraints over 3 iterations in 487 ms. Result :sat
Minimization took 444 ms.
[2022-05-19 15:04:38] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:38] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned unsat
[2022-05-19 15:04:38] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2022-05-19 15:04:38] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2022-05-19 15:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:39] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2022-05-19 15:04:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:39] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:39] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2022-05-19 15:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:40] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2022-05-19 15:04:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 15:04:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 3746 ms returned unknown
[2022-05-19 15:04:44] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2022-05-19 15:04:44] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2022-05-19 15:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:45] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2022-05-19 15:04:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:45] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:45] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-19 15:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:46] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2022-05-19 15:04:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 934 ms returned sat
[2022-05-19 15:04:47] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 132 ms.
[2022-05-19 15:04:50] [INFO ] Added : 10 causal constraints over 2 iterations in 3309 ms. Result :unknown
[2022-05-19 15:04:50] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2022-05-19 15:04:50] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-19 15:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:51] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2022-05-19 15:04:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:51] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:51] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 31 ms returned sat
[2022-05-19 15:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:54] [INFO ] [Nat]Absence check using state equation in 2725 ms returned sat
[2022-05-19 15:04:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 984 ms returned sat
[2022-05-19 15:04:55] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 141 ms.
[2022-05-19 15:04:55] [INFO ] Added : 11 causal constraints over 3 iterations in 502 ms. Result :sat
Minimization took 328 ms.
[2022-05-19 15:04:56] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:04:56] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2022-05-19 15:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:56] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2022-05-19 15:04:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:04:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2022-05-19 15:04:57] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2022-05-19 15:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:00] [INFO ] [Nat]Absence check using state equation in 3383 ms returned sat
[2022-05-19 15:05:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-19 15:05:00] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 144 ms.
[2022-05-19 15:05:01] [INFO ] Added : 28 causal constraints over 6 iterations in 727 ms. Result :sat
Minimization took 688 ms.
[2022-05-19 15:05:02] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2022-05-19 15:05:02] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 114, 151, 1, 75, 1, 226, 1, 1, 151, 1] Max seen :[1, 3, 0, 1, 0, 1, 0, 0, 0, 0, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 35 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 80 place count 619 transition count 1870
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 582 transition count 1868
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 582 transition count 1867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 447 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2022-05-19 15:05:02] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2022-05-19 15:05:02] [INFO ] Computed 82 place invariants in 87 ms
[2022-05-19 15:05:03] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 581/664 places, 1252/1940 transitions.
Applied a total of 0 rules in 35 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/664 places, 1252/1940 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:05:03] [INFO ] Computed 82 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 72201 resets, run finished after 7847 ms. (steps per millisecond=127 ) properties (out of 6) seen :13
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8014 resets, run finished after 2087 ms. (steps per millisecond=479 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8959 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8841 resets, run finished after 1601 ms. (steps per millisecond=624 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8825 resets, run finished after 1616 ms. (steps per millisecond=618 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8829 resets, run finished after 1612 ms. (steps per millisecond=620 ) properties (out of 5) seen :12
[2022-05-19 15:05:20] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 15:05:20] [INFO ] Computed 82 place invariants in 30 ms
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 3 ms returned unsat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 3 ms returned unsat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 3 ms returned unsat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 4 ms returned unsat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 15:05:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 2, 1, 3, 2] Max seen :[4, 2, 1, 3, 2]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 58689 ms.

BK_STOP 1652972720684

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBNT-PT-S10J30"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J30, 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 r168-tall-165277017300861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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