Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460900291.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r307-tajo-171654460900291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1717132167924

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=gold2023
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 202304061127
[2024-05-31 05:09:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:09:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:09:29] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-31 05:09:29] [INFO ] Transformed 909 places.
[2024-05-31 05:09:29] [INFO ] Transformed 1970 transitions.
[2024-05-31 05:09:29] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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
[2024-05-31 05:09:30] [INFO ] Computed 142 invariants in 84 ms
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 664 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :22
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :6
[2024-05-31 05:09:30] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-31 05:09:30] [INFO ] Computed 142 invariants in 124 ms
[2024-05-31 05:09:31] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2024-05-31 05:09:31] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 43 ms returned unsat
[2024-05-31 05:09:31] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-31 05:09:31] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned sat
[2024-05-31 05:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-31 05:09:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 27 ms returned unsat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned unsat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 29 ms returned sat
[2024-05-31 05:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:33] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-31 05:09:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 38 ms returned sat
[2024-05-31 05:09:33] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2024-05-31 05:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:34] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-31 05:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:09:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 471 ms returned sat
[2024-05-31 05:09:35] [INFO ] Deduced a trap composed of 540 places in 433 ms of which 4 ms to minimize.
[2024-05-31 05:09:38] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3529 ms
[2024-05-31 05:09:38] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-05-31 05:09:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 44 ms returned sat
[2024-05-31 05:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:38] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2024-05-31 05:09:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-31 05:09:39] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 35 ms returned sat
[2024-05-31 05:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:39] [INFO ] [Nat]Absence check using state equation in 716 ms returned unsat
[2024-05-31 05:09:39] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-31 05:09:39] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 25 ms returned unsat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned unsat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-31 05:09:40] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 67 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 1, 262, 4, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 4, 1, 3, 4, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 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-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 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 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 1 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 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 339 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
[2024-05-31 05:09:41] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-31 05:09:41] [INFO ] Computed 137 invariants in 29 ms
[2024-05-31 05:09:42] [INFO ] Dead Transitions using invariants and state equation in 1250 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 : 770/909 places, 1086/1315 transitions.
Applied a total of 0 rules in 38 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1630 ms. Remains : 770/909 places, 1086/1315 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:09:42] [INFO ] Computed 137 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 52159 resets, run finished after 6249 ms. (steps per millisecond=160 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3377 resets, run finished after 1591 ms. (steps per millisecond=628 ) properties (out of 1) seen :3
[2024-05-31 05:09:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:09:50] [INFO ] Computed 137 invariants in 42 ms
[2024-05-31 05:09:50] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-31 05:09:50] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 32 ms returned sat
[2024-05-31 05:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:50] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-31 05:09:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-05-31 05:09:51] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 29 ms returned sat
[2024-05-31 05:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:51] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2024-05-31 05:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:09:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2024-05-31 05:09:52] [INFO ] Deduced a trap composed of 240 places in 381 ms of which 3 ms to minimize.
[2024-05-31 05:09:52] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 2 ms to minimize.
[2024-05-31 05:09:53] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 1 ms to minimize.
[2024-05-31 05:09:54] [INFO ] Deduced a trap composed of 252 places in 347 ms of which 1 ms to minimize.
[2024-05-31 05:09:54] [INFO ] Deduced a trap composed of 240 places in 295 ms of which 1 ms to minimize.
[2024-05-31 05:09:54] [INFO ] Deduced a trap composed of 234 places in 304 ms of which 1 ms to minimize.
[2024-05-31 05:09:55] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 1 ms to minimize.
[2024-05-31 05:09:55] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2024-05-31 05:09:55] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 1 ms to minimize.
[2024-05-31 05:09:56] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 1 ms to minimize.
[2024-05-31 05:09:56] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2024-05-31 05:09:56] [INFO ] Deduced a trap composed of 263 places in 203 ms of which 1 ms to minimize.
[2024-05-31 05:09:56] [INFO ] Deduced a trap composed of 257 places in 201 ms of which 0 ms to minimize.
[2024-05-31 05:09:57] [INFO ] Deduced a trap composed of 254 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:09:57] [INFO ] Deduced a trap composed of 227 places in 200 ms of which 0 ms to minimize.
[2024-05-31 05:09:57] [INFO ] Deduced a trap composed of 261 places in 252 ms of which 1 ms to minimize.
[2024-05-31 05:09:57] [INFO ] Deduced a trap composed of 231 places in 204 ms of which 2 ms to minimize.
[2024-05-31 05:09:58] [INFO ] Deduced a trap composed of 251 places in 216 ms of which 1 ms to minimize.
[2024-05-31 05:09:58] [INFO ] Deduced a trap composed of 257 places in 284 ms of which 1 ms to minimize.
[2024-05-31 05:09:59] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 1 ms to minimize.
[2024-05-31 05:09:59] [INFO ] Deduced a trap composed of 249 places in 198 ms of which 1 ms to minimize.
[2024-05-31 05:10:00] [INFO ] Deduced a trap composed of 251 places in 285 ms of which 1 ms to minimize.
[2024-05-31 05:10:00] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 0 ms to minimize.
[2024-05-31 05:10:01] [INFO ] Deduced a trap composed of 248 places in 316 ms of which 1 ms to minimize.
[2024-05-31 05:10:01] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 4 ms to minimize.
[2024-05-31 05:10:02] [INFO ] Deduced a trap composed of 257 places in 275 ms of which 1 ms to minimize.
[2024-05-31 05:10:02] [INFO ] Deduced a trap composed of 252 places in 215 ms of which 0 ms to minimize.
[2024-05-31 05:10:03] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 1 ms to minimize.
[2024-05-31 05:10:03] [INFO ] Deduced a trap composed of 239 places in 290 ms of which 1 ms to minimize.
[2024-05-31 05:10:05] [INFO ] Deduced a trap composed of 239 places in 284 ms of which 1 ms to minimize.
[2024-05-31 05:10:05] [INFO ] Deduced a trap composed of 243 places in 284 ms of which 1 ms to minimize.
[2024-05-31 05:10:05] [INFO ] Deduced a trap composed of 253 places in 248 ms of which 0 ms to minimize.
[2024-05-31 05:10:06] [INFO ] Deduced a trap composed of 263 places in 288 ms of which 1 ms to minimize.
[2024-05-31 05:10:09] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 17531 ms
Current structural bounds on expressions (after SMT) : [262] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 38 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 05:10:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:10:09] [INFO ] Invariant cache hit.
[2024-05-31 05:10:10] [INFO ] Implicit Places using invariants in 1375 ms returned []
[2024-05-31 05:10:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:10:10] [INFO ] Invariant cache hit.
[2024-05-31 05:10:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:10:23] [INFO ] Implicit Places using invariants and state equation in 12324 ms returned []
Implicit Place search using SMT with State Equation took 13704 ms to find 0 implicit places.
[2024-05-31 05:10:23] [INFO ] Redundant transitions in 93 ms returned []
[2024-05-31 05:10:23] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:10:23] [INFO ] Invariant cache hit.
[2024-05-31 05:10:24] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14903 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:10:24] [INFO ] Computed 137 invariants in 14 ms
Incomplete random walk after 10000 steps, including 499 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2024-05-31 05:10:24] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:10:24] [INFO ] Computed 137 invariants in 20 ms
[2024-05-31 05:10:24] [INFO ] [Real]Absence check using 111 positive place invariants in 18 ms returned sat
[2024-05-31 05:10:24] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 22 ms returned sat
[2024-05-31 05:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:10:24] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-05-31 05:10:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:10:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-31 05:10:24] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-05-31 05:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:10:25] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-05-31 05:10:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:10:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2024-05-31 05:10:25] [INFO ] Deduced a trap composed of 240 places in 316 ms of which 2 ms to minimize.
[2024-05-31 05:10:26] [INFO ] Deduced a trap composed of 230 places in 342 ms of which 0 ms to minimize.
[2024-05-31 05:10:27] [INFO ] Deduced a trap composed of 239 places in 321 ms of which 1 ms to minimize.
[2024-05-31 05:10:27] [INFO ] Deduced a trap composed of 252 places in 254 ms of which 1 ms to minimize.
[2024-05-31 05:10:28] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 1 ms to minimize.
[2024-05-31 05:10:28] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2024-05-31 05:10:29] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 1 ms to minimize.
[2024-05-31 05:10:29] [INFO ] Deduced a trap composed of 236 places in 306 ms of which 1 ms to minimize.
[2024-05-31 05:10:29] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 1 ms to minimize.
[2024-05-31 05:10:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 05:10:29] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:10:29] [INFO ] Invariant cache hit.
[2024-05-31 05:10:30] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1035 ms. Remains : 770/770 places, 1086/1086 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:10:30] [INFO ] Computed 137 invariants in 21 ms
Incomplete random walk after 1000000 steps, including 52010 resets, run finished after 6743 ms. (steps per millisecond=148 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3303 resets, run finished after 1726 ms. (steps per millisecond=579 ) properties (out of 1) seen :3
[2024-05-31 05:10:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:10:39] [INFO ] Computed 137 invariants in 38 ms
[2024-05-31 05:10:39] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-31 05:10:39] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 50 ms returned sat
[2024-05-31 05:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:10:39] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-05-31 05:10:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:10:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-31 05:10:40] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-05-31 05:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:10:40] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-31 05:10:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:10:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2024-05-31 05:10:41] [INFO ] Deduced a trap composed of 240 places in 313 ms of which 1 ms to minimize.
[2024-05-31 05:10:41] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2024-05-31 05:10:42] [INFO ] Deduced a trap composed of 239 places in 331 ms of which 1 ms to minimize.
[2024-05-31 05:10:43] [INFO ] Deduced a trap composed of 252 places in 318 ms of which 1 ms to minimize.
[2024-05-31 05:10:43] [INFO ] Deduced a trap composed of 240 places in 270 ms of which 0 ms to minimize.
[2024-05-31 05:10:43] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2024-05-31 05:10:44] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 1 ms to minimize.
[2024-05-31 05:10:44] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2024-05-31 05:10:44] [INFO ] Deduced a trap composed of 228 places in 292 ms of which 1 ms to minimize.
[2024-05-31 05:10:45] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 1 ms to minimize.
[2024-05-31 05:10:45] [INFO ] Deduced a trap composed of 227 places in 263 ms of which 1 ms to minimize.
[2024-05-31 05:10:45] [INFO ] Deduced a trap composed of 263 places in 230 ms of which 1 ms to minimize.
[2024-05-31 05:10:46] [INFO ] Deduced a trap composed of 257 places in 259 ms of which 1 ms to minimize.
[2024-05-31 05:10:46] [INFO ] Deduced a trap composed of 254 places in 226 ms of which 8 ms to minimize.
[2024-05-31 05:10:46] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2024-05-31 05:10:46] [INFO ] Deduced a trap composed of 261 places in 286 ms of which 1 ms to minimize.
[2024-05-31 05:10:47] [INFO ] Deduced a trap composed of 231 places in 274 ms of which 1 ms to minimize.
[2024-05-31 05:10:47] [INFO ] Deduced a trap composed of 251 places in 286 ms of which 1 ms to minimize.
[2024-05-31 05:10:48] [INFO ] Deduced a trap composed of 257 places in 315 ms of which 0 ms to minimize.
[2024-05-31 05:10:48] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 1 ms to minimize.
[2024-05-31 05:10:49] [INFO ] Deduced a trap composed of 249 places in 287 ms of which 1 ms to minimize.
[2024-05-31 05:10:49] [INFO ] Deduced a trap composed of 251 places in 273 ms of which 2 ms to minimize.
[2024-05-31 05:10:50] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 1 ms to minimize.
[2024-05-31 05:10:51] [INFO ] Deduced a trap composed of 248 places in 320 ms of which 2 ms to minimize.
[2024-05-31 05:10:51] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 15 ms to minimize.
[2024-05-31 05:10:52] [INFO ] Deduced a trap composed of 257 places in 275 ms of which 2 ms to minimize.
[2024-05-31 05:10:53] [INFO ] Deduced a trap composed of 252 places in 280 ms of which 0 ms to minimize.
[2024-05-31 05:10:53] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 0 ms to minimize.
[2024-05-31 05:10:54] [INFO ] Deduced a trap composed of 239 places in 305 ms of which 1 ms to minimize.
[2024-05-31 05:10:55] [INFO ] Deduced a trap composed of 239 places in 322 ms of which 1 ms to minimize.
[2024-05-31 05:10:55] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 0 ms to minimize.
[2024-05-31 05:10:56] [INFO ] Deduced a trap composed of 253 places in 287 ms of which 0 ms to minimize.
[2024-05-31 05:10:56] [INFO ] Deduced a trap composed of 263 places in 292 ms of which 0 ms to minimize.
[2024-05-31 05:10:59] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 18902 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 56 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 44 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 05:10:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:10:59] [INFO ] Invariant cache hit.
[2024-05-31 05:11:01] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2024-05-31 05:11:01] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:11:01] [INFO ] Invariant cache hit.
[2024-05-31 05:11:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:11:14] [INFO ] Implicit Places using invariants and state equation in 13012 ms returned []
Implicit Place search using SMT with State Equation took 14307 ms to find 0 implicit places.
[2024-05-31 05:11:14] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-31 05:11:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:11:14] [INFO ] Invariant cache hit.
[2024-05-31 05:11:15] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15524 ms. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06 in 51195 ms.
[2024-05-31 05:11:15] [INFO ] Flatten gal took : 149 ms
[2024-05-31 05:11:15] [INFO ] Applying decomposition
[2024-05-31 05:11:15] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11088446664093904185.txt' '-o' '/tmp/graph11088446664093904185.bin' '-w' '/tmp/graph11088446664093904185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11088446664093904185.bin' '-l' '-1' '-v' '-w' '/tmp/graph11088446664093904185.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:11:16] [INFO ] Decomposing Gal with order
[2024-05-31 05:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:11:16] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-31 05:11:16] [INFO ] Flatten gal took : 340 ms
[2024-05-31 05:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 40 ms.
[2024-05-31 05:11:16] [INFO ] Time to serialize gal into /tmp/UpperBounds8905969771124187455.gal : 33 ms
[2024-05-31 05:11:16] [INFO ] Time to serialize properties into /tmp/UpperBounds13887010340346651891.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8905969771124187455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13887010340346651891.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13887010340346651891.prop.
Detected timeout of ITS tools.
[2024-05-31 05:31:58] [INFO ] Flatten gal took : 533 ms
[2024-05-31 05:31:58] [INFO ] Time to serialize gal into /tmp/UpperBounds16723762821246895662.gal : 55 ms
[2024-05-31 05:31:58] [INFO ] Time to serialize properties into /tmp/UpperBounds10399532284191984346.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16723762821246895662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10399532284191984346.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds10399532284191984346.prop.
Detected timeout of ITS tools.
[2024-05-31 05:52:37] [INFO ] Flatten gal took : 1528 ms
[2024-05-31 05:52:39] [INFO ] Input system was already deterministic with 1086 transitions.
[2024-05-31 05:52:39] [INFO ] Transformed 770 places.
[2024-05-31 05:52:39] [INFO ] Transformed 1086 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 05:53:09] [INFO ] Time to serialize gal into /tmp/UpperBounds7332591477468995890.gal : 14 ms
[2024-05-31 05:53:09] [INFO ] Time to serialize properties into /tmp/UpperBounds6482590466063107428.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7332591477468995890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6482590466063107428.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6482590466063107428.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 136272 kB
After kill :
MemTotal: 16393356 kB
MemFree: 11853144 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r307-tajo-171654460900291"
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 ;