Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 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 FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678564430479

Running Version 202205111006
[2023-03-11 19:53:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 19:53:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:53:52] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2023-03-11 19:53:52] [INFO ] Transformed 12194 places.
[2023-03-11 19:53:52] [INFO ] Transformed 10560 transitions.
[2023-03-11 19:53:52] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 692 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 64 ms.
Reduce places removed 17 places and 0 transitions.
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 19:53:53] [INFO ] Computed 2768 place invariants in 697 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 16) seen :102
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :8
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 19:53:54] [INFO ] Computed 2768 place invariants in 531 ms
[2023-03-11 19:53:56] [INFO ] [Real]Absence check using 149 positive place invariants in 385 ms returned sat
[2023-03-11 19:53:58] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1573 ms returned sat
[2023-03-11 19:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:53:59] [INFO ] [Real]Absence check using state equation in 1744 ms returned unknown
[2023-03-11 19:54:01] [INFO ] [Real]Absence check using 149 positive place invariants in 302 ms returned sat
[2023-03-11 19:54:02] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1249 ms returned sat
[2023-03-11 19:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:04] [INFO ] [Real]Absence check using state equation in 2337 ms returned unknown
[2023-03-11 19:54:06] [INFO ] [Real]Absence check using 149 positive place invariants in 299 ms returned sat
[2023-03-11 19:54:07] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1157 ms returned unsat
[2023-03-11 19:54:08] [INFO ] [Real]Absence check using 149 positive place invariants in 296 ms returned sat
[2023-03-11 19:54:10] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1421 ms returned sat
[2023-03-11 19:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:12] [INFO ] [Real]Absence check using state equation in 2241 ms returned unknown
[2023-03-11 19:54:13] [INFO ] [Real]Absence check using 149 positive place invariants in 305 ms returned sat
[2023-03-11 19:54:15] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1298 ms returned sat
[2023-03-11 19:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:17] [INFO ] [Real]Absence check using state equation in 2371 ms returned unknown
[2023-03-11 19:54:18] [INFO ] [Real]Absence check using 149 positive place invariants in 305 ms returned sat
[2023-03-11 19:54:20] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1353 ms returned sat
[2023-03-11 19:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:22] [INFO ] [Real]Absence check using state equation in 2281 ms returned unknown
[2023-03-11 19:54:23] [INFO ] [Real]Absence check using 149 positive place invariants in 287 ms returned sat
[2023-03-11 19:54:24] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1136 ms returned sat
[2023-03-11 19:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:27] [INFO ] [Real]Absence check using state equation in 2517 ms returned unknown
[2023-03-11 19:54:28] [INFO ] [Real]Absence check using 149 positive place invariants in 302 ms returned sat
[2023-03-11 19:54:30] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1337 ms returned sat
[2023-03-11 19:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:32] [INFO ] [Real]Absence check using state equation in 2318 ms returned unknown
[2023-03-11 19:54:33] [INFO ] [Real]Absence check using 149 positive place invariants in 295 ms returned sat
[2023-03-11 19:54:35] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1331 ms returned sat
[2023-03-11 19:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:37] [INFO ] [Real]Absence check using state equation in 2320 ms returned unknown
[2023-03-11 19:54:38] [INFO ] [Real]Absence check using 149 positive place invariants in 333 ms returned sat
[2023-03-11 19:54:39] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 885 ms returned unsat
[2023-03-11 19:54:41] [INFO ] [Real]Absence check using 149 positive place invariants in 324 ms returned sat
[2023-03-11 19:54:42] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1489 ms returned sat
[2023-03-11 19:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:44] [INFO ] [Real]Absence check using state equation in 2095 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, 2, -1, -1, -1, -1, -1, 1, 1, 1] Max seen :[10, 10, 2, 13, 13, 37, 6, 5, 0, 1, 0]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 971 out of 12177 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11358 are kept as prefixes of interest. Removing 819 places using SCC suffix rule.30 ms
Discarding 819 places :
Also discarding 595 output transitions
Drop transitions removed 595 transitions
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Discarding 1530 places :
Implicit places reduction removed 1530 places
Drop transitions removed 3623 transitions
Trivial Post-agglo rules discarded 3623 transitions
Performed 3623 trivial Post agglomeration. Transition count delta: 3623
Iterating post reduction 0 with 5257 rules applied. Total rules applied 5258 place count 9828 transition count 6238
Reduce places removed 3623 places and 0 transitions.
Performed 459 Post agglomeration using F-continuation condition.Transition count delta: 459
Iterating post reduction 1 with 4082 rules applied. Total rules applied 9340 place count 6205 transition count 5779
Reduce places removed 459 places and 0 transitions.
Iterating post reduction 2 with 459 rules applied. Total rules applied 9799 place count 5746 transition count 5779
Performed 815 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 815 Pre rules applied. Total rules applied 9799 place count 5746 transition count 4964
Deduced a syphon composed of 815 places in 4 ms
Ensure Unique test removed 306 places
Reduce places removed 1121 places and 0 transitions.
Iterating global reduction 3 with 1936 rules applied. Total rules applied 11735 place count 4625 transition count 4964
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 11735 place count 4625 transition count 4913
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 11837 place count 4574 transition count 4913
Discarding 969 places :
Symmetric choice reduction at 3 with 969 rule applications. Total rules 12806 place count 3605 transition count 3896
Iterating global reduction 3 with 969 rules applied. Total rules applied 13775 place count 3605 transition count 3896
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 3 with 308 rules applied. Total rules applied 14083 place count 3503 transition count 3690
Reduce places removed 104 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 4 with 155 rules applied. Total rules applied 14238 place count 3399 transition count 3639
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 14289 place count 3348 transition count 3639
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 53 Pre rules applied. Total rules applied 14289 place count 3348 transition count 3586
Deduced a syphon composed of 53 places in 5 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 14395 place count 3295 transition count 3586
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 14405 place count 3285 transition count 3125
Iterating global reduction 6 with 10 rules applied. Total rules applied 14415 place count 3285 transition count 3125
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 6 with 253 rules applied. Total rules applied 14668 place count 3183 transition count 2974
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 14717 place count 3134 transition count 2974
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 53 Pre rules applied. Total rules applied 14717 place count 3134 transition count 2921
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 14823 place count 3081 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 14824 place count 3080 transition count 2918
Iterating global reduction 8 with 1 rules applied. Total rules applied 14825 place count 3080 transition count 2918
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 8 with 361 rules applied. Total rules applied 15186 place count 2874 transition count 2763
Free-agglomeration rule (complex) applied 410 times.
Iterating global reduction 8 with 410 rules applied. Total rules applied 15596 place count 2874 transition count 2353
Ensure Unique test removed 357 places
Reduce places removed 767 places and 0 transitions.
Iterating post reduction 8 with 767 rules applied. Total rules applied 16363 place count 2107 transition count 2353
Applied a total of 16363 rules in 2378 ms. Remains 2107 /12177 variables (removed 10070) and now considering 2353/10560 (removed 8207) transitions.
Finished structural reductions, in 1 iterations. Remains : 2107/12177 places, 2353/10560 transitions.
// Phase 1: matrix 2353 rows 2107 cols
[2023-03-11 19:54:47] [INFO ] Computed 111 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 1300 resets, run finished after 19641 ms. (steps per millisecond=50 ) properties (out of 9) seen :146
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 889438 steps, including 26 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=177 )
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 3420 ms. (steps per millisecond=292 ) properties (out of 7) seen :109
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 2069 ms. (steps per millisecond=483 ) properties (out of 7) seen :147
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 2071 ms. (steps per millisecond=482 ) properties (out of 7) seen :129
Finished Best-First random walk after 931152 steps, including 25 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=186 )
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties (out of 7) seen :152
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 7) seen :101
// Phase 1: matrix 2353 rows 2107 cols
[2023-03-11 19:55:28] [INFO ] Computed 111 place invariants in 16 ms
[2023-03-11 19:55:28] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 65 ms returned sat
[2023-03-11 19:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:29] [INFO ] [Real]Absence check using state equation in 433 ms returned unsat
[2023-03-11 19:55:29] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 63 ms returned sat
[2023-03-11 19:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:29] [INFO ] [Real]Absence check using state equation in 434 ms returned unsat
[2023-03-11 19:55:30] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 64 ms returned sat
[2023-03-11 19:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:30] [INFO ] [Real]Absence check using state equation in 427 ms returned unsat
[2023-03-11 19:55:30] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 62 ms returned sat
[2023-03-11 19:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:31] [INFO ] [Real]Absence check using state equation in 434 ms returned unsat
[2023-03-11 19:55:31] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 54 ms returned sat
[2023-03-11 19:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:31] [INFO ] [Real]Absence check using state equation in 203 ms returned unsat
[2023-03-11 19:55:31] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 64 ms returned sat
[2023-03-11 19:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:32] [INFO ] [Real]Absence check using state equation in 427 ms returned unsat
[2023-03-11 19:55:32] [INFO ] [Real]Absence check using 0 positive and 111 generalized place invariants in 62 ms returned sat
[2023-03-11 19:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:55:32] [INFO ] [Real]Absence check using state equation in 412 ms returned unsat
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51, 51, 51, 51] Max seen :[51, 51, 51, 51, 51, 51, 51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 101291 ms.

BK_STOP 1678564533022

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, 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 r191-tall-167838876200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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