About the Execution of GreatSPN+red for SemanticWebServices-PT-S256P15
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078800597.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SemanticWebServices-PT-S256P15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078800597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M May 18 16:43 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 SemanticWebServices-PT-S256P15-UpperBounds-00
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-01
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-02
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-03
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-04
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-05
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-06
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-07
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-08
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-09
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-10
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-11
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-12
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-13
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-14
FORMULA_NAME SemanticWebServices-PT-S256P15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716875988215
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:59:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 05:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:59:50] [INFO ] Load time of PNML (sax parser for PT used): 1198 ms
[2024-05-28 05:59:50] [INFO ] Transformed 329 places.
[2024-05-28 05:59:50] [INFO ] Transformed 29492 transitions.
[2024-05-28 05:59:50] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 107 ms.
Deduced a syphon composed of 5 places in 64 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 05:59:51] [INFO ] Flow matrix only has 1901 transitions (discarded 18713 similar events)
// Phase 1: matrix 1901 rows 324 cols
[2024-05-28 05:59:51] [INFO ] Computed 36 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
RANDOM walk for 10000 steps (2 resets) in 849 ms. (11 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 72 ms. (2192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 48, 26, 27, 4, 8, 0, 0, 234, 18, 0, 100, 0, 40, 79, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
[2024-05-28 05:59:52] [INFO ] Flow matrix only has 1901 transitions (discarded 18713 similar events)
[2024-05-28 05:59:52] [INFO ] Invariant cache hit.
[2024-05-28 05:59:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 05:59:52] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-28 05:59:52] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-05-28 05:59:53] [INFO ] State equation strengthened by 1044 read => feed constraints.
[2024-05-28 05:59:54] [INFO ] [Real]Added 1044 Read/Feed constraints in 1203 ms returned sat
[2024-05-28 05:59:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:59:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 05:59:54] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 7 ms returned sat
[2024-05-28 05:59:55] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-28 05:59:56] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1150 ms returned sat
[2024-05-28 05:59:57] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 982 ms.
[2024-05-28 05:59:57] [INFO ] Added : 6 causal constraints over 2 iterations in 1339 ms. Result :sat
Minimization took 1495 ms.
[2024-05-28 05:59:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 05:59:59] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 7 ms returned sat
[2024-05-28 05:59:59] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-28 06:00:00] [INFO ] [Real]Added 1044 Read/Feed constraints in 1157 ms returned sat
[2024-05-28 06:00:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 06:00:00] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:01] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2024-05-28 06:00:02] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1125 ms returned sat
[2024-05-28 06:00:03] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 891 ms.
[2024-05-28 06:00:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1051 ms. Result :sat
Minimization took 1572 ms.
[2024-05-28 06:00:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:05] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:05] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-28 06:00:06] [INFO ] [Real]Added 1044 Read/Feed constraints in 1151 ms returned sat
[2024-05-28 06:00:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:06] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-05-28 06:00:06] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2024-05-28 06:00:08] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1109 ms returned sat
[2024-05-28 06:00:08] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 710 ms.
[2024-05-28 06:00:08] [INFO ] Added : 0 causal constraints over 0 iterations in 852 ms. Result :sat
Minimization took 1360 ms.
[2024-05-28 06:00:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:10] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:10] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 06:00:11] [INFO ] [Real]Added 1044 Read/Feed constraints in 1120 ms returned sat
[2024-05-28 06:00:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-28 06:00:11] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 6 ms returned sat
[2024-05-28 06:00:12] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-28 06:00:13] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1099 ms returned sat
[2024-05-28 06:00:14] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 913 ms.
[2024-05-28 06:00:14] [INFO ] Added : 0 causal constraints over 0 iterations in 1065 ms. Result :sat
Minimization took 1330 ms.
[2024-05-28 06:00:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:15] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:16] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-28 06:00:17] [INFO ] [Real]Added 1044 Read/Feed constraints in 1167 ms returned sat
[2024-05-28 06:00:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:17] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:17] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-05-28 06:00:18] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1135 ms returned sat
[2024-05-28 06:00:19] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 675 ms.
[2024-05-28 06:00:19] [INFO ] Added : 0 causal constraints over 0 iterations in 814 ms. Result :sat
Minimization took 1384 ms.
[2024-05-28 06:00:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:21] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:21] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 06:00:22] [INFO ] [Real]Added 1044 Read/Feed constraints in 1171 ms returned sat
[2024-05-28 06:00:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:22] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:00:22] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2024-05-28 06:00:24] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1155 ms returned sat
[2024-05-28 06:00:24] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 623 ms.
[2024-05-28 06:00:24] [INFO ] Added : 0 causal constraints over 0 iterations in 756 ms. Result :sat
Minimization took 1316 ms.
[2024-05-28 06:00:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:26] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-05-28 06:00:26] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-05-28 06:00:27] [INFO ] [Real]Added 1044 Read/Feed constraints in 1147 ms returned sat
[2024-05-28 06:00:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:27] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:28] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-28 06:00:29] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1117 ms returned sat
[2024-05-28 06:00:29] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 597 ms.
[2024-05-28 06:00:30] [INFO ] Added : 4 causal constraints over 1 iterations in 796 ms. Result :sat
Minimization took 1310 ms.
[2024-05-28 06:00:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:31] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:00:31] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2024-05-28 06:00:32] [INFO ] [Real]Added 1044 Read/Feed constraints in 1139 ms returned sat
[2024-05-28 06:00:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:32] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:33] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-28 06:00:34] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1113 ms returned sat
[2024-05-28 06:00:34] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 587 ms.
[2024-05-28 06:00:35] [INFO ] Added : 5 causal constraints over 1 iterations in 782 ms. Result :sat
Minimization took 1305 ms.
[2024-05-28 06:00:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:36] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:36] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2024-05-28 06:00:38] [INFO ] [Real]Added 1044 Read/Feed constraints in 1159 ms returned sat
[2024-05-28 06:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:38] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:38] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-28 06:00:39] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1162 ms returned sat
[2024-05-28 06:00:40] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 561 ms.
[2024-05-28 06:00:40] [INFO ] Added : 0 causal constraints over 0 iterations in 694 ms. Result :sat
Minimization took 1292 ms.
[2024-05-28 06:00:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:41] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-05-28 06:00:41] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-28 06:00:43] [INFO ] [Real]Added 1044 Read/Feed constraints in 1105 ms returned sat
[2024-05-28 06:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:43] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:00:43] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-28 06:00:44] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1125 ms returned sat
[2024-05-28 06:00:45] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 573 ms.
[2024-05-28 06:00:45] [INFO ] Added : 0 causal constraints over 0 iterations in 717 ms. Result :sat
Minimization took 1314 ms.
[2024-05-28 06:00:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:46] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 7 ms returned sat
[2024-05-28 06:00:46] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-05-28 06:00:48] [INFO ] [Real]Added 1044 Read/Feed constraints in 1135 ms returned sat
[2024-05-28 06:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:48] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:00:48] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2024-05-28 06:00:49] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1110 ms returned sat
[2024-05-28 06:00:50] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 566 ms.
[2024-05-28 06:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 762 ms. Result :sat
Minimization took 1306 ms.
[2024-05-28 06:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:00:51] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:00:52] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-28 06:00:53] [INFO ] [Real]Added 1044 Read/Feed constraints in 1103 ms returned sat
[2024-05-28 06:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:53] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-05-28 06:00:53] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-28 06:00:54] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1113 ms returned sat
[2024-05-28 06:00:55] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 576 ms.
[2024-05-28 06:00:55] [INFO ] Added : 0 causal constraints over 0 iterations in 707 ms. Result :sat
Minimization took 1306 ms.
[2024-05-28 06:00:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:56] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 7 ms returned sat
[2024-05-28 06:00:57] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 06:00:58] [INFO ] [Real]Added 1044 Read/Feed constraints in 1101 ms returned sat
[2024-05-28 06:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:00:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:00:58] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:00:58] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-28 06:00:59] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1107 ms returned sat
[2024-05-28 06:01:00] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 575 ms.
[2024-05-28 06:01:00] [INFO ] Added : 1 causal constraints over 1 iterations in 759 ms. Result :sat
Minimization took 1300 ms.
[2024-05-28 06:01:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:01:01] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:01:02] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 06:01:03] [INFO ] [Real]Added 1044 Read/Feed constraints in 1086 ms returned sat
[2024-05-28 06:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:01:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:01:03] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 8 ms returned sat
[2024-05-28 06:01:03] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-05-28 06:01:04] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1100 ms returned sat
[2024-05-28 06:01:05] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 560 ms.
[2024-05-28 06:01:05] [INFO ] Added : 0 causal constraints over 0 iterations in 702 ms. Result :sat
Minimization took 1294 ms.
[2024-05-28 06:01:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:01:06] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:01:07] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-05-28 06:01:08] [INFO ] [Real]Added 1044 Read/Feed constraints in 1088 ms returned sat
[2024-05-28 06:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:01:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:01:08] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-05-28 06:01:08] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-05-28 06:01:09] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1110 ms returned sat
[2024-05-28 06:01:10] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 565 ms.
[2024-05-28 06:01:10] [INFO ] Added : 0 causal constraints over 0 iterations in 700 ms. Result :sat
Minimization took 1298 ms.
[2024-05-28 06:01:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 06:01:11] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:01:11] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 06:01:13] [INFO ] [Real]Added 1044 Read/Feed constraints in 1117 ms returned sat
[2024-05-28 06:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:01:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 06:01:13] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-05-28 06:01:13] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-05-28 06:01:14] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1105 ms returned sat
[2024-05-28 06:01:15] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 572 ms.
[2024-05-28 06:01:15] [INFO ] Added : 0 causal constraints over 0 iterations in 706 ms. Result :sat
Minimization took 1282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 48, 26, 27, 4, 8, 0, 0, 234, 18, 0, 100, 0, 40, 79, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 48, 26, 27, 4, 8, 0, 0, 234, 18, 0, 100, 0, 40, 79, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
Support contains 16 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Graph (complete) has 3631 edges and 324 vertex of which 310 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.40 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 545 transitions
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 972 transitions.
Iterating post reduction 0 with 1006 rules applied. Total rules applied 1007 place count 276 transition count 19642
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1007 place count 276 transition count 19640
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1011 place count 274 transition count 19640
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 1040 place count 245 transition count 13606
Iterating global reduction 1 with 29 rules applied. Total rules applied 1069 place count 245 transition count 13606
Ensure Unique test removed 1136 transitions
Reduce isomorphic transitions removed 1136 transitions.
Iterating post reduction 1 with 1136 rules applied. Total rules applied 2205 place count 245 transition count 12470
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2210 place count 240 transition count 12465
Iterating global reduction 2 with 5 rules applied. Total rules applied 2215 place count 240 transition count 12465
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2218 place count 237 transition count 12462
Iterating global reduction 2 with 3 rules applied. Total rules applied 2221 place count 237 transition count 12462
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2223 place count 235 transition count 12460
Iterating global reduction 2 with 2 rules applied. Total rules applied 2225 place count 235 transition count 12460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2226 place count 234 transition count 12459
Iterating global reduction 2 with 1 rules applied. Total rules applied 2227 place count 234 transition count 12459
Drop transitions (Redundant composition of simpler transitions.) removed 2630 transitions
Redundant transition composition rules discarded 2630 transitions
Iterating global reduction 2 with 2630 rules applied. Total rules applied 4857 place count 234 transition count 9829
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Ensure Unique test removed 491 transitions
Reduce isomorphic transitions removed 624 transitions.
Iterating post reduction 2 with 631 rules applied. Total rules applied 5488 place count 227 transition count 9205
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 5501 place count 214 transition count 7680
Iterating global reduction 3 with 13 rules applied. Total rules applied 5514 place count 214 transition count 7680
Ensure Unique test removed 1170 transitions
Reduce isomorphic transitions removed 1170 transitions.
Iterating post reduction 3 with 1170 rules applied. Total rules applied 6684 place count 214 transition count 6510
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 6685 place count 213 transition count 6382
Iterating global reduction 4 with 1 rules applied. Total rules applied 6686 place count 213 transition count 6382
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 6692 place count 213 transition count 6376
Drop transitions (Redundant composition of simpler transitions.) removed 490 transitions
Redundant transition composition rules discarded 490 transitions
Iterating global reduction 5 with 490 rules applied. Total rules applied 7182 place count 213 transition count 5886
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 5 with 123 rules applied. Total rules applied 7305 place count 211 transition count 5765
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 7357 place count 211 transition count 5713
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 7359 place count 211 transition count 5711
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 7361 place count 209 transition count 5711
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7362 place count 208 transition count 5710
Applied a total of 7362 rules in 5188 ms. Remains 208 /324 variables (removed 116) and now considering 5710/20614 (removed 14904) transitions.
Running 5137 sub problems to find dead transitions.
[2024-05-28 06:01:21] [INFO ] Flow matrix only has 1172 transitions (discarded 4538 similar events)
Normalized transition count is 1171 out of 1172 initially.
// Phase 1: matrix 1171 rows 208 cols
[2024-05-28 06:01:21] [INFO ] Computed 1 invariants in 3 ms
[2024-05-28 06:01:22] [INFO ] State equation strengthened by 598 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 2.0)
(s36 2.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 2.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 2.0)
(s110 1.0)
(s111 1.0)
(s112 2.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 205/1380 variables, and 0 constraints, problems are : Problem set: 0 solved, 5137 unsolved in 20106 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/208 constraints, ReadFeed: 0/598 constraints, PredecessorRefiner: 5137/5137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 205/1380 variables, and 0 constraints, problems are : Problem set: 0 solved, 5137 unsolved in 20074 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/208 constraints, ReadFeed: 0/598 constraints, PredecessorRefiner: 0/5137 constraints, Known Traps: 0/0 constraints]
After SMT, in 57168ms problems are : Problem set: 0 solved, 5137 unsolved
Search for dead transitions found 0 dead transitions in 57252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62489 ms. Remains : 208/324 places, 5710/20614 transitions.
[2024-05-28 06:02:19] [INFO ] Flow matrix only has 1172 transitions (discarded 4538 similar events)
Found an invariant !
This invariant on transitions {572=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=5 ) properties (out of 16) seen :[0, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 0, 0, 2147483647, 2147483647, 2147483647, 2147483647, 1, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, +inf, +inf, +inf, +inf, +inf, 0, 0, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
[2024-05-28 06:02:21] [INFO ] Flow matrix only has 1172 transitions (discarded 4538 similar events)
[2024-05-28 06:02:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, +inf, +inf, +inf, +inf, +inf, 0, 0, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 801313 steps (2 resets) in 30001 ms. (26 steps per ms)
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 5577 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 244, 0] Max Struct:[+inf, +inf, +inf]
[2024-05-28 06:02:57] [INFO ] Flow matrix only has 1172 transitions (discarded 4538 similar events)
[2024-05-28 06:02:57] [INFO ] Invariant cache hit.
[2024-05-28 06:02:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:02:57] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-28 06:02:57] [INFO ] State equation strengthened by 598 read => feed constraints.
[2024-05-28 06:02:57] [INFO ] [Real]Added 598 Read/Feed constraints in 292 ms returned sat
[2024-05-28 06:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:02:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:02:57] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-28 06:02:58] [INFO ] [Nat]Added 598 Read/Feed constraints in 288 ms returned sat
[2024-05-28 06:02:58] [INFO ] Computed and/alt/rep : 51/58/42 causal constraints (skipped 557 transitions) in 225 ms.
[2024-05-28 06:02:58] [INFO ] Added : 5 causal constraints over 1 iterations in 355 ms. Result :sat
Minimization took 340 ms.
[2024-05-28 06:02:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:02:59] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-28 06:02:59] [INFO ] [Real]Added 598 Read/Feed constraints in 286 ms returned sat
[2024-05-28 06:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:02:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:02:59] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-28 06:02:59] [INFO ] [Nat]Added 598 Read/Feed constraints in 288 ms returned sat
[2024-05-28 06:03:00] [INFO ] Computed and/alt/rep : 51/58/42 causal constraints (skipped 557 transitions) in 223 ms.
[2024-05-28 06:03:00] [INFO ] Added : 3 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 320 ms.
[2024-05-28 06:03:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:03:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-28 06:03:01] [INFO ] [Real]Added 598 Read/Feed constraints in 289 ms returned sat
[2024-05-28 06:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:03:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:03:01] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-28 06:03:01] [INFO ] [Nat]Added 598 Read/Feed constraints in 281 ms returned sat
[2024-05-28 06:03:01] [INFO ] Computed and/alt/rep : 51/58/42 causal constraints (skipped 557 transitions) in 226 ms.
[2024-05-28 06:03:01] [INFO ] Added : 4 causal constraints over 1 iterations in 343 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 244, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 246, 1] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 5710/5710 transitions.
Graph (complete) has 1738 edges and 208 vertex of which 16 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.3 ms
Discarding 192 places :
Also discarding 5123 output transitions
Drop transitions (Output transitions of discarded places.) removed 5123 transitions
Drop transitions (Empty/Sink Transition effects.) removed 572 transitions
Reduce isomorphic transitions removed 572 transitions.
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 574 place count 15 transition count 15
Applied a total of 574 rules in 10 ms. Remains 15 /208 variables (removed 193) and now considering 15/5710 (removed 5695) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 15/208 places, 15/5710 transitions.
Found an invariant !
This invariant on transitions {5=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :[2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 15 rows 15 cols
[2024-05-28 06:03:03] [INFO ] Computed 0 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 846 ms. (1180 steps per ms)
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 194756 ms.
ITS solved all properties within timeout
BK_STOP 1716876184162
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="SemanticWebServices-PT-S256P15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SemanticWebServices-PT-S256P15, 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 r333-tall-171679078800597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S256P15.tgz
mv SemanticWebServices-PT-S256P15 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;