Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599000285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SafeBus-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599000285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 39K Apr 29 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 29 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 29 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 792K Apr 29 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 388K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 3.5M 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 SafeBus-PT-15-UpperBounds-00
FORMULA_NAME SafeBus-PT-15-UpperBounds-01
FORMULA_NAME SafeBus-PT-15-UpperBounds-02
FORMULA_NAME SafeBus-PT-15-UpperBounds-03
FORMULA_NAME SafeBus-PT-15-UpperBounds-04
FORMULA_NAME SafeBus-PT-15-UpperBounds-05
FORMULA_NAME SafeBus-PT-15-UpperBounds-06
FORMULA_NAME SafeBus-PT-15-UpperBounds-07
FORMULA_NAME SafeBus-PT-15-UpperBounds-08
FORMULA_NAME SafeBus-PT-15-UpperBounds-09
FORMULA_NAME SafeBus-PT-15-UpperBounds-10
FORMULA_NAME SafeBus-PT-15-UpperBounds-11
FORMULA_NAME SafeBus-PT-15-UpperBounds-12
FORMULA_NAME SafeBus-PT-15-UpperBounds-13
FORMULA_NAME SafeBus-PT-15-UpperBounds-14
FORMULA_NAME SafeBus-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652956441933

Running Version 202205111006
[2022-05-19 10:34:02] [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-19 10:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:34:03] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2022-05-19 10:34:03] [INFO ] Transformed 621 places.
[2022-05-19 10:34:03] [INFO ] Transformed 4771 transitions.
[2022-05-19 10:34:03] [INFO ] Parsed PT model containing 621 places and 4771 transitions in 468 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 15 places and 0 transitions.
Normalized transition count is 1412 out of 4771 initially.
// Phase 1: matrix 1412 rows 606 cols
[2022-05-19 10:34:03] [INFO ] Computed 65 place invariants in 78 ms
FORMULA SafeBus-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 13) seen :54
FORMULA SafeBus-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :46
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :44
[2022-05-19 10:34:04] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2022-05-19 10:34:04] [INFO ] Computed 65 place invariants in 43 ms
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 9 ms returned unsat
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive place invariants in 36 ms returned sat
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 10 ms returned unsat
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:04] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 10 ms returned sat
[2022-05-19 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:05] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-19 10:34:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:34:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2022-05-19 10:34:05] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 10 ms returned sat
[2022-05-19 10:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:05] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-05-19 10:34:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:34:06] [INFO ] [Nat]Added 241 Read/Feed constraints in 955 ms returned sat
[2022-05-19 10:34:07] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 382 ms.
[2022-05-19 10:34:07] [INFO ] Added : 0 causal constraints over 0 iterations in 537 ms. Result :sat
Minimization took 614 ms.
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 10 ms returned unsat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 13 ms returned unsat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 13 ms returned unsat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2022-05-19 10:34:08] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [15, 1, 211, 1, 15, 1, 1] Max seen :[15, 1, 14, 1, 15, 1, 1]
FORMULA SafeBus-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-15-UpperBounds-00 15 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1138 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 606/606 places, 4771/4771 transitions.
Normalized transition count is 1412 out of 4771 initially.
// Phase 1: matrix 1412 rows 606 cols
[2022-05-19 10:34:10] [INFO ] Computed 65 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10396 ms. (steps per millisecond=96 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2902 ms. (steps per millisecond=344 ) properties (out of 1) seen :14
[2022-05-19 10:34:23] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2022-05-19 10:34:23] [INFO ] Computed 65 place invariants in 17 ms
[2022-05-19 10:34:23] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:23] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 11 ms returned sat
[2022-05-19 10:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:23] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-19 10:34:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:34:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:23] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 10 ms returned sat
[2022-05-19 10:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:24] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2022-05-19 10:34:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:34:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 934 ms returned sat
[2022-05-19 10:34:25] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 204 ms.
[2022-05-19 10:34:25] [INFO ] Added : 0 causal constraints over 0 iterations in 316 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : [211] Max seen :[14]
Support contains 15 out of 606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 936 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 875 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2022-05-19 10:34:28] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2022-05-19 10:34:28] [INFO ] Computed 65 place invariants in 21 ms
[2022-05-19 10:34:29] [INFO ] Implicit Places using invariants in 1041 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 15 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1097 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 591/606 places, 4771/4771 transitions.
Normalized transition count is 1412 out of 4771 initially.
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:30] [INFO ] Computed 50 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10176 ms. (steps per millisecond=98 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2951 ms. (steps per millisecond=338 ) properties (out of 1) seen :14
[2022-05-19 10:34:44] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:44] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-19 10:34:44] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-19 10:34:44] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 8 ms returned sat
[2022-05-19 10:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:44] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-19 10:34:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:34:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2022-05-19 10:34:44] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2022-05-19 10:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:34:44] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2022-05-19 10:34:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:34:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 431 ms returned sat
[2022-05-19 10:34:45] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 140 ms.
[2022-05-19 10:34:45] [INFO ] Added : 0 causal constraints over 0 iterations in 307 ms. Result :sat
Minimization took 708 ms.
Current structural bounds on expressions (after SMT) : [15] Max seen :[14]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 876 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4771/4771 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 893 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2022-05-19 10:34:48] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:48] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-19 10:34:49] [INFO ] Implicit Places using invariants in 949 ms returned []
[2022-05-19 10:34:49] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:49] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-19 10:34:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:34:54] [INFO ] Implicit Places using invariants and state equation in 4942 ms returned []
Implicit Place search using SMT with State Equation took 5899 ms to find 0 implicit places.
[2022-05-19 10:34:55] [INFO ] Redundant transitions in 325 ms returned []
[2022-05-19 10:34:55] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:55] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-19 10:34:56] [INFO ] Dead Transitions using invariants and state equation in 1567 ms found 225 transitions.
Found 225 dead transitions using SMT.
Drop transitions removed 225 transitions
Dead transitions reduction (with SMT) removed 225 transitions
Starting structural reductions in SAFETY mode, iteration 1 : 591/591 places, 4546/4771 transitions.
Applied a total of 0 rules in 800 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2022-05-19 10:34:57] [INFO ] Redundant transitions in 209 ms returned []
Finished structural reductions, in 2 iterations. Remains : 591/591 places, 4546/4771 transitions.
Normalized transition count is 1412 out of 4546 initially.
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:34:57] [INFO ] Computed 50 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9650 ms. (steps per millisecond=103 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2695 ms. (steps per millisecond=371 ) properties (out of 1) seen :14
[2022-05-19 10:35:10] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:10] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-19 10:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-19 10:35:10] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned sat
[2022-05-19 10:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:10] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-05-19 10:35:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:35:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-19 10:35:10] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 6 ms returned sat
[2022-05-19 10:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:11] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-05-19 10:35:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:35:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 1145 ms returned sat
[2022-05-19 10:35:13] [INFO ] Deduced a trap composed of 47 places in 853 ms of which 18 ms to minimize.
[2022-05-19 10:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 956 ms
[2022-05-19 10:35:13] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 186 ms.
[2022-05-19 10:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 475 ms.
Current structural bounds on expressions (after SMT) : [15] Max seen :[14]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 770 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4546/4546 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 794 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2022-05-19 10:35:15] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:15] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-19 10:35:16] [INFO ] Implicit Places using invariants in 888 ms returned []
[2022-05-19 10:35:16] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:16] [INFO ] Computed 50 place invariants in 22 ms
[2022-05-19 10:35:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:35:20] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 5315 ms to find 0 implicit places.
[2022-05-19 10:35:21] [INFO ] Redundant transitions in 203 ms returned []
[2022-05-19 10:35:21] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:21] [INFO ] Computed 50 place invariants in 7 ms
[2022-05-19 10:35:22] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4546/4546 transitions.
Starting property specific reduction for SafeBus-PT-15-UpperBounds-03
Normalized transition count is 1412 out of 4546 initially.
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:22] [INFO ] Computed 50 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :14
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 :14
[2022-05-19 10:35:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:23] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-19 10:35:23] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-19 10:35:23] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned sat
[2022-05-19 10:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:23] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-05-19 10:35:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:35:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-19 10:35:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned sat
[2022-05-19 10:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:23] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-05-19 10:35:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:35:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 1202 ms returned sat
[2022-05-19 10:35:25] [INFO ] Deduced a trap composed of 47 places in 526 ms of which 1 ms to minimize.
[2022-05-19 10:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2022-05-19 10:35:25] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 208 ms.
[2022-05-19 10:35:26] [INFO ] Added : 0 causal constraints over 0 iterations in 367 ms. Result :sat
Minimization took 491 ms.
Current structural bounds on expressions (after SMT) : [15] Max seen :[14]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 763 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4546/4546 transitions.
Normalized transition count is 1412 out of 4546 initially.
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:27] [INFO ] Computed 50 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9754 ms. (steps per millisecond=102 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2714 ms. (steps per millisecond=368 ) properties (out of 1) seen :14
[2022-05-19 10:35:39] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:39] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-19 10:35:40] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2022-05-19 10:35:40] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 6 ms returned sat
[2022-05-19 10:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:40] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-19 10:35:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:35:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2022-05-19 10:35:40] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned sat
[2022-05-19 10:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:35:40] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-05-19 10:35:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:35:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 1141 ms returned sat
[2022-05-19 10:35:42] [INFO ] Deduced a trap composed of 47 places in 591 ms of which 2 ms to minimize.
[2022-05-19 10:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 667 ms
[2022-05-19 10:35:42] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 128 ms.
[2022-05-19 10:35:42] [INFO ] Added : 0 causal constraints over 0 iterations in 222 ms. Result :sat
Minimization took 494 ms.
Current structural bounds on expressions (after SMT) : [15] Max seen :[14]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 773 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4546/4546 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 763 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2022-05-19 10:35:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:45] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-19 10:35:46] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-19 10:35:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:46] [INFO ] Computed 50 place invariants in 10 ms
[2022-05-19 10:35:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-19 10:35:50] [INFO ] Implicit Places using invariants and state equation in 4596 ms returned []
Implicit Place search using SMT with State Equation took 5482 ms to find 0 implicit places.
[2022-05-19 10:35:50] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-19 10:35:50] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-19 10:35:50] [INFO ] Computed 50 place invariants in 12 ms
[2022-05-19 10:35:52] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/591 places, 4546/4546 transitions.
Ending property specific reduction for SafeBus-PT-15-UpperBounds-03 in 29388 ms.
[2022-05-19 10:35:52] [INFO ] Flatten gal took : 326 ms
[2022-05-19 10:35:52] [INFO ] Applying decomposition
[2022-05-19 10:35:53] [INFO ] Flatten gal took : 232 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/graph6927535117475516290.txt' '-o' '/tmp/graph6927535117475516290.bin' '-w' '/tmp/graph6927535117475516290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6927535117475516290.bin' '-l' '-1' '-v' '-w' '/tmp/graph6927535117475516290.weights' '-q' '0' '-e' '0.001'
[2022-05-19 10:35:53] [INFO ] Decomposing Gal with order
[2022-05-19 10:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:35:54] [INFO ] Removed a total of 10640 redundant transitions.
[2022-05-19 10:35:54] [INFO ] Flatten gal took : 1112 ms
[2022-05-19 10:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1320 labels/synchronizations in 190 ms.
[2022-05-19 10:35:55] [INFO ] Time to serialize gal into /tmp/UpperBounds16487930901359444749.gal : 41 ms
[2022-05-19 10:35:55] [INFO ] Time to serialize properties into /tmp/UpperBounds10031696273005890311.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/UpperBounds16487930901359444749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10031696273005890311.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...297
Loading property file /tmp/UpperBounds10031696273005890311.prop.
Detected timeout of ITS tools.
[2022-05-19 10:56:41] [INFO ] Flatten gal took : 1117 ms
[2022-05-19 10:56:41] [INFO ] Time to serialize gal into /tmp/UpperBounds7758725157353780834.gal : 88 ms
[2022-05-19 10:56:41] [INFO ] Time to serialize properties into /tmp/UpperBounds7658882902715283378.prop : 2 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/UpperBounds7758725157353780834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7658882902715283378.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...295
Loading property file /tmp/UpperBounds7658882902715283378.prop.
Detected timeout of ITS tools.
[2022-05-19 11:17:28] [INFO ] Flatten gal took : 1059 ms
[2022-05-19 11:17:34] [INFO ] Input system was already deterministic with 4546 transitions.
[2022-05-19 11:17:34] [INFO ] Transformed 591 places.
[2022-05-19 11:17:34] [INFO ] Transformed 4546 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 11:18:05] [INFO ] Time to serialize gal into /tmp/UpperBounds158077690967216830.gal : 13 ms
[2022-05-19 11:18:05] [INFO ] Time to serialize properties into /tmp/UpperBounds13242311280241703647.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/UpperBounds158077690967216830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13242311280241703647.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13242311280241703647.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="SafeBus-PT-15"
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 SafeBus-PT-15, 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 r204-oct2-165281599000285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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