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.r312-tall-165472282800861.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 itstools
Input is SieveSingleMsgMbox-PT-d0m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282800861
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Jun 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 57K Jun 6 12:11 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 SieveSingleMsgMbox-PT-d0m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654945072604

Running Version 202205111006
[2022-06-11 10:57:53] [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-06-11 10:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 10:57:53] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-06-11 10:57:53] [INFO ] Transformed 262 places.
[2022-06-11 10:57:53] [INFO ] Transformed 73 transitions.
[2022-06-11 10:57:53] [INFO ] Parsed PT model containing 262 places and 73 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2022-06-11 10:57:53] [INFO ] Computed 6 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :2
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1021 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1058 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1063 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
// Phase 1: matrix 73 rows 72 cols
[2022-06-11 10:57:54] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-06-11 10:57:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 10:57:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-11 10:57:54] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-11 10:57:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 3 ms to minimize.
[2022-06-11 10:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-11 10:57:54] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2022-06-11 10:57:54] [INFO ] Added : 4 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 10:57:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2022-06-11 10:57:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2022-06-11 10:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-11 10:57:54] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 10 ms.
[2022-06-11 10:57:54] [INFO ] Added : 13 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 17 ms.
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-11 10:57:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-11 10:57:54] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-11 10:57:54] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2022-06-11 10:57:54] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 55] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 60 transition count 62
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 58 transition count 59
Applied a total of 26 rules in 27 ms. Remains 58 /72 variables (removed 14) and now considering 59/73 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:54] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223501 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103052 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103146 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 2) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-11 10:57:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:56] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-11 10:57:56] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 8 ms.
[2022-06-11 10:57:56] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2022-06-11 10:57:56] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-11 10:57:56] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, 18] Max seen :[0, 0]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:56] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-06-11 10:57:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 10:57:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-10
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:56] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2022-06-11 10:57:56] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 5 ms.
[2022-06-11 10:57:56] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:56] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223851 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103246 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:57] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 10:57:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 10:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 10:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:57] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-11 10:57:57] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-11 10:57:57] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 10:57:57] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:57] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-06-11 10:57:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 in 1306 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-14
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:58] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-11 10:57:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:58] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2022-06-11 10:57:58] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 8 ms.
[2022-06-11 10:57:58] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:58] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223124 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103032 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 10:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-11 10:57:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 10:57:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 10:57:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 10:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 10:57:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-11 10:57:59] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:59] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-11 10:57:59] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-11 10:57:59] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:59] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 10:57:59] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-11 10:57:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-11 10:57:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-11 10:57:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 10:57:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 in 1355 ms.
[2022-06-11 10:57:59] [INFO ] Flatten gal took : 29 ms
[2022-06-11 10:57:59] [INFO ] Applying decomposition
[2022-06-11 10:57:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13021769273205210684.txt' '-o' '/tmp/graph13021769273205210684.bin' '-w' '/tmp/graph13021769273205210684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13021769273205210684.bin' '-l' '-1' '-v' '-w' '/tmp/graph13021769273205210684.weights' '-q' '0' '-e' '0.001'
[2022-06-11 10:57:59] [INFO ] Decomposing Gal with order
[2022-06-11 10:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 10:57:59] [INFO ] Removed a total of 50 redundant transitions.
[2022-06-11 10:57:59] [INFO ] Flatten gal took : 37 ms
[2022-06-11 10:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2022-06-11 10:57:59] [INFO ] Time to serialize gal into /tmp/UpperBounds1267965959218248879.gal : 3 ms
[2022-06-11 10:57:59] [INFO ] Time to serialize properties into /tmp/UpperBounds11175072978818496778.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1267965959218248879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11175072978818496778.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds11175072978818496778.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,4.33358e+07,3.95257,79784,1897,627,75346,7344,195,590670,77,131035,0
Total reachable state count : 43335793

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 :0 <= u10.l209 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 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
SieveSingleMsgMbox-PT-d0m18-UpperBounds-10,0,4.18359,79784,1,0,75346,7344,277,590670,102,131035,1060
Min sum of variable value : 0
Maximum sum along a path : 14
Bounds property SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 :0 <= u11.l208 <= 14
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 14 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
SieveSingleMsgMbox-PT-d0m18-UpperBounds-14,0,4.51586,79784,1,0,75346,9246,296,590670,122,131035,1580
Total runtime 10501 ms.

BK_STOP 1654945084284

--------------------
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="SieveSingleMsgMbox-PT-d0m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m18, 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 r312-tall-165472282800861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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