fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r240-smll-165303241200013
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SimpleLoadBal-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.176 15753.00 25601.00 226.20 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r240-smll-165303241200013.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 SimpleLoadBal-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241200013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.3K Apr 29 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.0K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 155K May 10 09:34 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 SimpleLoadBal-PT-05-UpperBounds-00
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-01
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-02
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-03
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-04
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-05
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-06
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-07
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-08
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-09
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-10
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-11
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-12
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-13
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-14
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653036963608

Running Version 202205111006
[2022-05-20 08:56:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 08:56:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:56:06] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2022-05-20 08:56:06] [INFO ] Transformed 59 places.
[2022-05-20 08:56:06] [INFO ] Transformed 180 transitions.
[2022-05-20 08:56:06] [INFO ] Found NUPN structural information;
[2022-05-20 08:56:06] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5]
[2022-05-20 08:56:06] [INFO ] Parsed PT model containing 59 places and 180 transitions in 447 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
FORMULA SimpleLoadBal-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 140 out of 180 initially.
// Phase 1: matrix 140 rows 59 cols
[2022-05-20 08:56:06] [INFO ] Computed 19 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :12
FORMULA SimpleLoadBal-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-05-20 08:56:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2022-05-20 08:56:06] [INFO ] Computed 19 place invariants in 9 ms
[2022-05-20 08:56:07] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-05-20 08:56:07] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 5 ms returned sat
[2022-05-20 08:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:07] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-05-20 08:56:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:56:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-20 08:56:07] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-20 08:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:07] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-20 08:56:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-20 08:56:07] [INFO ] [Nat]Added 55 Read/Feed constraints in 65 ms returned sat
[2022-05-20 08:56:07] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 7 ms to minimize.
[2022-05-20 08:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-05-20 08:56:07] [INFO ] Computed and/alt/rep : 24/132/24 causal constraints (skipped 111 transitions) in 47 ms.
[2022-05-20 08:56:08] [INFO ] Added : 21 causal constraints over 5 iterations in 233 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Drop transitions removed 14 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 166/166 transitions.
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 56 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 46 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 41 transition count 141
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 41 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 36 transition count 136
Applied a total of 40 rules in 78 ms. Remains 36 /59 variables (removed 23) and now considering 136/166 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/59 places, 136/166 transitions.
Normalized transition count is 104 out of 136 initially.
// Phase 1: matrix 104 rows 36 cols
[2022-05-20 08:56:08] [INFO ] Computed 14 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3460 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties (out of 1) seen :0
[2022-05-20 08:56:13] [INFO ] Flow matrix only has 104 transitions (discarded 32 similar events)
// Phase 1: matrix 104 rows 36 cols
[2022-05-20 08:56:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 08:56:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-20 08:56:13] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-20 08:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:13] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-20 08:56:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:56:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-20 08:56:13] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-20 08:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-20 08:56:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 08:56:13] [INFO ] [Nat]Added 48 Read/Feed constraints in 14 ms returned sat
[2022-05-20 08:56:13] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2022-05-20 08:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-20 08:56:13] [INFO ] Computed and/alt/rep : 10/75/10 causal constraints (skipped 89 transitions) in 40 ms.
[2022-05-20 08:56:13] [INFO ] Added : 2 causal constraints over 1 iterations in 97 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 136/136 transitions.
Applied a total of 0 rules in 18 ms. Remains 36 /36 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 136/136 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 136/136 transitions.
Applied a total of 0 rules in 12 ms. Remains 36 /36 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2022-05-20 08:56:13] [INFO ] Flow matrix only has 104 transitions (discarded 32 similar events)
// Phase 1: matrix 104 rows 36 cols
[2022-05-20 08:56:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 08:56:13] [INFO ] Implicit Places using invariants in 150 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 34/36 places, 136/136 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 32 transition count 134
Applied a total of 4 rules in 15 ms. Remains 32 /34 variables (removed 2) and now considering 134/136 (removed 2) transitions.
[2022-05-20 08:56:13] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:13] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 08:56:13] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-20 08:56:13] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:13] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 08:56:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 08:56:14] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 32/36 places, 134/136 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/36 places, 134/136 transitions.
Normalized transition count is 102 out of 134 initially.
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:14] [INFO ] Computed 12 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3409 ms. (steps per millisecond=293 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 1) seen :0
[2022-05-20 08:56:18] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 08:56:18] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-20 08:56:18] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 08:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:18] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-20 08:56:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:56:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-20 08:56:18] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 08:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:56:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-20 08:56:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 08:56:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2022-05-20 08:56:18] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-20 08:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-05-20 08:56:18] [INFO ] Computed and/alt/rep : 10/75/10 causal constraints (skipped 87 transitions) in 18 ms.
[2022-05-20 08:56:18] [INFO ] Added : 3 causal constraints over 2 iterations in 44 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 32 /32 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 134/134 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2022-05-20 08:56:18] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:18] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 08:56:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-20 08:56:18] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:18] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 08:56:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 08:56:18] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2022-05-20 08:56:18] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-20 08:56:18] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2022-05-20 08:56:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 08:56:19] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 16 transitions.
Found 16 dead transitions using SMT.
Drop transitions removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SAFETY mode, iteration 1 : 32/32 places, 118/134 transitions.
Graph (complete) has 352 edges and 32 vertex of which 1 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.8 ms
Discarding 31 places :
Also discarding 118 output transitions
Drop transitions removed 118 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 1 /32 variables (removed 31) and now considering 0/118 (removed 118) transitions.
[2022-05-20 08:56:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 08:56:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-20 08:56:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 08:56:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1/32 places, 0/134 transitions.
Finished structural reductions, in 2 iterations. Remains : 1/32 places, 0/134 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 13240 ms.

BK_STOP 1653036979361

--------------------
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="SimpleLoadBal-PT-05"
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 SimpleLoadBal-PT-05, 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 r240-smll-165303241200013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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