Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r107-smll-165260580300070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is GPPP-PT-C0001N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580300070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 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 GPPP-PT-C0001N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652645993241

Running Version 0
[2022-05-15 20:19:56] [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]
[2022-05-15 20:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:19:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2022-05-15 20:19:56] [INFO ] Transformed 33 places.
[2022-05-15 20:19:56] [INFO ] Transformed 22 transitions.
[2022-05-15 20:19:56] [INFO ] Parsed PT model containing 33 places and 22 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:19:56] [INFO ] Computed 13 place invariants in 19 ms
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :55
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :63
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :33
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 :61
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :62
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :128
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :58
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:19:56] [INFO ] Computed 13 place invariants in 8 ms
[2022-05-15 20:19:56] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-15 20:19:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-15 20:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:56] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-15 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-15 20:19:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 20:19:57] [INFO ] Added : 19 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 42 ms.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 20:19:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 20:19:57] [INFO ] Added : 19 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 59 ms.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-15 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-15 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-15 20:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-15 20:19:58] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 20:19:58] [INFO ] Added : 20 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 253 ms.
[2022-05-15 20:19:58] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-15 20:19:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-15 20:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:19:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 20:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:19:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:19:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 7, 2000, 7, 4, 7, 7, 2000, 14] Max seen :[1, 1, 1, 7, 48, 7, 4, 7, 7, 84, 14]
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-15 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 3445800 steps, including 102 resets, run finished after 4399 ms. (steps per millisecond=783 ) properties (out of 3) seen :4001 could not realise parikh vector
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 2232100 steps, including 102 resets, run finished after 3010 ms. (steps per millisecond=741 ) properties (out of 1) seen :1 could not realise parikh vector
Incomplete Parikh walk after 14500 steps, including 126 resets, run finished after 28 ms. (steps per millisecond=517 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 42 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:20:05] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 20:20:05] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:20:05] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 1) seen :1
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:20:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 20:20:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:20:07] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 20:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:20:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 20:20:07] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:07] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-15 20:20:07] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 20:20:07] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Incomplete Parikh walk after 10500 steps, including 132 resets, run finished after 20 ms. (steps per millisecond=525 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:20:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 20:20:08] [INFO ] Implicit Places using invariants in 118 ms returned [0, 1, 2, 3, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
[2022-05-15 20:20:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-15 20:20:08] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 20:20:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 19/24 places, 14/14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 16 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 14 transition count 9
Applied a total of 10 rules in 9 ms. Remains 14 /19 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:08] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 20:20:08] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:08] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 20:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/24 places, 9/14 transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:08] [INFO ] Computed 6 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 20:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 20:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-15 20:20:09] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 20:20:09] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Incomplete Parikh walk after 7700 steps, including 112 resets, run finished after 7 ms. (steps per millisecond=1100 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:09] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-15 20:20:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting property specific reduction for GPPP-PT-C0001N0000001000-UpperBounds-02
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 20:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-15 20:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 20:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-15 20:20:09] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 20:20:09] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Incomplete Parikh walk after 7700 steps, including 112 resets, run finished after 7 ms. (steps per millisecond=1100 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:09] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 20:20:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 20:20:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-15 20:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-15 20:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:20:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-15 20:20:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-15 20:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:20:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-15 20:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-15 20:20:10] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 20:20:10] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Incomplete Parikh walk after 7700 steps, including 112 resets, run finished after 7 ms. (steps per millisecond=1100 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:10] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:10] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-15 20:20:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2022-05-15 20:20:10] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 20:20:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Ending property specific reduction for GPPP-PT-C0001N0000001000-UpperBounds-02 in 1179 ms.
[2022-05-15 20:20:10] [INFO ] Flatten gal took : 39 ms
[2022-05-15 20:20:10] [INFO ] Applying decomposition
[2022-05-15 20:20:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11435503942057171794.txt, -o, /tmp/graph11435503942057171794.bin, -w, /tmp/graph11435503942057171794.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11435503942057171794.bin, -l, -1, -v, -w, /tmp/graph11435503942057171794.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-15 20:20:11] [INFO ] Decomposing Gal with order
[2022-05-15 20:20:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:20:11] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-15 20:20:11] [INFO ] Flatten gal took : 52 ms
[2022-05-15 20:20:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 20:20:11] [INFO ] Time to serialize gal into /tmp/UpperBounds4472200701680098002.gal : 3 ms
[2022-05-15 20:20:11] [INFO ] Time to serialize properties into /tmp/UpperBounds17211099417937165190.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4472200701680098002.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17211099417937165190.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4472200701680098002.gal -t CGAL -reachable-file /tmp/UpperBounds17211099417937165190.prop --nowitness
Loading property file /tmp/UpperBounds17211099417937165190.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\_mod\_flat,37,0.017909,3828,139,80,389,159,68,456,46,336,0
Total reachable state count : 37

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property GPPP-PT-C0001N0000001000-UpperBounds-02 :0 <= i0.u0.E4P <= 1
FORMULA GPPP-PT-C0001N0000001000-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
GPPP-PT-C0001N0000001000-UpperBounds-02,0,0.019978,3828,1,0,389,159,98,456,62,336,102

BK_STOP 1652646012454

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="GPPP-PT-C0001N0000001000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is GPPP-PT-C0001N0000001000, 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 r107-smll-165260580300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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