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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 23K Apr 12 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 12 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 12 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 512K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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.2M 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-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717130753067

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-S05J30
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 04:45:54] [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:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:45:54] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-31 04:45:54] [INFO ] Transformed 489 places.
[2024-05-31 04:45:54] [INFO ] Transformed 1400 transitions.
[2024-05-31 04:45:54] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 741 out of 745 initially.
// Phase 1: matrix 741 rows 489 cols
[2024-05-31 04:45:54] [INFO ] Computed 82 invariants in 78 ms
Incomplete random walk after 10000 steps, including 681 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 16) seen :22
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 253 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 150 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :22
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10000 steps, including 249 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :19
[2024-05-31 04:45:55] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-31 04:45:55] [INFO ] Computed 82 invariants in 25 ms
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned sat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 19 ms returned unsat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned unsat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 12 ms returned unsat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2024-05-31 04:45:55] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 12 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 75 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 17 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 27 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 12 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 30 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 4 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 17 ms returned unsat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-31 04:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:45:57] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-05-31 04:45:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:45:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2024-05-31 04:45:57] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 04:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:45:57] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-05-31 04:45:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:45:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:45:57] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 89 ms.
[2024-05-31 04:45:58] [INFO ] Added : 6 causal constraints over 2 iterations in 273 ms. Result :sat
Minimization took 101 ms.
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 21 ms returned unsat
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 19 ms returned unsat
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-31 04:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:45:58] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-31 04:45:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:45:59] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2024-05-31 04:45:59] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-31 04:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:45:59] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2024-05-31 04:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2024-05-31 04:45:59] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 61 ms.
[2024-05-31 04:46:00] [INFO ] Deduced a trap composed of 301 places in 258 ms of which 5 ms to minimize.
[2024-05-31 04:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2024-05-31 04:46:00] [INFO ] Added : 20 causal constraints over 4 iterations in 1043 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 106, 1, 1, 320] Max seen :[4, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 0, 1, 1, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 484 transition count 710
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 76 place count 449 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 251 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2024-05-31 04:46:01] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2024-05-31 04:46:01] [INFO ] Computed 77 invariants in 25 ms
[2024-05-31 04:46:02] [INFO ] Dead Transitions using invariants and state equation in 848 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 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1129 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:02] [INFO ] Computed 77 invariants in 39 ms
Incomplete random walk after 1000000 steps, including 47330 resets, run finished after 3768 ms. (steps per millisecond=265 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5383 resets, run finished after 1408 ms. (steps per millisecond=710 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5500 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 2) seen :4
[2024-05-31 04:46:08] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:08] [INFO ] Computed 77 invariants in 9 ms
[2024-05-31 04:46:08] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2024-05-31 04:46:08] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 10 ms returned unsat
[2024-05-31 04:46:08] [INFO ] [Real]Absence check using 59 positive place invariants in 12 ms returned sat
[2024-05-31 04:46:08] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 15 ms returned sat
[2024-05-31 04:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:08] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-31 04:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:46:08] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2024-05-31 04:46:08] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2024-05-31 04:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:09] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-05-31 04:46:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:46:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 134 ms returned sat
[2024-05-31 04:46:09] [INFO ] Deduced a trap composed of 145 places in 172 ms of which 1 ms to minimize.
[2024-05-31 04:46:09] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 2 ms to minimize.
[2024-05-31 04:46:09] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 2 ms to minimize.
[2024-05-31 04:46:10] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 1 ms to minimize.
[2024-05-31 04:46:10] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 1 ms to minimize.
[2024-05-31 04:46:10] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 0 ms to minimize.
[2024-05-31 04:46:10] [INFO ] Deduced a trap composed of 131 places in 208 ms of which 1 ms to minimize.
[2024-05-31 04:46:11] [INFO ] Deduced a trap composed of 131 places in 234 ms of which 1 ms to minimize.
[2024-05-31 04:46:11] [INFO ] Deduced a trap composed of 122 places in 208 ms of which 1 ms to minimize.
[2024-05-31 04:46:11] [INFO ] Deduced a trap composed of 128 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:46:11] [INFO ] Deduced a trap composed of 122 places in 199 ms of which 1 ms to minimize.
[2024-05-31 04:46:12] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 1 ms to minimize.
[2024-05-31 04:46:12] [INFO ] Deduced a trap composed of 129 places in 237 ms of which 0 ms to minimize.
[2024-05-31 04:46:12] [INFO ] Deduced a trap composed of 126 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:46:13] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 1 ms to minimize.
[2024-05-31 04:46:13] [INFO ] Deduced a trap composed of 144 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:46:13] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 1 ms to minimize.
[2024-05-31 04:46:20] [INFO ] Deduced a trap composed of 131 places in 6956 ms of which 27 ms to minimize.
[2024-05-31 04:46:21] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:46:22] [INFO ] Deduced a trap composed of 119 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:46:22] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:46:23] [INFO ] Deduced a trap composed of 128 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:46:23] [INFO ] Deduced a trap composed of 123 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:46:26] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 17048 ms
Current structural bounds on expressions (after SMT) : [1, 320] Max seen :[1, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 49 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:26] [INFO ] Computed 77 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47145 resets, run finished after 4073 ms. (steps per millisecond=245 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5375 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 1) seen :3
[2024-05-31 04:46:31] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:31] [INFO ] Computed 77 invariants in 17 ms
[2024-05-31 04:46:31] [INFO ] [Real]Absence check using 59 positive place invariants in 13 ms returned sat
[2024-05-31 04:46:31] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 15 ms returned sat
[2024-05-31 04:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:31] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-31 04:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:46:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 13 ms returned sat
[2024-05-31 04:46:32] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2024-05-31 04:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:32] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-31 04:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:46:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 182 ms returned sat
[2024-05-31 04:46:32] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 1 ms to minimize.
[2024-05-31 04:46:32] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 3 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 1 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 1 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 0 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 0 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 1 ms to minimize.
[2024-05-31 04:46:33] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2024-05-31 04:46:34] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2024-05-31 04:46:34] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 2 ms to minimize.
[2024-05-31 04:46:34] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 3 ms to minimize.
[2024-05-31 04:46:34] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2024-05-31 04:46:35] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 1 ms to minimize.
[2024-05-31 04:46:35] [INFO ] Deduced a trap composed of 126 places in 195 ms of which 1 ms to minimize.
[2024-05-31 04:46:35] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 1 ms to minimize.
[2024-05-31 04:46:35] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 0 ms to minimize.
[2024-05-31 04:46:35] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 0 ms to minimize.
[2024-05-31 04:46:36] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 2 ms to minimize.
[2024-05-31 04:46:36] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 2 ms to minimize.
[2024-05-31 04:46:37] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 0 ms to minimize.
[2024-05-31 04:46:37] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 0 ms to minimize.
[2024-05-31 04:46:38] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 1 ms to minimize.
[2024-05-31 04:46:38] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 1 ms to minimize.
[2024-05-31 04:46:41] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 8799 ms
Current structural bounds on expressions (after SMT) : [320] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 04:46:41] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:46:41] [INFO ] Invariant cache hit.
[2024-05-31 04:46:41] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-31 04:46:41] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:46:41] [INFO ] Invariant cache hit.
[2024-05-31 04:46:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:46:45] [INFO ] Implicit Places using invariants and state equation in 3251 ms returned []
Implicit Place search using SMT with State Equation took 3818 ms to find 0 implicit places.
[2024-05-31 04:46:45] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-31 04:46:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:46:45] [INFO ] Invariant cache hit.
[2024-05-31 04:46:45] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4377 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-15
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:45] [INFO ] Computed 77 invariants in 8 ms
Incomplete random walk after 10000 steps, including 489 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2024-05-31 04:46:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:45] [INFO ] Computed 77 invariants in 6 ms
[2024-05-31 04:46:45] [INFO ] [Real]Absence check using 59 positive place invariants in 21 ms returned sat
[2024-05-31 04:46:45] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 23 ms returned sat
[2024-05-31 04:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:46] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-31 04:46:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:46:46] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2024-05-31 04:46:46] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2024-05-31 04:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:46] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-31 04:46:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:46:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 183 ms returned sat
[2024-05-31 04:46:46] [INFO ] Deduced a trap composed of 145 places in 279 ms of which 0 ms to minimize.
[2024-05-31 04:46:47] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:46:47] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 1 ms to minimize.
[2024-05-31 04:46:47] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 13 ms to minimize.
[2024-05-31 04:46:47] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 1 ms to minimize.
[2024-05-31 04:46:47] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 1 ms to minimize.
[2024-05-31 04:46:48] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 1 ms to minimize.
[2024-05-31 04:46:48] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:46:48] [INFO ] Deduced a trap composed of 122 places in 188 ms of which 20 ms to minimize.
[2024-05-31 04:46:48] [INFO ] Deduced a trap composed of 128 places in 180 ms of which 1 ms to minimize.
[2024-05-31 04:46:49] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 0 ms to minimize.
[2024-05-31 04:46:49] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2024-05-31 04:46:49] [INFO ] Deduced a trap composed of 129 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:46:50] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 1 ms to minimize.
[2024-05-31 04:46:50] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 0 ms to minimize.
[2024-05-31 04:46:50] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 0 ms to minimize.
[2024-05-31 04:46:50] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 0 ms to minimize.
[2024-05-31 04:46:51] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 0 ms to minimize.
[2024-05-31 04:46:51] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 4500 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 04:46:51] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:46:51] [INFO ] Invariant cache hit.
[2024-05-31 04:46:51] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:51] [INFO ] Computed 77 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47232 resets, run finished after 3550 ms. (steps per millisecond=281 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5471 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 1) seen :3
[2024-05-31 04:46:56] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 04:46:56] [INFO ] Computed 77 invariants in 18 ms
[2024-05-31 04:46:56] [INFO ] [Real]Absence check using 59 positive place invariants in 15 ms returned sat
[2024-05-31 04:46:56] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2024-05-31 04:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:56] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-05-31 04:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:46:56] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2024-05-31 04:46:56] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2024-05-31 04:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:46:57] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-05-31 04:46:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:46:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 187 ms returned sat
[2024-05-31 04:46:57] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 1 ms to minimize.
[2024-05-31 04:46:57] [INFO ] Deduced a trap composed of 119 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:46:58] [INFO ] Deduced a trap composed of 132 places in 275 ms of which 2 ms to minimize.
[2024-05-31 04:46:58] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:46:58] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:46:58] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 0 ms to minimize.
[2024-05-31 04:46:59] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 0 ms to minimize.
[2024-05-31 04:46:59] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 0 ms to minimize.
[2024-05-31 04:46:59] [INFO ] Deduced a trap composed of 122 places in 197 ms of which 1 ms to minimize.
[2024-05-31 04:46:59] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:46:59] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 1 ms to minimize.
[2024-05-31 04:47:00] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 1 ms to minimize.
[2024-05-31 04:47:00] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 1 ms to minimize.
[2024-05-31 04:47:00] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 1 ms to minimize.
[2024-05-31 04:47:00] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 2 ms to minimize.
[2024-05-31 04:47:01] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 1 ms to minimize.
[2024-05-31 04:47:01] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:47:01] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2024-05-31 04:47:02] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2024-05-31 04:47:02] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 1 ms to minimize.
[2024-05-31 04:47:02] [INFO ] Deduced a trap composed of 150 places in 196 ms of which 0 ms to minimize.
[2024-05-31 04:47:03] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2024-05-31 04:47:03] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 0 ms to minimize.
[2024-05-31 04:47:06] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 9254 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 31 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 04:47:06] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:47:06] [INFO ] Invariant cache hit.
[2024-05-31 04:47:07] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-31 04:47:07] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:47:07] [INFO ] Invariant cache hit.
[2024-05-31 04:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:47:12] [INFO ] Implicit Places using invariants and state equation in 4796 ms returned []
Implicit Place search using SMT with State Equation took 5535 ms to find 0 implicit places.
[2024-05-31 04:47:12] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-31 04:47:12] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 04:47:12] [INFO ] Invariant cache hit.
[2024-05-31 04:47:12] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6049 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-15 in 26936 ms.
[2024-05-31 04:47:12] [INFO ] Flatten gal took : 113 ms
[2024-05-31 04:47:12] [INFO ] Applying decomposition
[2024-05-31 04:47:13] [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/graph109783101149817842.txt' '-o' '/tmp/graph109783101149817842.bin' '-w' '/tmp/graph109783101149817842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph109783101149817842.bin' '-l' '-1' '-v' '-w' '/tmp/graph109783101149817842.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:47:13] [INFO ] Decomposing Gal with order
[2024-05-31 04:47:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:47:13] [INFO ] Removed a total of 541 redundant transitions.
[2024-05-31 04:47:13] [INFO ] Flatten gal took : 134 ms
[2024-05-31 04:47:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 17 ms.
[2024-05-31 04:47:13] [INFO ] Time to serialize gal into /tmp/UpperBounds10488770889879688992.gal : 12 ms
[2024-05-31 04:47:13] [INFO ] Time to serialize properties into /tmp/UpperBounds18181610848041888096.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/UpperBounds10488770889879688992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18181610848041888096.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/UpperBounds18181610848041888096.prop.
Detected timeout of ITS tools.
[2024-05-31 05:07:44] [INFO ] Flatten gal took : 608 ms
[2024-05-31 05:07:44] [INFO ] Time to serialize gal into /tmp/UpperBounds11879762814436086616.gal : 154 ms
[2024-05-31 05:07:45] [INFO ] Time to serialize properties into /tmp/UpperBounds9265008628882046825.prop : 7 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/UpperBounds11879762814436086616.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9265008628882046825.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/UpperBounds9265008628882046825.prop.
Detected timeout of ITS tools.
[2024-05-31 05:28:13] [INFO ] Flatten gal took : 438 ms
[2024-05-31 05:28:15] [INFO ] Input system was already deterministic with 577 transitions.
[2024-05-31 05:28:16] [INFO ] Transformed 411 places.
[2024-05-31 05:28:16] [INFO ] Transformed 577 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:28:46] [INFO ] Time to serialize gal into /tmp/UpperBounds16792766612758905702.gal : 22 ms
[2024-05-31 05:28:46] [INFO ] Time to serialize properties into /tmp/UpperBounds8292335319297198288.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/UpperBounds16792766612758905702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8292335319297198288.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8292335319297198288.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 152164 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16159376 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-S05J30"
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-S05J30, 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-171654460800281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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