About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 749.048 | 66827.00 | 101220.00 | 319.00 | 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.r378-smll-171683810800101.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 itstools
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 r378-smll-171683810800101
=====================================================================
--------------------
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 1716929735235
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 20:55:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 20:55:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:55:38] [INFO ] Load time of PNML (sax parser for PT used): 489 ms
[2024-05-28 20:55:38] [INFO ] Transformed 2398 places.
[2024-05-28 20:55:38] [INFO ] Transformed 1954 transitions.
[2024-05-28 20:55:38] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 704 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 1984 places in 24 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 20:55:38] [INFO ] Computed 6 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 10000 steps (2171 resets) in 487 ms. (20 steps per ms)
BEST_FIRST walk for 30002 steps (2755 resets) in 242 ms. (123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 20:55:39] [INFO ] Invariant cache hit.
[2024-05-28 20:55:39] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-28 20:55:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 20:55:40] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2024-05-28 20:55:40] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 20:55:41] [INFO ] [Real]Added 1674 Read/Feed constraints in 914 ms returned sat
[2024-05-28 20:55:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:55:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-28 20:55:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 20:55:42] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-05-28 20:55:43] [INFO ] [Nat]Added 1674 Read/Feed constraints in 630 ms returned sat
[2024-05-28 20:55:43] [INFO ] Deduced a trap composed of 30 places in 447 ms of which 47 ms to minimize.
[2024-05-28 20:55:44] [INFO ] Deduced a trap composed of 30 places in 535 ms of which 8 ms to minimize.
[2024-05-28 20:55:45] [INFO ] Deduced a trap composed of 118 places in 212 ms of which 6 ms to minimize.
[2024-05-28 20:55:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1897 ms
[2024-05-28 20:55:45] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 635 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 20:55:46] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 20:55:46] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 20:55:47] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2024-05-28 20:55:48] [INFO ] [Real]Added 1674 Read/Feed constraints in 703 ms returned sat
[2024-05-28 20:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:55:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 20:55:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 20:55:49] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2024-05-28 20:55:49] [INFO ] [Nat]Added 1674 Read/Feed constraints in 571 ms returned sat
[2024-05-28 20:55:50] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 357 ms.
[2024-05-28 20:55:51] [INFO ] Added : 7 causal constraints over 2 iterations in 1254 ms. Result :sat
Minimization took 559 ms.
[2024-05-28 20:55:51] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 20:55:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 20:55:52] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-28 20:55:53] [INFO ] [Real]Added 1674 Read/Feed constraints in 592 ms returned sat
[2024-05-28 20:55:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 20:55:53] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 20:55:53] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-28 20:55:54] [INFO ] [Nat]Added 1674 Read/Feed constraints in 633 ms returned sat
[2024-05-28 20:55:54] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 250 ms.
[2024-05-28 20:55:56] [INFO ] Deduced a trap composed of 89 places in 589 ms of which 7 ms to minimize.
[2024-05-28 20:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 766 ms
[2024-05-28 20:55:56] [INFO ] Added : 7 causal constraints over 3 iterations in 1952 ms. Result :sat
Minimization took 543 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 253 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 277 ms. Remains : 107/414 places, 120/1954 transitions.
// Phase 1: matrix 120 rows 107 cols
[2024-05-28 20:55:57] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224238 resets) in 1401 ms. (713 steps per ms)
BEST_FIRST walk for 3000003 steps (309771 resets) in 1912 ms. (1568 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 20:56:00] [INFO ] Invariant cache hit.
[2024-05-28 20:56:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:56:00] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:00] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 20:56:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 20:56:00] [INFO ] [Real]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-05-28 20:56:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:56:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:00] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 20:56:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-05-28 20:56:01] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:56:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:56:01] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-28 20:56:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-28 20:56:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 352 ms
[2024-05-28 20:56:01] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 29 ms.
[2024-05-28 20:56:01] [INFO ] Added : 16 causal constraints over 4 iterations in 116 ms. Result :sat
Minimization took 80 ms.
[2024-05-28 20:56:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-05-28 20:56:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-28 20:56:01] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-05-28 20:56:01] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 20:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-28 20:56:01] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 20 ms.
[2024-05-28 20:56:02] [INFO ] Added : 15 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 91 ms.
[2024-05-28 20:56:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Real]Added 45 Read/Feed constraints in 15 ms returned sat
[2024-05-28 20:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 20:56:02] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-05-28 20:56:02] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 3 ms to minimize.
[2024-05-28 20:56:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-28 20:56:02] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 16 ms.
[2024-05-28 20:56:02] [INFO ] Added : 15 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 92 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 15 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 15 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 14 ms. Remains 107 /107 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 20:56:02] [INFO ] Invariant cache hit.
[2024-05-28 20:56:03] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-28 20:56:03] [INFO ] Invariant cache hit.
[2024-05-28 20:56:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 20:56:03] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-28 20:56:03] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 20:56:03] [INFO ] Invariant cache hit.
[2024-05-28 20:56:03] [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 20:56:06] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:56:06] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 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 20:56:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 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 9666 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 20:56:16] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
[2024-05-28 20:56:17] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 2 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 12616 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 22687ms problems are : Problem set: 15 solved, 104 unsolved
Search for dead transitions found 15 dead transitions in 22706ms
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.0 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 15 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 20:56:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:56:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 20:56:26] [INFO ] Invariant cache hit.
[2024-05-28 20:56:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 20:56:26] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 243 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 23605 ms. Remains : 60/107 places, 60/120 transitions.
Deduced a syphon composed of 1 places in 1 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 20:56:26] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224481 resets) in 751 ms. (1329 steps per ms)
BEST_FIRST walk for 2000001 steps (206827 resets) in 804 ms. (2484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 20:56:28] [INFO ] Invariant cache hit.
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:56:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 20:56:28] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2024-05-28 20:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2024-05-28 20:56:28] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 44 transitions) in 6 ms.
[2024-05-28 20:56:28] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-28 20:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-28 20:56:28] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-28 20:56:28] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 44 transitions) in 7 ms.
[2024-05-28 20:56:28] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 30 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 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-28 20:56:28] [INFO ] Invariant cache hit.
[2024-05-28 20:56:28] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 20:56:28] [INFO ] Invariant cache hit.
[2024-05-28 20:56:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 20:56:28] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-28 20:56:28] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 20:56:28] [INFO ] Invariant cache hit.
[2024-05-28 20:56:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/62 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 21/83 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 83 constraints, problems are : Problem set: 3 solved, 56 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/118 variables, 58/61 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 21/82 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 7/89 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/90 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 49/139 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/119 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 139 constraints, problems are : Problem set: 3 solved, 56 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3663ms problems are : Problem set: 3 solved, 56 unsolved
Search for dead transitions found 3 dead transitions in 3665ms
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 : 59/59 places, 57/60 transitions.
Graph (complete) has 146 edges and 59 vertex of which 56 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 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 137 edges and 55 vertex of which 53 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 54
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 51 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 49 transition count 49
Reduce places removed 3 places and 3 transitions.
Graph (complete) has 111 edges and 46 vertex of which 44 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 44 transition count 46
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 43 transition count 44
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 16 place count 42 transition count 43
Iterating global reduction 5 with 1 rules applied. Total rules applied 17 place count 42 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 18 place count 41 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 41 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 20 place count 40 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 40 transition count 41
Applied a total of 21 rules in 18 ms. Remains 40 /59 variables (removed 19) and now considering 41/57 (removed 16) transitions.
// Phase 1: matrix 41 rows 40 cols
[2024-05-28 20:56:32] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 20:56:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 20:56:32] [INFO ] Invariant cache hit.
[2024-05-28 20:56:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 20:56:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/59 places, 41/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4097 ms. Remains : 40/59 places, 41/60 transitions.
[2024-05-28 20:56:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224430 resets) in 858 ms. (1164 steps per ms)
BEST_FIRST walk for 2000000 steps (207218 resets) in 655 ms. (3048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-05-28 20:56:34] [INFO ] Invariant cache hit.
[2024-05-28 20:56:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 20:56:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 20:56:34] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-28 20:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2024-05-28 20:56:34] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 31 transitions) in 5 ms.
[2024-05-28 20:56:34] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 20:56:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-28 20:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 20:56:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2024-05-28 20:56:34] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 31 transitions) in 5 ms.
[2024-05-28 20:56:34] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 19 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 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-28 20:56:34] [INFO ] Invariant cache hit.
[2024-05-28 20:56:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 20:56:34] [INFO ] Invariant cache hit.
[2024-05-28 20:56:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 20:56:34] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 20:56:34] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-28 20:56:34] [INFO ] Invariant cache hit.
[2024-05-28 20:56:34] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 56 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1086 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1199 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 2309ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2464 ms. Remains : 40/40 places, 41/41 transitions.
RANDOM walk for 40000 steps (8928 resets) in 1282 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4161 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4090 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2024-05-28 20:56:37] [INFO ] Flatten gal took : 118 ms
BEST_FIRST walk for 40002 steps (4233 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
[2024-05-28 20:56:37] [INFO ] Flatten gal took : 44 ms
BEST_FIRST walk for 40002 steps (4099 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
Probably explored full state space saw : 441 states, properties seen :3
Probabilistic random walk after 1047 steps, saw 441 distinct states, run finished after 28 ms. (steps per millisecond=37 ) properties seen :3
Explored full state space saw : 441 states, properties seen :0
Exhaustive walk after 1047 steps, saw 441 distinct states, run finished after 4 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-28 20:56:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2096327150097090397.gal : 12 ms
[2024-05-28 20:56:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9439381170507211210.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2096327150097090397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9439381170507211210.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 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 20:56:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2233 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (1031 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 20:56:37] [INFO ] Invariant cache hit.
[2024-05-28 20:56:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:56:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 20:56:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 20:56:37] [INFO ] [Real]Added 15 Read/Feed constraints in 5 ms returned sat
[2024-05-28 20:56:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:37] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:37] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 20:56:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-28 20:56:37] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 31 transitions) in 5 ms.
[2024-05-28 20:56:37] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 16 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 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 41/41 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 40
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 39 transition count 39
Applied a total of 3 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 39/41 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/40 places, 39/41 transitions.
// Phase 1: matrix 39 rows 39 cols
[2024-05-28 20:56:38] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (223764 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 1000001 steps (103668 resets) in 327 ms. (3048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 20:56:38] [INFO ] Invariant cache hit.
[2024-05-28 20:56:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:38] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 20:56:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 20:56:39] [INFO ] [Real]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-28 20:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:56:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:56:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 20:56:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-28 20:56:39] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-28 20:56:39] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 18 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 3 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 20:56:39] [INFO ] Invariant cache hit.
[2024-05-28 20:56:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 20:56:39] [INFO ] Invariant cache hit.
[2024-05-28 20:56:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 20:56:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-28 20:56:39] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-28 20:56:39] [INFO ] Invariant cache hit.
[2024-05-28 20:56:39] [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 953 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 1173 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 2167ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2343 ms. Remains : 39/39 places, 39/39 transitions.
[2024-05-28 20:56:41] [INFO ] Flatten gal took : 21 ms
[2024-05-28 20:56:41] [INFO ] Flatten gal took : 25 ms
[2024-05-28 20:56:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18243693468003012602.gal : 4 ms
[2024-05-28 20:56:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10797942066648512674.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18243693468003012602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10797942066648512674.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10797942066648512674.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 17
RANDOM walk for 40000 steps (8935 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 39
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :39 after 63
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :63 after 137
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :161 after 237
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,407,0.026271,4132,2,430,12,1812,8,0,199,1353,0
Total reachable state count : 407
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.028683,4132,1,0,12,1812,8,0,200,1353,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,4,0.029033,4440,2,46,12,1812,8,0,201,1353,0
BEST_FIRST walk for 40003 steps (4031 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4143 resets) in 55 ms. (714 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 10 ms. (steps per millisecond=95 ) 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 2 ms. (steps per millisecond=475 ) 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 3870 ms.
[2024-05-28 20:56:41] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:56:41] [INFO ] Applying decomposition
[2024-05-28 20:56:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17172708915360272164.txt' '-o' '/tmp/graph17172708915360272164.bin' '-w' '/tmp/graph17172708915360272164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17172708915360272164.bin' '-l' '-1' '-v' '-w' '/tmp/graph17172708915360272164.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:56:41] [INFO ] Decomposing Gal with order
[2024-05-28 20:56:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:56:41] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-28 20:56:41] [INFO ] Flatten gal took : 64 ms
[2024-05-28 20:56:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2024-05-28 20:56:41] [INFO ] Time to serialize gal into /tmp/UpperBounds9322399318102107357.gal : 7 ms
[2024-05-28 20:56:41] [INFO ] Time to serialize properties into /tmp/UpperBounds957359037883657947.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9322399318102107357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds957359037883657947.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds957359037883657947.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,441,0.028039,4588,191,78,1785,313,146,3833,50,1528,0
Total reachable state count : 441
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 :0 <= u6.l190 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m04-UpperBounds-09,0,0.031081,4588,1,0,1785,313,216,3833,63,1528,286
Total runtime 64640 ms.
BK_STOP 1716929802062
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r378-smll-171683810800101"
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 ;