About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 478.168 | 30914.00 | 58422.00 | 222.60 | 1 1 0 0 3 0 1 0 0 0 0 0 0 0 0 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-171683810600013.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-d0m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K 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 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 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 57K 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-d0m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716876734620
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-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 06:12:17] [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 06:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:12:17] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-28 06:12:17] [INFO ] Transformed 262 places.
[2024-05-28 06:12:17] [INFO ] Transformed 73 transitions.
[2024-05-28 06:12:17] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 06:12:17] [INFO ] Computed 6 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 7, 43, 1]
RANDOM walk for 10000 steps (2268 resets) in 85 ms. (116 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (2163 resets) in 78 ms. (253 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 43]
[2024-05-28 06:12:17] [INFO ] Invariant cache hit.
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-28 06:12:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:12:18] [INFO ] [Real]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-05-28 06:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Nat]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:12:18] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 29 ms.
[2024-05-28 06:12:18] [INFO ] Added : 6 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 35 ms.
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-28 06:12:18] [INFO ] [Real]Added 31 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 06:12:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 06:12:19] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-28 06:12:19] [INFO ] [Nat]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:12:19] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 20 ms.
[2024-05-28 06:12:19] [INFO ] Added : 6 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[7, 43]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 43]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 60 transition count 62
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 58 transition count 59
Applied a total of 26 rules in 91 ms. Remains 58 /72 variables (removed 14) and now considering 59/73 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-05-28 06:12:19] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[7, 6]
RANDOM walk for 1000000 steps (223813 resets) in 1220 ms. (819 steps per ms)
BEST_FIRST walk for 2000001 steps (206098 resets) in 1087 ms. (1838 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 6]
[2024-05-28 06:12:21] [INFO ] Invariant cache hit.
[2024-05-28 06:12:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:21] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-28 06:12:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:21] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Added 23 Read/Feed constraints in 12 ms returned sat
[2024-05-28 06:12:22] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-28 06:12:22] [INFO ] Added : 10 causal constraints over 2 iterations in 51 ms. Result :sat
Minimization took 41 ms.
[2024-05-28 06:12:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:12:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-28 06:12:22] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:12:22] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-28 06:12:22] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 23 ms to minimize.
[2024-05-28 06:12:22] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-28 06:12:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2024-05-28 06:12:22] [INFO ] Added : 12 causal constraints over 4 iterations in 353 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 6]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 14 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:22] [INFO ] Invariant cache hit.
[2024-05-28 06:12:23] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 06:12:23] [INFO ] Invariant cache hit.
[2024-05-28 06:12:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:23] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-28 06:12:23] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:23] [INFO ] Invariant cache hit.
[2024-05-28 06:12:23] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 4874ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5276 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8929 resets) in 1205 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4233 resets) in 440 ms. (90 steps per ms) remains 4/4 properties
[2024-05-28 06:12:28] [INFO ] Flatten gal took : 73 ms
[2024-05-28 06:12:28] [INFO ] Flatten gal took : 50 ms
BEST_FIRST walk for 40003 steps (4131 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
[2024-05-28 06:12:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10238019871677028028.gal : 12 ms
[2024-05-28 06:12:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15350007777334866688.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/ReachabilityCardinality10238019871677028028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15350007777334866688.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (4166 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
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/ReachabilityCardinality15350007777334866688.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 37
BEST_FIRST walk for 40003 steps (4112 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :37 after 91
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :91 after 201
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :201 after 374
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :374 after 1557
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1557 after 2397
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2397 after 4501
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4501 after 11173
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,19185,0.205833,8220,2,1693,16,17406,8,0,295,11740,0
Total reachable state count : 19185
Verifying 4 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.208222,8220,1,0,16,17406,8,0,296,11740,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,1068,0.209166,8480,2,332,16,17406,9,0,298,11740,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.209566,8480,1,0,16,17406,9,0,298,11740,0
Invariant property MIN1 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
MIN1,842,0.210356,8480,2,648,16,17406,10,0,300,11740,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 19185 states, properties seen :2
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 444 ms. (steps per millisecond=109 ) properties seen :2
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 207 ms. (steps per millisecond=235 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[7, 6]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-01
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:12:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2244 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1010 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:12:29] [INFO ] Invariant cache hit.
[2024-05-28 06:12:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 06:12:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-28 06:12:29] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 06:12:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:29] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:12:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 06:12:29] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:12:29] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-05-28 06:12:29] [INFO ] Added : 10 causal constraints over 2 iterations in 44 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 58/58 places, 59/59 transitions.
[2024-05-28 06:12:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223645 resets) in 1090 ms. (916 steps per ms)
BEST_FIRST walk for 1000000 steps (102868 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:12:31] [INFO ] Invariant cache hit.
[2024-05-28 06:12:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:12:31] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-28 06:12:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:31] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 06:12:31] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:12:31] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 8 ms.
[2024-05-28 06:12:31] [INFO ] Added : 10 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:31] [INFO ] Invariant cache hit.
[2024-05-28 06:12:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 06:12:31] [INFO ] Invariant cache hit.
[2024-05-28 06:12:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:32] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-28 06:12:32] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:32] [INFO ] Invariant cache hit.
[2024-05-28 06:12:32] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 4921ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5264 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8965 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4199 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2024-05-28 06:12:37] [INFO ] Flatten gal took : 39 ms
BEST_FIRST walk for 40003 steps (4195 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-05-28 06:12:37] [INFO ] Flatten gal took : 25 ms
[2024-05-28 06:12:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17377396673204013230.gal : 7 ms
[2024-05-28 06:12:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2254514913599086187.prop : 0 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/ReachabilityCardinality17377396673204013230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2254514913599086187.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 ...329
Loading property file /tmp/ReachabilityCardinality2254514913599086187.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 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 91
SDD proceeding with computation,2 properties remain. new max is 32
Probably explored full state space saw : 19185 states, properties seen :1
SDD size :91 after 201
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 83 ms. (steps per millisecond=586 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :201 after 374
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :374 after 1557
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 54 ms. (steps per millisecond=901 ) properties seen :0
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1557 after 2397
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 in 7628 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-28 06:12:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2264 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (1080 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-28 06:12:37] [INFO ] Invariant cache hit.
[2024-05-28 06:12:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:37] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-28 06:12:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:37] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:37] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 06:12:37] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:12:37] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-28 06:12:37] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-28 06:12:37] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:12:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-28 06:12:37] [INFO ] Added : 12 causal constraints over 4 iterations in 186 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 58/58 places, 59/59 transitions.
[2024-05-28 06:12:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (223298 resets) in 1026 ms. (973 steps per ms)
BEST_FIRST walk for 1000001 steps (103294 resets) in 399 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-28 06:12:39] [INFO ] Invariant cache hit.
[2024-05-28 06:12:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 06:12:39] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 06:12:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:39] [INFO ] [Real]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:39] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-28 06:12:39] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:39] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-05-28 06:12:39] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:12:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-05-28 06:12:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-28 06:12:39] [INFO ] Added : 12 causal constraints over 4 iterations in 184 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:39] [INFO ] Invariant cache hit.
[2024-05-28 06:12:39] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 06:12:39] [INFO ] Invariant cache hit.
[2024-05-28 06:12:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-28 06:12:39] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:39] [INFO ] Invariant cache hit.
[2024-05-28 06:12:39] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 4771ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5057 ms. Remains : 58/58 places, 59/59 transitions.
[2024-05-28 06:12:44] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 40000 steps (8984 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2024-05-28 06:12:44] [INFO ] Flatten gal took : 16 ms
[2024-05-28 06:12:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3821971342873288759.gal : 8 ms
[2024-05-28 06:12:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16181748349717724370.prop : 0 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/ReachabilityCardinality3821971342873288759.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16181748349717724370.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3990 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
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 ...329
Loading property file /tmp/ReachabilityCardinality16181748349717724370.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 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 91
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :91 after 201
BEST_FIRST walk for 40002 steps (4132 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :201 after 374
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :374 after 1557
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1557 after 2397
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2397 after 4501
Probably explored full state space saw : 19185 states, properties seen :1
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 79 ms. (steps per millisecond=616 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4501 after 11173
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 48 ms. (steps per millisecond=1014 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 in 7646 ms.
[2024-05-28 06:12:44] [INFO ] Flatten gal took : 14 ms
[2024-05-28 06:12:44] [INFO ] Applying decomposition
[2024-05-28 06:12:44] [INFO ] Flatten gal took : 12 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/graph10129145885687288973.txt' '-o' '/tmp/graph10129145885687288973.bin' '-w' '/tmp/graph10129145885687288973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10129145885687288973.bin' '-l' '-1' '-v' '-w' '/tmp/graph10129145885687288973.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:12:45] [INFO ] Decomposing Gal with order
[2024-05-28 06:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:12:45] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-28 06:12:45] [INFO ] Flatten gal took : 113 ms
[2024-05-28 06:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 14 ms.
[2024-05-28 06:12:45] [INFO ] Time to serialize gal into /tmp/UpperBounds6891444113899596564.gal : 7 ms
[2024-05-28 06:12:45] [INFO ] Time to serialize properties into /tmp/UpperBounds7919333099444621703.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/UpperBounds6891444113899596564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7919333099444621703.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 ...283
Loading property file /tmp/UpperBounds7919333099444621703.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,19185,0.116031,6324,397,152,4611,719,215,7597,66,2482,0
Total reachable state count : 19185
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 :0 <= i0.u8.p21 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 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-d0m06-UpperBounds-01,0,0.130179,6324,1,0,4611,719,290,7597,88,2863,297
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 :0 <= i0.u8.l235 <= 3
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 3 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-d0m06-UpperBounds-04,0,0.132974,6324,1,0,4611,742,307,7597,99,3340,367
Total runtime 28419 ms.
BK_STOP 1716876765534
--------------------
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-d0m06"
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-d0m06, 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-171683810600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 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 ;