About the Execution of 2021-gold for GPPP-PT-C0100N0000001000
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-165260580400094.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-C0100N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580400094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.0K Apr 29 18:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 18:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 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-C0100N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652646252778
Running Version 0
[2022-05-15 20:24:15] [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:24:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:24:16] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2022-05-15 20:24:16] [INFO ] Transformed 33 places.
[2022-05-15 20:24:16] [INFO ] Transformed 22 transitions.
[2022-05-15 20:24:16] [INFO ] Parsed PT model containing 33 places and 22 transitions in 90 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:24:16] [INFO ] Computed 12 place invariants in 10 ms
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-10 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10626 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=559 ) properties (out of 13) seen :3726
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-11 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :1726
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :1629
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1699
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1729
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :1404
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1634
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1910
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :1671
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :2046
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1621
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1581
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :1574
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:24:16] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-15 20:24:16] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-15 20:24:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:16] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-15 20:24:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 349 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using state equation in 85 ms returned unsat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-15 20:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 110 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using state equation in 224 ms returned unsat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-15 20:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-15 20:24:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 20:24:17] [INFO ] Added : 10 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 19 ms.
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-15 20:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-15 20:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using state equation in 528 ms returned unsat
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 20:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 20:24:23] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5009 ms returned unknown
[2022-05-15 20:24:23] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:23] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-15 20:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 20:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:23] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-15 20:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:24] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-05-15 20:24:24] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 20:24:24] [INFO ] Added : 11 causal constraints over 3 iterations in 107 ms. Result :sat
Minimization took 12 ms.
[2022-05-15 20:24:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:24] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 20:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:24] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using state equation in 4978 ms returned unknown
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 132 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using state equation in 229 ms returned unsat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [398, 10, 450, 300, 400, 1, 6666, 450, 2000, 10, 2, 2] Max seen :[398, 10, 3, 300, 400, 1, 1104, 3, 796, 10, 2, 2]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-05 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-04 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-01 398 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 81300 steps, including 98 resets, run finished after 154 ms. (steps per millisecond=527 ) properties (out of 4) seen :1908 could not realise parikh vector
Incomplete Parikh walk after 80900 steps, including 98 resets, run finished after 114 ms. (steps per millisecond=709 ) properties (out of 4) seen :1904 could not realise parikh vector
Support contains 4 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 5 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 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 8 place count 28 transition count 17
Applied a total of 8 rules in 31 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-15 20:24:30] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 20:24:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/33 places, 17/22 transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-15 20:24:30] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000457 steps, including 484 resets, run finished after 460 ms. (steps per millisecond=2174 ) properties (out of 4) seen :1908
Incomplete Best-First random walk after 1000001 steps, including 92 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 4) seen :1538
Incomplete Best-First random walk after 1000000 steps, including 116 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 4) seen :1586
Incomplete Best-First random walk after 1000001 steps, including 92 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 4) seen :1543
Incomplete Best-First random walk after 1000001 steps, including 156 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 4) seen :1886
// Phase 1: matrix 17 rows 28 cols
[2022-05-15 20:24:32] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using state equation in 156 ms returned unsat
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 10 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using state equation in 72 ms returned unsat
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 20:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:39] [INFO ] [Nat]Absence check using state equation in 6011 ms returned unknown
[2022-05-15 20:24:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:39] [INFO ] [Nat]Absence check using state equation in 67 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1104, 450, 796] Max seen :[4, 1104, 4, 796]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-09 796 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-07 1104 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 17/17 transitions.
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 0 with 3 rules applied. Total rules applied 3 place count 26 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 25 transition count 15
Applied a total of 5 rules in 6 ms. Remains 25 /28 variables (removed 3) and now considering 15/17 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 15/17 transitions.
// Phase 1: matrix 15 rows 25 cols
[2022-05-15 20:24:39] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 789 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :4
// Phase 1: matrix 15 rows 25 cols
[2022-05-15 20:24:40] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:24:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:40] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-15 20:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:24:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-15 20:24:40] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652646281896
--------------------
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-C0100N0000001000"
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-C0100N0000001000, 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-165260580400094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 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 '
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 ;