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-171654460800276.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-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 17K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 12 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 12 09:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 09:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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.6M 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-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717130012327

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-S05J20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 04:33:34] [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 04:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:33:34] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-31 04:33:34] [INFO ] Transformed 349 places.
[2024-05-31 04:33:34] [INFO ] Transformed 1210 transitions.
[2024-05-31 04:33:34] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 551 out of 555 initially.
// Phase 1: matrix 551 rows 349 cols
[2024-05-31 04:33:34] [INFO ] Computed 62 invariants in 44 ms
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 679 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :22
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10000 steps, including 151 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :20
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10001 steps, including 172 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 179 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :9
[2024-05-31 04:33:35] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2024-05-31 04:33:35] [INFO ] Computed 62 invariants in 12 ms
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 20 ms returned unsat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-31 04:33:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 17 ms returned unsat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 15 ms returned unsat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 3 ms returned unsat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 14 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:36] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-05-31 04:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:33:36] [INFO ] [Nat]Absence check using 42 positive place invariants in 20 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 29 ms returned sat
[2024-05-31 04:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:37] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2024-05-31 04:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:33:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 346 ms returned sat
[2024-05-31 04:33:37] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 101 ms.
[2024-05-31 04:33:38] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 4 ms to minimize.
[2024-05-31 04:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2024-05-31 04:33:38] [INFO ] Added : 19 causal constraints over 4 iterations in 978 ms. Result :sat
Minimization took 187 ms.
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned unsat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2024-05-31 04:33:39] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 1, 1, 1, 5, 1, 1, 128, 1, 2, 1, 1] Max seen :[1, 3, 1, 1, 1, 5, 1, 1, 3, 1, 2, 1, 1]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
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 113 place count 290 transition count 501
Applied a total of 113 rules in 146 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2024-05-31 04:33:39] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2024-05-31 04:33:39] [INFO ] Computed 57 invariants in 10 ms
[2024-05-31 04:33:40] [INFO ] Dead Transitions using invariants and state equation in 388 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 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 24 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562 ms. Remains : 290/349 places, 406/555 transitions.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:33:40] [INFO ] Computed 57 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 52100 resets, run finished after 3099 ms. (steps per millisecond=322 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7151 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :3
[2024-05-31 04:33:44] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:33:44] [INFO ] Computed 57 invariants in 17 ms
[2024-05-31 04:33:44] [INFO ] [Real]Absence check using 43 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:44] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-31 04:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:44] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2024-05-31 04:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:33:44] [INFO ] [Nat]Absence check using 43 positive place invariants in 12 ms returned sat
[2024-05-31 04:33:44] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 34 ms returned sat
[2024-05-31 04:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:44] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 04:33:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:33:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 447 ms returned sat
[2024-05-31 04:33:45] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 1 ms to minimize.
[2024-05-31 04:33:45] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2024-05-31 04:33:45] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 1 ms to minimize.
[2024-05-31 04:33:45] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2024-05-31 04:33:45] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 0 ms to minimize.
[2024-05-31 04:33:46] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 1 ms to minimize.
[2024-05-31 04:33:46] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 1 ms to minimize.
[2024-05-31 04:33:46] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 1 ms to minimize.
[2024-05-31 04:33:46] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:33:49] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 4538 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 04:33:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:33:49] [INFO ] Invariant cache hit.
[2024-05-31 04:33:50] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 04:33:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:33:50] [INFO ] Invariant cache hit.
[2024-05-31 04:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:33:51] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2024-05-31 04:33:51] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-31 04:33:51] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:33:51] [INFO ] Invariant cache hit.
[2024-05-31 04:33:52] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2281 ms. Remains : 290/290 places, 406/406 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-10
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:33:52] [INFO ] Computed 57 invariants in 7 ms
Incomplete random walk after 10000 steps, including 505 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
[2024-05-31 04:33:52] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:33:52] [INFO ] Computed 57 invariants in 10 ms
[2024-05-31 04:33:52] [INFO ] [Real]Absence check using 43 positive place invariants in 13 ms returned sat
[2024-05-31 04:33:52] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-31 04:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:52] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-05-31 04:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:33:52] [INFO ] [Nat]Absence check using 43 positive place invariants in 10 ms returned sat
[2024-05-31 04:33:52] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 30 ms returned sat
[2024-05-31 04:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:33:52] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-31 04:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:33:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 474 ms returned sat
[2024-05-31 04:33:53] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 0 ms to minimize.
[2024-05-31 04:33:53] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 1 ms to minimize.
[2024-05-31 04:33:53] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 0 ms to minimize.
[2024-05-31 04:33:53] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2024-05-31 04:33:54] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 1 ms to minimize.
[2024-05-31 04:33:54] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 1 ms to minimize.
[2024-05-31 04:33:54] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 0 ms to minimize.
[2024-05-31 04:33:54] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 1 ms to minimize.
[2024-05-31 04:33:54] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 1 ms to minimize.
[2024-05-31 04:33:57] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 4308 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 24 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 04:33:57] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:33:57] [INFO ] Invariant cache hit.
[2024-05-31 04:33:57] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 290/290 places, 406/406 transitions.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:33:57] [INFO ] Computed 57 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 52064 resets, run finished after 3302 ms. (steps per millisecond=302 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 7139 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 1) seen :3
[2024-05-31 04:34:02] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 04:34:02] [INFO ] Computed 57 invariants in 10 ms
[2024-05-31 04:34:02] [INFO ] [Real]Absence check using 43 positive place invariants in 12 ms returned sat
[2024-05-31 04:34:02] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-31 04:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:34:02] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2024-05-31 04:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:34:02] [INFO ] [Nat]Absence check using 43 positive place invariants in 12 ms returned sat
[2024-05-31 04:34:02] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 34 ms returned sat
[2024-05-31 04:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:34:02] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-31 04:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:34:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 301 ms returned sat
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 1 ms to minimize.
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 0 ms to minimize.
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 0 ms to minimize.
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2024-05-31 04:34:03] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 1 ms to minimize.
[2024-05-31 04:34:04] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 1 ms to minimize.
[2024-05-31 04:34:04] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2024-05-31 04:34:04] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 1 ms to minimize.
[2024-05-31 04:34:07] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2024-05-31 04:34:07] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2024-05-31 04:34:07] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2024-05-31 04:34:08] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 1 ms to minimize.
[2024-05-31 04:34:08] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2024-05-31 04:34:08] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 1 ms to minimize.
[2024-05-31 04:34:08] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 8 ms to minimize.
[2024-05-31 04:34:09] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 0 ms to minimize.
[2024-05-31 04:34:09] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 1 ms to minimize.
[2024-05-31 04:34:09] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:34:10] [INFO ] Deduced a trap composed of 104 places in 193 ms of which 0 ms to minimize.
[2024-05-31 04:34:10] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 0 ms to minimize.
[2024-05-31 04:34:11] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 1 ms to minimize.
[2024-05-31 04:34:11] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 0 ms to minimize.
[2024-05-31 04:34:11] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 1 ms to minimize.
[2024-05-31 04:34:11] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 1 ms to minimize.
[2024-05-31 04:34:12] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:34:12] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:34:13] [INFO ] Deduced a trap composed of 94 places in 225 ms of which 1 ms to minimize.
[2024-05-31 04:34:13] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2024-05-31 04:34:13] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 1 ms to minimize.
[2024-05-31 04:34:14] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 0 ms to minimize.
[2024-05-31 04:34:14] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-05-31 04:34:14] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 1 ms to minimize.
[2024-05-31 04:34:14] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 1 ms to minimize.
[2024-05-31 04:34:15] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 1 ms to minimize.
[2024-05-31 04:34:15] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 0 ms to minimize.
[2024-05-31 04:34:16] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 1 ms to minimize.
[2024-05-31 04:34:18] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 44 ms to minimize.
[2024-05-31 04:34:20] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:34:22] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 1 ms to minimize.
[2024-05-31 04:34:23] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 1 ms to minimize.
[2024-05-31 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 23806 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 21 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 19 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 04:34:26] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:34:26] [INFO ] Invariant cache hit.
[2024-05-31 04:34:27] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-31 04:34:27] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:34:27] [INFO ] Invariant cache hit.
[2024-05-31 04:34:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:34:28] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-31 04:34:28] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 04:34:28] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 04:34:28] [INFO ] Invariant cache hit.
[2024-05-31 04:34:29] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2351 ms. Remains : 290/290 places, 406/406 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-10 in 37263 ms.
[2024-05-31 04:34:29] [INFO ] Flatten gal took : 104 ms
[2024-05-31 04:34:29] [INFO ] Applying decomposition
[2024-05-31 04:34:29] [INFO ] Flatten gal took : 44 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/graph12355527911914112916.txt' '-o' '/tmp/graph12355527911914112916.bin' '-w' '/tmp/graph12355527911914112916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12355527911914112916.bin' '-l' '-1' '-v' '-w' '/tmp/graph12355527911914112916.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:34:29] [INFO ] Decomposing Gal with order
[2024-05-31 04:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:34:30] [INFO ] Removed a total of 517 redundant transitions.
[2024-05-31 04:34:30] [INFO ] Flatten gal took : 109 ms
[2024-05-31 04:34:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 17 ms.
[2024-05-31 04:34:30] [INFO ] Time to serialize gal into /tmp/UpperBounds13172302310858172996.gal : 9 ms
[2024-05-31 04:34:30] [INFO ] Time to serialize properties into /tmp/UpperBounds11772047266506926908.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/UpperBounds13172302310858172996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11772047266506926908.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 ...285
Loading property file /tmp/UpperBounds11772047266506926908.prop.
Detected timeout of ITS tools.
[2024-05-31 04:54:48] [INFO ] Flatten gal took : 54 ms
[2024-05-31 04:54:48] [INFO ] Time to serialize gal into /tmp/UpperBounds16459990317025216340.gal : 16 ms
[2024-05-31 04:54:48] [INFO ] Time to serialize properties into /tmp/UpperBounds7839733715094989012.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/UpperBounds16459990317025216340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7839733715094989012.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 ...305
Loading property file /tmp/UpperBounds7839733715094989012.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.27496e+08,911.294,13218076,2,6.99598e+06,5,4.49633e+07,6,0,1585,1.00981e+07,0
Total reachable state count : 327495725

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-PT-S05J20-UpperBounds-10 :0 <= place_523_1 <= 3
FORMULA PolyORBNT-PT-S05J20-UpperBounds-10 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-PT-S05J20-UpperBounds-10,0,915.701,13218076,1,0,7,4.49633e+07,9,1,2162,1.00981e+07,4
Total runtime 2193900 ms.

BK_STOP 1717132208491

--------------------
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-S05J20"
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-S05J20, 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-171654460800276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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