About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 470.104 | 28777.00 | 54087.00 | 400.90 | TTFT?TTFTFTTFFTF | 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.r532-smll-171683810700086.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m64, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700086
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717245227973
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:33:51] [INFO ] Load time of PNML (sax parser for PT used): 429 ms
[2024-06-01 12:33:51] [INFO ] Transformed 1295 places.
[2024-06-01 12:33:51] [INFO ] Transformed 749 transitions.
[2024-06-01 12:33:51] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 680 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 22 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8882 resets) in 4343 ms. (9 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3935 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3829 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3856 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3855 resets) in 328 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3954 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 298097 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 5
Probabilistic random walk after 298097 steps, saw 136825 distinct states, run finished after 3010 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:33:56] [INFO ] Computed 6 invariants in 47 ms
[2024-06-01 12:33:56] [INFO ] State equation strengthened by 587 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-00 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-01 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-10 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 116/122 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/129 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 130/259 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 12:33:57] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 18 ms to minimize.
[2024-06-01 12:33:57] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 5 ms to minimize.
[2024-06-01 12:33:57] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 4 ms to minimize.
[2024-06-01 12:33:57] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 4 ms to minimize.
[2024-06-01 12:33:58] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 5/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 749/1008 variables, 259/270 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 587/857 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 0/857 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1008 variables, 0/857 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 857 constraints, problems are : Problem set: 4 solved, 1 unsolved in 2440 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/82 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/162 variables, 3/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/259 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 5/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 12:33:59] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 749/1008 variables, 259/271 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 587/858 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 1/859 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 859 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 4305ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 2180 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 416 place count 135 transition count 179
Iterating global reduction 2 with 45 rules applied. Total rules applied 461 place count 135 transition count 179
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 477 place count 135 transition count 163
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 503 place count 109 transition count 135
Iterating global reduction 3 with 26 rules applied. Total rules applied 529 place count 109 transition count 135
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 544 place count 109 transition count 120
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 551 place count 102 transition count 110
Iterating global reduction 4 with 7 rules applied. Total rules applied 558 place count 102 transition count 110
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 565 place count 95 transition count 103
Iterating global reduction 4 with 7 rules applied. Total rules applied 572 place count 95 transition count 103
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 576 place count 91 transition count 98
Iterating global reduction 4 with 4 rules applied. Total rules applied 580 place count 91 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 581 place count 91 transition count 97
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 585 place count 87 transition count 93
Iterating global reduction 5 with 4 rules applied. Total rules applied 589 place count 87 transition count 93
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 592 place count 84 transition count 90
Iterating global reduction 5 with 3 rules applied. Total rules applied 595 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 596 place count 83 transition count 88
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 598 place count 82 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 600 place count 81 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 81 transition count 86
Applied a total of 601 rules in 139 ms. Remains 81 /259 variables (removed 178) and now considering 86/749 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 81/259 places, 86/749 transitions.
RANDOM walk for 40000 steps (8942 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4152 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2727620 steps, run timeout after 3001 ms. (steps per millisecond=908 ) properties seen :0 out of 1
Probabilistic random walk after 2727620 steps, saw 1110849 distinct states, run finished after 3001 ms. (steps per millisecond=908 ) properties seen :0
// Phase 1: matrix 86 rows 81 cols
[2024-06-01 12:34:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:34:05] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/167 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 316 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-01 12:34:06] [INFO ] Invariant cache hit.
[2024-06-01 12:34:06] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 12:34:06] [INFO ] Invariant cache hit.
[2024-06-01 12:34:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 12:34:07] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-06-01 12:34:07] [INFO ] Redundant transitions in 3 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 12:34:07] [INFO ] Invariant cache hit.
[2024-06-01 12:34:07] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3452 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4740 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 8415ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8919 ms. Remains : 81/81 places, 86/86 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 79
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 76 transition count 79
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 76 transition count 66
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 63 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 57 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 57 transition count 60
Applied a total of 51 rules in 20 ms. Remains 57 /81 variables (removed 24) and now considering 60/86 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 57 cols
[2024-06-01 12:34:15] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 12:34:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 12:34:15] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 11 ms returned sat
[2024-06-01 12:34:15] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:34:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 12:34:15] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:34:15] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
TRAPS : Iteration 1
[2024-06-01 12:34:15] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:34:15] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 433 ms.
[2024-06-01 12:34:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 14 ms.
[2024-06-01 12:34:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 86 transitions and 342 arcs took 9 ms.
[2024-06-01 12:34:16] [INFO ] Flatten gal took : 72 ms
Total runtime 25892 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-04
BK_STOP 1717245256750
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/570/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-d1m64"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m64, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;