About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d2m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 671.436 | 67761.00 | 102178.00 | 297.80 | 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 | normal |
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.r377-smll-171683809700101.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 SieveSingleMsgMbox-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 19:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716912904341
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:15:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 16:15:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:15:06] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2024-05-28 16:15:06] [INFO ] Transformed 2398 places.
[2024-05-28 16:15:06] [INFO ] Transformed 1954 transitions.
[2024-05-28 16:15:07] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 95 ms.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 16:15:07] [INFO ] Computed 6 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 10000 steps (2230 resets) in 475 ms. (21 steps per ms)
BEST_FIRST walk for 30001 steps (2757 resets) in 269 ms. (111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 16:15:08] [INFO ] Invariant cache hit.
[2024-05-28 16:15:08] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-28 16:15:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 25 ms returned sat
[2024-05-28 16:15:09] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-28 16:15:09] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 16:15:10] [INFO ] [Real]Added 1674 Read/Feed constraints in 535 ms returned sat
[2024-05-28 16:15:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 16:15:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 16:15:10] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-28 16:15:11] [INFO ] [Nat]Added 1674 Read/Feed constraints in 596 ms returned sat
[2024-05-28 16:15:12] [INFO ] Deduced a trap composed of 30 places in 570 ms of which 70 ms to minimize.
[2024-05-28 16:15:12] [INFO ] Deduced a trap composed of 30 places in 500 ms of which 7 ms to minimize.
[2024-05-28 16:15:13] [INFO ] Deduced a trap composed of 118 places in 201 ms of which 4 ms to minimize.
[2024-05-28 16:15:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1854 ms
[2024-05-28 16:15:14] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 672 ms.
[2024-05-28 16:15:15] [INFO ] Added : 17 causal constraints over 4 iterations in 1858 ms. Result :unknown
[2024-05-28 16:15:15] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 16:15:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 16:15:15] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-28 16:15:16] [INFO ] [Real]Added 1674 Read/Feed constraints in 544 ms returned sat
[2024-05-28 16:15:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 16:15:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 16:15:17] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-28 16:15:17] [INFO ] [Nat]Added 1674 Read/Feed constraints in 510 ms returned sat
[2024-05-28 16:15:18] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 357 ms.
[2024-05-28 16:15:18] [INFO ] Added : 7 causal constraints over 2 iterations in 1012 ms. Result :sat
Minimization took 562 ms.
[2024-05-28 16:15:19] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 16:15:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 16:15:20] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-28 16:15:20] [INFO ] [Real]Added 1674 Read/Feed constraints in 499 ms returned sat
[2024-05-28 16:15:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 16:15:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 16:15:21] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-05-28 16:15:22] [INFO ] [Nat]Added 1674 Read/Feed constraints in 609 ms returned sat
[2024-05-28 16:15:22] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 321 ms.
[2024-05-28 16:15:23] [INFO ] Added : 5 causal constraints over 1 iterations in 996 ms. Result :sat
Minimization took 559 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.12 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1170 place count 178 transition count 271
Iterating global reduction 2 with 91 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1295 place count 178 transition count 237
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1334 place count 139 transition count 183
Iterating global reduction 3 with 39 rules applied. Total rules applied 1373 place count 139 transition count 183
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1397 place count 139 transition count 159
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1406 place count 130 transition count 146
Iterating global reduction 4 with 9 rules applied. Total rules applied 1415 place count 130 transition count 146
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1424 place count 121 transition count 137
Iterating global reduction 4 with 9 rules applied. Total rules applied 1433 place count 121 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1438 place count 116 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 1443 place count 116 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1445 place count 116 transition count 129
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1450 place count 111 transition count 124
Iterating global reduction 5 with 5 rules applied. Total rules applied 1455 place count 111 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1458 place count 108 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 1461 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 107 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 107 transition count 120
Applied a total of 1463 rules in 280 ms. Remains 107 /414 variables (removed 307) and now considering 120/1954 (removed 1834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 107/414 places, 120/1954 transitions.
// Phase 1: matrix 120 rows 107 cols
[2024-05-28 16:15:24] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224257 resets) in 1271 ms. (786 steps per ms)
BEST_FIRST walk for 3000002 steps (310050 resets) in 1797 ms. (1668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 16:15:27] [INFO ] Invariant cache hit.
[2024-05-28 16:15:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:15:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:27] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 16:15:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 16:15:27] [INFO ] [Real]Added 45 Read/Feed constraints in 25 ms returned sat
[2024-05-28 16:15:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 16:15:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:27] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-28 16:15:27] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 322 ms
[2024-05-28 16:15:27] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 20 ms.
[2024-05-28 16:15:28] [INFO ] Added : 16 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 68 ms.
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-05-28 16:15:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-05-28 16:15:28] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-28 16:15:28] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 12 ms.
[2024-05-28 16:15:28] [INFO ] Added : 15 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 60 ms.
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-05-28 16:15:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-28 16:15:28] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-05-28 16:15:28] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-28 16:15:28] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-28 16:15:28] [INFO ] Added : 15 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 120/120 transitions.
Applied a total of 0 rules in 12 ms. Remains 107 /107 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 107/107 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 16:15:29] [INFO ] Invariant cache hit.
[2024-05-28 16:15:29] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 16:15:29] [INFO ] Invariant cache hit.
[2024-05-28 16:15:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 16:15:29] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-28 16:15:29] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 16:15:29] [INFO ] Invariant cache hit.
[2024-05-28 16:15:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 16:15:31] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:15:31] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/227 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 159 constraints, problems are : Problem set: 3 solved, 116 unsolved in 9277 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 120/227 variables, 107/114 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 45/159 constraints. Problems are: Problem set: 3 solved, 116 unsolved
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 116/275 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-28 16:15:42] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:15:43] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 2/277 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 277 constraints, problems are : Problem set: 15 solved, 104 unsolved in 14324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 116/119 constraints, Known Traps: 5/5 constraints]
After SMT, in 23967ms problems are : Problem set: 15 solved, 104 unsolved
Search for dead transitions found 15 dead transitions in 23983ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 105/120 transitions.
Graph (complete) has 258 edges and 107 vertex of which 79 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 15 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 74 transition count 78
Reduce places removed 10 places and 12 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 28 place count 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 63 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 63 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 62 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 61 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 60 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 60 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 60 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 38 rules in 18 ms. Remains 60 /107 variables (removed 47) and now considering 60/105 (removed 45) transitions.
// Phase 1: matrix 60 rows 60 cols
[2024-05-28 16:15:53] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 16:15:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 16:15:53] [INFO ] Invariant cache hit.
[2024-05-28 16:15:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 16:15:53] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/107 places, 60/120 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24632 ms. Remains : 60/107 places, 60/120 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 60 rows 59 cols
[2024-05-28 16:15:53] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224617 resets) in 941 ms. (1061 steps per ms)
BEST_FIRST walk for 2000001 steps (206610 resets) in 774 ms. (2580 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 16:15:55] [INFO ] Invariant cache hit.
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 16:15:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 16:15:55] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-28 16:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-28 16:15:55] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 44 transitions) in 5 ms.
[2024-05-28 16:15:55] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 19 ms.
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-28 16:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 16:15:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-28 16:15:55] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 44 transitions) in 5 ms.
[2024-05-28 16:15:55] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 58
Applied a total of 3 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 58/60 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 58/59 places, 58/60 transitions.
// Phase 1: matrix 58 rows 58 cols
[2024-05-28 16:15:55] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 1]
RANDOM walk for 1000000 steps (224434 resets) in 1052 ms. (949 steps per ms)
BEST_FIRST walk for 1000000 steps (103881 resets) in 392 ms. (2544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-05-28 16:15:57] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 16:15:57] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:15:57] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 16:15:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 16:15:57] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2024-05-28 16:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:57] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:57] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-28 16:15:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-28 16:15:57] [INFO ] Computed and/alt/rep : 15/26/15 causal constraints (skipped 42 transitions) in 8 ms.
[2024-05-28 16:15:57] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-28 16:15:57] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 16:15:57] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 16:15:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-28 16:15:57] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-28 16:15:57] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/116 variables, 58/61 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 20/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 81 constraints, problems are : Problem set: 3 solved, 54 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 58/115 variables, 57/60 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 20/80 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 7/87 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 47/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/116 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 135 constraints, problems are : Problem set: 3 solved, 54 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 4099ms problems are : Problem set: 3 solved, 54 unsolved
Search for dead transitions found 3 dead transitions in 4101ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 55/58 transitions.
Graph (complete) has 142 edges and 58 vertex of which 55 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 133 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 52 transition count 52
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 50 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 48 transition count 47
Reduce places removed 3 places and 3 transitions.
Graph (complete) has 107 edges and 45 vertex of which 43 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 13 place count 43 transition count 44
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 15 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 16 place count 41 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 17 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 18 place count 40 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 40 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 20 place count 39 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 39 transition count 39
Applied a total of 21 rules in 20 ms. Remains 39 /58 variables (removed 19) and now considering 39/55 (removed 16) transitions.
// Phase 1: matrix 39 rows 39 cols
[2024-05-28 16:16:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 16:16:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 16:16:01] [INFO ] Invariant cache hit.
[2024-05-28 16:16:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:02] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/58 places, 39/58 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4550 ms. Remains : 39/58 places, 39/58 transitions.
[2024-05-28 16:16:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 1]
RANDOM walk for 1000000 steps (224045 resets) in 633 ms. (1577 steps per ms)
BEST_FIRST walk for 1000001 steps (103038 resets) in 329 ms. (3030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-05-28 16:16:03] [INFO ] Invariant cache hit.
[2024-05-28 16:16:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:16:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 16:16:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:03] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-28 16:16:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:16:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:16:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 16:16:03] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-28 16:16:03] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 3 ms.
[2024-05-28 16:16:03] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/39 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-05-28 16:16:03] [INFO ] Invariant cache hit.
[2024-05-28 16:16:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 16:16:03] [INFO ] Invariant cache hit.
[2024-05-28 16:16:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:03] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-28 16:16:03] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-28 16:16:03] [INFO ] Invariant cache hit.
[2024-05-28 16:16:03] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 54 constraints, problems are : Problem set: 0 solved, 38 unsolved in 992 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 92 constraints, problems are : Problem set: 0 solved, 38 unsolved in 877 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2059 ms. Remains : 39/39 places, 39/39 transitions.
RANDOM walk for 40000 steps (9010 resets) in 840 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4113 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4167 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
Probably explored full state space saw : 407 states, properties seen :1
Probabilistic random walk after 950 steps, saw 407 distinct states, run finished after 22 ms. (steps per millisecond=43 ) properties seen :1
Explored full state space saw : 407 states, properties seen :0
Exhaustive walk after 950 steps, saw 407 distinct states, run finished after 5 ms. (steps per millisecond=190 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[12, 1]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
[2024-05-28 16:16:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2212 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (984 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 16:16:05] [INFO ] Invariant cache hit.
[2024-05-28 16:16:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 16:16:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 16:16:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:05] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-28 16:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:16:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 16:16:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-28 16:16:05] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-28 16:16:05] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-28 16:16:05] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/39 places, 39/39 transitions.
[2024-05-28 16:16:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224129 resets) in 1032 ms. (968 steps per ms)
BEST_FIRST walk for 1000001 steps (103782 resets) in 463 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 16:16:07] [INFO ] Invariant cache hit.
[2024-05-28 16:16:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:16:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 16:16:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:07] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-28 16:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:16:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:16:07] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 16:16:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-28 16:16:07] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 2 ms.
[2024-05-28 16:16:07] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/39 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-05-28 16:16:07] [INFO ] Invariant cache hit.
[2024-05-28 16:16:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 16:16:07] [INFO ] Invariant cache hit.
[2024-05-28 16:16:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 16:16:07] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-28 16:16:07] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-28 16:16:07] [INFO ] Invariant cache hit.
[2024-05-28 16:16:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 54 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 92 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1223 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 2373ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2580 ms. Remains : 39/39 places, 39/39 transitions.
RANDOM walk for 40000 steps (8947 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4128 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4135 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Probably explored full state space saw : 407 states, properties seen :1
Probabilistic random walk after 950 steps, saw 407 distinct states, run finished after 9 ms. (steps per millisecond=105 ) properties seen :1
Explored full state space saw : 407 states, properties seen :0
Exhaustive walk after 950 steps, saw 407 distinct states, run finished after 3 ms. (steps per millisecond=316 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 in 4615 ms.
[2024-05-28 16:16:10] [INFO ] Flatten gal took : 69 ms
[2024-05-28 16:16:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 19 ms.
[2024-05-28 16:16:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 39 transitions and 150 arcs took 6 ms.
Total runtime 64441 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SieveSingleMsgMbox-PT-d2m04
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 39
TRANSITIONS: 39
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 756
MODEL NAME: /home/mcc/execution/412/model
39 places, 39 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716912972102
--------------------
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="SieveSingleMsgMbox-PT-d2m04"
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 SieveSingleMsgMbox-PT-d2m04, 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 r377-smll-171683809700101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 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 ;