About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 622.615 | 71998.00 | 106594.00 | 488.10 | ??FFFT?FT??FT??T | 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-171683810600050.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-d1m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600050
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 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-d1m04-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717242747728
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:52:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:52:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:52:30] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2024-06-01 11:52:30] [INFO ] Transformed 1295 places.
[2024-06-01 11:52:30] [INFO ] Transformed 749 transitions.
[2024-06-01 11:52:30] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 206 ms.
Deduced a syphon composed of 1036 places in 19 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 59 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 291 place count 208 transition count 448
Iterating global reduction 1 with 34 rules applied. Total rules applied 325 place count 208 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 331 place count 208 transition count 442
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 345 place count 194 transition count 428
Iterating global reduction 2 with 14 rules applied. Total rules applied 359 place count 194 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 367 place count 194 transition count 420
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 374 place count 187 transition count 413
Iterating global reduction 3 with 7 rules applied. Total rules applied 381 place count 187 transition count 413
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 415 place count 187 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 416 place count 186 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 186 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 418 place count 185 transition count 376
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 185 transition count 376
Applied a total of 419 rules in 156 ms. Remains 185 /259 variables (removed 74) and now considering 376/749 (removed 373) transitions.
// Phase 1: matrix 376 rows 185 cols
[2024-06-01 11:52:31] [INFO ] Computed 5 invariants in 47 ms
[2024-06-01 11:52:32] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 11:52:32] [INFO ] Invariant cache hit.
[2024-06-01 11:52:32] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-06-01 11:52:33] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-01 11:52:33] [INFO ] Invariant cache hit.
[2024-06-01 11:52:33] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 11:52:39] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 27 ms to minimize.
[2024-06-01 11:52:39] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 11:52:40] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:52:40] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 11:52:47] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-01 11:52:47] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 3 ms to minimize.
[2024-06-01 11:52:47] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 3 ms to minimize.
[2024-06-01 11:52:47] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:52:47] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 9 (OVERLAPS) 376/561 variables, 185/202 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 246/448 constraints. Problems are: Problem set: 7 solved, 368 unsolved
[2024-06-01 11:53:03] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 1/449 constraints. Problems are: Problem set: 12 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 449 constraints, problems are : Problem set: 12 solved, 363 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 12 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/6 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 3/174 variables, 1/7 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 9/183 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 8/18 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 375/558 variables, 183/201 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 245/446 constraints. Problems are: Problem set: 12 solved, 363 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 46/492 constraints. Problems are: Problem set: 12 solved, 363 unsolved
[2024-06-01 11:53:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/493 constraints. Problems are: Problem set: 12 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/561 variables, and 493 constraints, problems are : Problem set: 12 solved, 363 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/185 constraints, ReadFeed: 245/246 constraints, PredecessorRefiner: 46/375 constraints, Known Traps: 14/14 constraints]
After SMT, in 61530ms problems are : Problem set: 12 solved, 363 unsolved
Search for dead transitions found 12 dead transitions in 61567ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/259 places, 364/749 transitions.
Reduce places removed 14 places and 11 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 353
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 349
Reduce places removed 0 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 347
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 24 places and 219 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 42 place count 144 transition count 128
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 51 place count 138 transition count 125
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 51 rules in 17 ms. Remains 138 /185 variables (removed 47) and now considering 125/364 (removed 239) transitions.
// Phase 1: matrix 125 rows 138 cols
[2024-06-01 11:53:34] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:53:34] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 11:53:34] [INFO ] Invariant cache hit.
[2024-06-01 11:53:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 11:53:35] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 138/259 places, 125/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63916 ms. Remains : 138/259 places, 125/749 transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Support contains 24 out of 110 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:53:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 11:53:35] [INFO ] Flatten gal took : 66 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:53:35] [INFO ] Flatten gal took : 29 ms
[2024-06-01 11:53:35] [INFO ] Input system was already deterministic with 125 transitions.
Support contains 13 out of 110 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (8877 resets) in 2865 ms. (13 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40001 steps (3889 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1795 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3932 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1851 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3956 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
// Phase 1: matrix 125 rows 110 cols
[2024-06-01 11:53:36] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 11:53:36] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 121/203 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 47/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (OVERLAPS) 32/235 variables, 28/159 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/235 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 163 constraints, problems are : Problem set: 1 solved, 5 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/75 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/80 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 121/201 variables, 80/82 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 47/129 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 34/235 variables, 30/159 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 5/168 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 168 constraints, problems are : Problem set: 2 solved, 4 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1022ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 2 properties in 352 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 290 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 123
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 93 transition count 110
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 93 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 93 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 87 transition count 98
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 87 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 87 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 83 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 83 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 80 transition count 87
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 80 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 77 transition count 84
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 77 transition count 84
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 70 place count 74 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 74 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 71 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 71 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 69 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 69 transition count 74
Applied a total of 83 rules in 70 ms. Remains 69 /110 variables (removed 41) and now considering 74/125 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 69/110 places, 74/125 transitions.
RANDOM walk for 40000 steps (8951 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1969 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1841 steps, run visited all 2 properties in 27 ms. (steps per millisecond=68 )
Probabilistic random walk after 1841 steps, saw 750 distinct states, run finished after 34 ms. (steps per millisecond=54 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 20 ms
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 22 ms
[2024-06-01 11:53:38] [INFO ] Input system was already deterministic with 125 transitions.
Computed a total of 110 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 90 transition count 106
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 90 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 90 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 82 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 82 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 82 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 76 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 76 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 76 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 73 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 73 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 85 place count 70 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 70 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 67 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 97 place count 64 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 64 transition count 64
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 61 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 61 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 60 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 59 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 59 transition count 58
Applied a total of 111 rules in 23 ms. Remains 59 /110 variables (removed 51) and now considering 58/125 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 59/110 places, 58/125 transitions.
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:53:38] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 328 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 90 transition count 106
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 90 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 90 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 82 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 82 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 82 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 76 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 76 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 76 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 74 transition count 76
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 74 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 72 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 72 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 70 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 70 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 68 transition count 69
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 68 transition count 69
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 66 transition count 67
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 66 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 65 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 65 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 64 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 64 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 64 transition count 64
Applied a total of 97 rules in 31 ms. Remains 64 /110 variables (removed 46) and now considering 64/125 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 64/110 places, 64/125 transitions.
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:53:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:53:38] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 328 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 123
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 91 transition count 107
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 91 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 91 transition count 101
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 84 transition count 93
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 84 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 84 transition count 91
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 78 transition count 84
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 78 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 78 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 70 place count 75 transition count 78
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 75 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 76 place count 72 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 79 place count 72 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 82 place count 69 transition count 71
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 69 transition count 71
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 66 transition count 67
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 66 transition count 67
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 63 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 63 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 62 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 62 transition count 63
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 61 transition count 62
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 61 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 61 transition count 61
Applied a total of 102 rules in 29 ms. Remains 61 /110 variables (removed 49) and now considering 61/125 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 61/110 places, 61/125 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:53:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 90 transition count 106
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 90 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 90 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 82 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 82 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 82 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 76 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 76 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 76 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 73 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 73 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 85 place count 70 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 70 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 67 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 97 place count 64 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 64 transition count 64
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 61 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 61 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 60 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 59 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 59 transition count 58
Applied a total of 111 rules in 12 ms. Remains 59 /110 variables (removed 51) and now considering 58/125 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 59/110 places, 58/125 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:53:39] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 328 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 123
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 92 transition count 109
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 92 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 92 transition count 103
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 86 transition count 96
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 86 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 86 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 82 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 82 transition count 89
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 79 transition count 85
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 79 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 76 transition count 82
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 76 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 74 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 74 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 72 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 72 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 71 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 71 transition count 76
Applied a total of 80 rules in 25 ms. Remains 71 /110 variables (removed 39) and now considering 76/125 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 71/110 places, 76/125 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:53:39] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 328 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 90 transition count 106
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 90 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 90 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 82 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 82 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 82 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 76 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 76 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 76 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 75 place count 73 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 78 place count 73 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 81 place count 70 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 84 place count 70 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 87 place count 67 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 93 place count 64 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 64 transition count 64
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 99 place count 61 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 102 place count 61 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 60 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 59 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 59 transition count 58
Applied a total of 107 rules in 27 ms. Remains 59 /110 variables (removed 51) and now considering 58/125 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 59/110 places, 58/125 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:53:39] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 90 transition count 106
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 90 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 90 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 82 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 82 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 82 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 76 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 76 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 76 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 73 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 73 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 85 place count 70 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 70 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 67 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 97 place count 64 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 64 transition count 64
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 61 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 61 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 60 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 59 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 59 transition count 58
Applied a total of 111 rules in 10 ms. Remains 59 /110 variables (removed 51) and now considering 58/125 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 59/110 places, 58/125 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:53:39] [INFO ] Input system was already deterministic with 58 transitions.
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:53:39] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:53:39] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 11:53:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 125 transitions and 488 arcs took 4 ms.
Total runtime 68988 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-d1m04-CTLFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
BK_STOP 1717242819726
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/579/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/579/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/579/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/579/ctl_3_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/579/ctl_4_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/579/ctl_5_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/579/ctl_6_
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-d1m04"
export BK_EXAMINATION="CTLFireability"
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-d1m04, examination is CTLFireability"
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-171683810600050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;