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-165472282900917.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-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900917
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 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 450K 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-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654953110593

Running Version 202205111006
[2022-06-11 13:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 13:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 13:11:51] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-11 13:11:51] [INFO ] Transformed 1295 places.
[2022-06-11 13:11:51] [INFO ] Transformed 749 transitions.
[2022-06-11 13:11:51] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 16 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 13:11:52] [INFO ] Computed 6 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2134 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 13:11:52] [INFO ] Computed 6 place invariants in 11 ms
[2022-06-11 13:11:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-11 13:11:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 9 ms returned sat
[2022-06-11 13:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:52] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-06-11 13:11:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:11:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:11:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:52] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-11 13:11:52] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-11 13:11:53] [INFO ] [Nat]Added 587 Read/Feed constraints in 136 ms returned sat
[2022-06-11 13:11:53] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2022-06-11 13:11:53] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 1 ms to minimize.
[2022-06-11 13:11:53] [INFO ] Deduced a trap composed of 159 places in 98 ms of which 1 ms to minimize.
[2022-06-11 13:11:53] [INFO ] Deduced a trap composed of 161 places in 90 ms of which 1 ms to minimize.
[2022-06-11 13:11:53] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 1 ms to minimize.
[2022-06-11 13:11:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 820 ms
[2022-06-11 13:11:54] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 125 ms.
[2022-06-11 13:11:54] [INFO ] Added : 28 causal constraints over 6 iterations in 489 ms. Result :sat
Minimization took 187 ms.
[2022-06-11 13:11:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:54] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-06-11 13:11:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:11:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:54] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-06-11 13:11:54] [INFO ] [Nat]Added 587 Read/Feed constraints in 65 ms returned sat
[2022-06-11 13:11:55] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 0 ms to minimize.
[2022-06-11 13:11:55] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2022-06-11 13:11:55] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 0 ms to minimize.
[2022-06-11 13:11:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 430 ms
[2022-06-11 13:11:55] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 69 ms.
[2022-06-11 13:11:55] [INFO ] Added : 7 causal constraints over 2 iterations in 229 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [10, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 231
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 225
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 413 place count 137 transition count 181
Iterating global reduction 2 with 44 rules applied. Total rules applied 457 place count 137 transition count 181
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 473 place count 137 transition count 165
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 499 place count 111 transition count 138
Iterating global reduction 3 with 26 rules applied. Total rules applied 525 place count 111 transition count 138
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 540 place count 111 transition count 123
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 548 place count 103 transition count 112
Iterating global reduction 4 with 8 rules applied. Total rules applied 556 place count 103 transition count 112
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 564 place count 95 transition count 104
Iterating global reduction 4 with 8 rules applied. Total rules applied 572 place count 95 transition count 104
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 577 place count 90 transition count 98
Iterating global reduction 4 with 5 rules applied. Total rules applied 582 place count 90 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 584 place count 90 transition count 96
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 589 place count 85 transition count 91
Iterating global reduction 5 with 5 rules applied. Total rules applied 594 place count 85 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 597 place count 82 transition count 88
Iterating global reduction 5 with 3 rules applied. Total rules applied 600 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 601 place count 81 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 603 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 604 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 605 place count 79 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 606 place count 79 transition count 84
Applied a total of 606 rules in 79 ms. Remains 79 /259 variables (removed 180) and now considering 84/749 (removed 665) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/259 places, 84/749 transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:56] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224308 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102896 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-11 13:11:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 13:11:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 13:11:57] [INFO ] [Nat]Added 32 Read/Feed constraints in 16 ms returned sat
[2022-06-11 13:11:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 6 ms.
[2022-06-11 13:11:57] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:57] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 13:11:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-06-11 13:11:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-11 13:11:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 13:11:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 13:11:57] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2022-06-11 13:11:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 12 ms.
[2022-06-11 13:11:57] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:57] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223909 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103713 resets, run finished after 364 ms. (steps per millisecond=2747 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:58] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-11 13:11:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:11:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:11:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-11 13:11:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 13:11:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2022-06-11 13:11:59] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 6 ms.
[2022-06-11 13:11:59] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:59] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 13:11:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-06-11 13:11:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 13:11:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:59] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 in 1729 ms.
[2022-06-11 13:11:59] [INFO ] Flatten gal took : 32 ms
[2022-06-11 13:11:59] [INFO ] Applying decomposition
[2022-06-11 13:11:59] [INFO ] Flatten gal took : 11 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/graph16358038519529070505.txt' '-o' '/tmp/graph16358038519529070505.bin' '-w' '/tmp/graph16358038519529070505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16358038519529070505.bin' '-l' '-1' '-v' '-w' '/tmp/graph16358038519529070505.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:11:59] [INFO ] Decomposing Gal with order
[2022-06-11 13:11:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:11:59] [INFO ] Removed a total of 80 redundant transitions.
[2022-06-11 13:11:59] [INFO ] Flatten gal took : 59 ms
[2022-06-11 13:11:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 6 ms.
[2022-06-11 13:11:59] [INFO ] Time to serialize gal into /tmp/UpperBounds3497640812970277438.gal : 5 ms
[2022-06-11 13:11:59] [INFO ] Time to serialize properties into /tmp/UpperBounds18306811841995044560.prop : 1 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/UpperBounds3497640812970277438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18306811841995044560.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/UpperBounds18306811841995044560.prop.
Detected timeout of ITS tools.
[2022-06-11 13:32:01] [INFO ] Flatten gal took : 6 ms
[2022-06-11 13:32:01] [INFO ] Time to serialize gal into /tmp/UpperBounds9299749633371018881.gal : 2 ms
[2022-06-11 13:32:01] [INFO ] Time to serialize properties into /tmp/UpperBounds14218891226672868949.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/UpperBounds9299749633371018881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14218891226672868949.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...296
Loading property file /tmp/UpperBounds14218891226672868949.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,1.20491e+13,53.6502,957120,2,26864,5,4.86641e+06,6,0,402,4.1315e+06,0
Total reachable state count : 12049075913425

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 :0 <= l921 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

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-d1m36-UpperBounds-04,0,53.6559,957120,1,0,7,4.86641e+06,9,1,488,4.1315e+06,4
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1263915 ms.

BK_STOP 1654954375698

--------------------
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-d1m36"
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-d1m36, 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-165472282900917"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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