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.r293-tall-167873945800741.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 itstools
Input is PolyORBNT-PT-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800741
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 39K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 154K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 663K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:23 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678959300583

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 09:35:02] [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]
[2023-03-16 09:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 09:35:02] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-16 09:35:02] [INFO ] Transformed 909 places.
[2023-03-16 09:35:02] [INFO ] Transformed 1970 transitions.
[2023-03-16 09:35:02] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1311 out of 1315 initially.
// Phase 1: matrix 1311 rows 909 cols
[2023-03-16 09:35:02] [INFO ] Computed 142 place invariants in 100 ms
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 698 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10000 steps, including 247 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :18
[2023-03-16 09:35:03] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-16 09:35:03] [INFO ] Computed 142 place invariants in 65 ms
[2023-03-16 09:35:03] [INFO ] [Real]Absence check using 111 positive place invariants in 34 ms returned sat
[2023-03-16 09:35:03] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-16 09:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:03] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-16 09:35:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:35:04] [INFO ] [Nat]Absence check using 111 positive place invariants in 33 ms returned sat
[2023-03-16 09:35:04] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-16 09:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:05] [INFO ] [Nat]Absence check using state equation in 782 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 35 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 25 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 21 ms returned unsat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned sat
[2023-03-16 09:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:06] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-16 09:35:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:35:06] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-16 09:35:06] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned sat
[2023-03-16 09:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:07] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-16 09:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:35:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2023-03-16 09:35:07] [INFO ] Deduced a trap composed of 522 places in 360 ms of which 4 ms to minimize.
[2023-03-16 09:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-16 09:35:07] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 122 ms.
[2023-03-16 09:35:07] [INFO ] Added : 6 causal constraints over 2 iterations in 355 ms. Result :sat
Minimization took 211 ms.
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 26 ms returned unsat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned sat
[2023-03-16 09:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:10] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2023-03-16 09:35:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:35:10] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:10] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 35 ms returned sat
[2023-03-16 09:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:10] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-16 09:35:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2023-03-16 09:35:11] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 85 ms.
[2023-03-16 09:35:12] [INFO ] Deduced a trap composed of 525 places in 346 ms of which 2 ms to minimize.
[2023-03-16 09:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 890 ms
[2023-03-16 09:35:12] [INFO ] Added : 13 causal constraints over 3 iterations in 1833 ms. Result :sat
Minimization took 342 ms.
[2023-03-16 09:35:13] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:13] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2023-03-16 09:35:13] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:13] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2023-03-16 09:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:14] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2023-03-16 09:35:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:35:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-16 09:35:14] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned sat
[2023-03-16 09:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:35:14] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2023-03-16 09:35:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 196 ms returned sat
[2023-03-16 09:35:15] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 86 ms.
[2023-03-16 09:35:15] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2023-03-16 09:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-16 09:35:16] [INFO ] Added : 30 causal constraints over 6 iterations in 1042 ms. Result :sat
Minimization took 497 ms.
[2023-03-16 09:35:16] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-16 09:35:16] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 2, 1, 1, 3, 87, 1, 1, 3, 1, 65, 1, 1, 1] Max seen :[4, 1, 2, 1, 1, 3, 0, 1, 1, 3, 1, 0, 1, 0, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 839 transition count 1250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 135 place count 839 transition count 1185
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 263 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2023-03-16 09:35:17] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2023-03-16 09:35:17] [INFO ] Computed 137 place invariants in 31 ms
[2023-03-16 09:35:18] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 47 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1543 ms. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 09:35:18] [INFO ] Computed 137 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 52032 resets, run finished after 6777 ms. (steps per millisecond=147 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3354 resets, run finished after 1418 ms. (steps per millisecond=705 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3443 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 2) seen :2
[2023-03-16 09:35:28] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 09:35:28] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-16 09:35:28] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2023-03-16 09:35:28] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 19 ms returned unsat
[2023-03-16 09:35:28] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2023-03-16 09:35:28] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26298 ms.

BK_STOP 1678959337495

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="PolyORBNT-PT-S05J60"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J60, 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 r293-tall-167873945800741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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