About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d2m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 630.712 | 88036.00 | 119301.00 | 493.30 | TTTFFFFFFTTFFFTF | 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-171683810800131.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-d2m64, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800131
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 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 1.1M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717249883246
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:51:25] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-06-01 13:51:25] [INFO ] Transformed 2398 places.
[2024-06-01 13:51:25] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:51:25] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 972 place count 270 transition count 374
Iterating global reduction 1 with 119 rules applied. Total rules applied 1091 place count 270 transition count 374
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1101 place count 270 transition count 364
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1192 place count 179 transition count 273
Iterating global reduction 2 with 91 rules applied. Total rules applied 1283 place count 179 transition count 273
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1318 place count 179 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1355 place count 142 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1392 place count 142 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1414 place count 142 transition count 166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1422 place count 134 transition count 153
Iterating global reduction 4 with 8 rules applied. Total rules applied 1430 place count 134 transition count 153
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1438 place count 126 transition count 145
Iterating global reduction 4 with 8 rules applied. Total rules applied 1446 place count 126 transition count 145
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1451 place count 121 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 1456 place count 121 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1457 place count 121 transition count 138
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1462 place count 116 transition count 133
Iterating global reduction 5 with 5 rules applied. Total rules applied 1467 place count 116 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1471 place count 112 transition count 129
Iterating global reduction 5 with 4 rules applied. Total rules applied 1475 place count 112 transition count 129
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1477 place count 110 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 1479 place count 110 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1480 place count 109 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1481 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1482 place count 108 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 1483 place count 108 transition count 123
Applied a total of 1483 rules in 151 ms. Remains 108 /414 variables (removed 306) and now considering 123/1954 (removed 1831) transitions.
// Phase 1: matrix 123 rows 108 cols
[2024-06-01 13:51:25] [INFO ] Computed 5 invariants in 20 ms
[2024-06-01 13:51:26] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 13:51:26] [INFO ] Invariant cache hit.
[2024-06-01 13:51:26] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:51:26] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 13:51:26] [INFO ] Invariant cache hit.
[2024-06-01 13:51:26] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 19 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/231 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 47/162 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 162 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5803 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/231 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 47/162 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 122/284 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 13:51:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 1/285 constraints. Problems are: Problem set: 3 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 285 constraints, problems are : Problem set: 3 solved, 119 unsolved in 12198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 constraints]
After SMT, in 18398ms problems are : Problem set: 3 solved, 119 unsolved
Search for dead transitions found 3 dead transitions in 18417ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/414 places, 120/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 120
Applied a total of 3 rules in 4 ms. Remains 105 /108 variables (removed 3) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 105 cols
[2024-06-01 13:51:45] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 13:51:45] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 13:51:45] [INFO ] Invariant cache hit.
[2024-06-01 13:51:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 13:51:45] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/414 places, 120/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19915 ms. Remains : 105/414 places, 120/1954 transitions.
Support contains 3 out of 105 places after structural reductions.
[2024-06-01 13:51:45] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:51:45] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:51:46] [INFO ] Input system was already deterministic with 120 transitions.
RANDOM walk for 40000 steps (9014 resets) in 1534 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4205 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4228 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4076 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2236355 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :2 out of 3
Probabilistic random walk after 2236355 steps, saw 1046752 distinct states, run finished after 3013 ms. (steps per millisecond=742 ) properties seen :2
[2024-06-01 13:51:49] [INFO ] Invariant cache hit.
[2024-06-01 13:51:49] [INFO ] State equation strengthened by 46 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/136 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/158 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 225/225 variables, and 112 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 3/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 334 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 102 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 101 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 101 transition count 114
Applied a total of 9 rules in 46 ms. Remains 101 /105 variables (removed 4) and now considering 114/120 (removed 6) transitions.
// Phase 1: matrix 114 rows 101 cols
[2024-06-01 13:51:50] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 13:51:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 13:51:50] [INFO ] Invariant cache hit.
[2024-06-01 13:51:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:51:50] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-06-01 13:51:50] [INFO ] Redundant transitions in 4 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-01 13:51:50] [INFO ] Invariant cache hit.
[2024-06-01 13:51:50] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 5 (OVERLAPS) 114/215 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 149 constraints, problems are : Problem set: 3 solved, 110 unsolved in 4835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/214 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 93/259 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 259 constraints, problems are : Problem set: 3 solved, 110 unsolved in 10440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 110/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 15470ms problems are : Problem set: 3 solved, 110 unsolved
Search for dead transitions found 3 dead transitions in 15473ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/105 places, 111/120 transitions.
Graph (complete) has 312 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 98 /101 variables (removed 3) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-06-01 13:52:06] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 13:52:06] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 13:52:06] [INFO ] Invariant cache hit.
[2024-06-01 13:52:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:52:06] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/105 places, 111/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16644 ms. Remains : 98/105 places, 111/120 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08
Product exploration explored 100000 steps with 22405 reset in 346 ms.
Product exploration explored 100000 steps with 22418 reset in 262 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 310 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8902 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4110 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3058 steps, run visited all 1 properties in 14 ms. (steps per millisecond=218 )
Probabilistic random walk after 3058 steps, saw 1537 distinct states, run finished after 21 ms. (steps per millisecond=145 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 13:52:08] [INFO ] Invariant cache hit.
[2024-06-01 13:52:08] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 13:52:08] [INFO ] Invariant cache hit.
[2024-06-01 13:52:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:52:08] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-01 13:52:08] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 13:52:08] [INFO ] Invariant cache hit.
[2024-06-01 13:52:08] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 11353ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 11355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11724 ms. Remains : 98/98 places, 111/111 transitions.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 310 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8997 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4044 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3058 steps, run visited all 1 properties in 33 ms. (steps per millisecond=92 )
Probabilistic random walk after 3058 steps, saw 1537 distinct states, run finished after 33 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22440 reset in 211 ms.
Product exploration explored 100000 steps with 22486 reset in 225 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 12 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 13:52:21] [INFO ] Invariant cache hit.
[2024-06-01 13:52:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 13:52:21] [INFO ] Invariant cache hit.
[2024-06-01 13:52:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:52:21] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-01 13:52:22] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 13:52:22] [INFO ] Invariant cache hit.
[2024-06-01 13:52:22] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 13092ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 13096ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13657 ms. Remains : 98/98 places, 111/111 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08 finished in 45117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 103 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 103 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 102 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 101 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 101 transition count 113
Applied a total of 10 rules in 29 ms. Remains 101 /105 variables (removed 4) and now considering 113/120 (removed 7) transitions.
// Phase 1: matrix 113 rows 101 cols
[2024-06-01 13:52:35] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 13:52:35] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 13:52:35] [INFO ] Invariant cache hit.
[2024-06-01 13:52:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:52:35] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-06-01 13:52:35] [INFO ] Redundant transitions in 6 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 13:52:35] [INFO ] Invariant cache hit.
[2024-06-01 13:52:35] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/214 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 149 constraints, problems are : Problem set: 3 solved, 109 unsolved in 4748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 1/214 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 92/258 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/214 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 258 constraints, problems are : Problem set: 3 solved, 109 unsolved in 8828 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 109/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 13760ms problems are : Problem set: 3 solved, 109 unsolved
Search for dead transitions found 3 dead transitions in 13762ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/105 places, 110/120 transitions.
Graph (complete) has 311 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 98 /101 variables (removed 3) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 98 cols
[2024-06-01 13:52:49] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:52:49] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 13:52:49] [INFO ] Invariant cache hit.
[2024-06-01 13:52:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:52:50] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/105 places, 110/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15000 ms. Remains : 98/105 places, 110/120 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13 finished in 15196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 13:52:50] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:52:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:52:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 120 transitions and 476 arcs took 10 ms.
Total runtime 85905 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717249971282
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08
ltl formula formula --ltl=/tmp/740/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 105 places, 120 transitions and 476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/740/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/740/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/740/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/740/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 107 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 106, there are 123 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~60!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 970
pnml2lts-mc( 0/ 4): unique states count: 1124
pnml2lts-mc( 0/ 4): unique transitions count: 2437
pnml2lts-mc( 0/ 4): - self-loop count: 870
pnml2lts-mc( 0/ 4): - claim dead count: 140
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1213
pnml2lts-mc( 0/ 4): - cum. max stack depth: 235
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1213 states 2783 transitions, fanout: 2.294
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 60650, Transitions per second: 139150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.7 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 120 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
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-d2m64"
export BK_EXAMINATION="LTLCardinality"
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-d2m64, examination is LTLCardinality"
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-171683810800131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;