MCC'2024- Execution of r532-smll-171683810700068

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m18

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
644.979	521909.00	1043062.00	1405.50	FFFFFFTFTFFFFFFF	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-171683810700068.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-d1m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 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-d1m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243485077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:04:47] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-06-01 12:04:47] [INFO ] Transformed 1295 places.
[2024-06-01 12:04:47] [INFO ] Transformed 749 transitions.
[2024-06-01 12:04:47] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 144 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 374
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 196 transition count 368
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 385 place count 166 transition count 338
Iterating global reduction 2 with 30 rules applied. Total rules applied 415 place count 166 transition count 338
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 426 place count 166 transition count 327
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 440 place count 152 transition count 311
Iterating global reduction 3 with 14 rules applied. Total rules applied 454 place count 152 transition count 311
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 484 place count 152 transition count 281
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 486 place count 150 transition count 277
Iterating global reduction 4 with 2 rules applied. Total rules applied 488 place count 150 transition count 277
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 490 place count 148 transition count 275
Iterating global reduction 4 with 2 rules applied. Total rules applied 492 place count 148 transition count 275
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 493 place count 147 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 494 place count 147 transition count 274
Applied a total of 494 rules in 127 ms. Remains 147 /259 variables (removed 112) and now considering 274/749 (removed 475) transitions.
// Phase 1: matrix 274 rows 147 cols
[2024-06-01 12:04:47] [INFO ] Computed 5 invariants in 25 ms
[2024-06-01 12:04:48] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-01 12:04:48] [INFO ] Invariant cache hit.
[2024-06-01 12:04:48] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-01 12:04:49] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-06-01 12:04:49] [INFO ] Invariant cache hit.
[2024-06-01 12:04:49] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 1/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 28 ms to minimize.
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 274/421 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 174/333 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-01 12:05:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 0/421 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 334 constraints, problems are : Problem set: 3 solved, 270 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/147 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 7/13 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 274/421 variables, 147/160 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 174/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 270/604 constraints. Problems are: Problem set: 3 solved, 270 unsolved
[2024-06-01 12:05:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 2/606 constraints. Problems are: Problem set: 3 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 606 constraints, problems are : Problem set: 3 solved, 270 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 270/273 constraints, Known Traps: 10/10 constraints]
After SMT, in 60956ms problems are : Problem set: 3 solved, 270 unsolved
Search for dead transitions found 3 dead transitions in 61004ms
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 : 147/259 places, 271/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 271
Applied a total of 3 rules in 8 ms. Remains 144 /147 variables (removed 3) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 144 cols
[2024-06-01 12:05:50] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 12:05:50] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 12:05:50] [INFO ] Invariant cache hit.
[2024-06-01 12:05:50] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-06-01 12:05:51] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/259 places, 271/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63385 ms. Remains : 144/259 places, 271/749 transitions.
Support contains 26 out of 144 places after structural reductions.
[2024-06-01 12:05:51] [INFO ] Flatten gal took : 88 ms
[2024-06-01 12:05:51] [INFO ] Flatten gal took : 32 ms
[2024-06-01 12:05:51] [INFO ] Input system was already deterministic with 271 transitions.
RANDOM walk for 40000 steps (8960 resets) in 3912 ms. (10 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (195 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (193 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (187 resets) in 63 ms. (62 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (186 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (185 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (171 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (186 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (191 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (187 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (191 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (187 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (173 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (180 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (190 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (186 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (192 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (190 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (193 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (205 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (189 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (429 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 262270 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :14 out of 21
Probabilistic random walk after 262270 steps, saw 120255 distinct states, run finished after 3013 ms. (steps per millisecond=87 ) properties seen :14
[2024-06-01 12:05:56] [INFO ] Invariant cache hit.
[2024-06-01 12:05:56] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 199/312 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 101/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 103/415 variables, 31/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 72/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/415 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 321 constraints, problems are : Problem set: 0 solved, 7 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 144/144 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 199/312 variables, 113/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 101/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 103/415 variables, 31/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 72/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/415 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 329 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 144/144 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2325ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 17723 ms.
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 271/271 transitions.
Graph (complete) has 495 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 269
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 132 transition count 206
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 132 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 132 transition count 205
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 123 transition count 196
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 123 transition count 196
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 123 transition count 193
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 116 transition count 186
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 116 transition count 186
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 75 place count 116 transition count 172
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 77 place count 114 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 114 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 112 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 112 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 110 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 110 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 93 place count 110 transition count 159
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 95 place count 108 transition count 157
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 108 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 107 transition count 156
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 107 transition count 156
Applied a total of 99 rules in 73 ms. Remains 107 /144 variables (removed 37) and now considering 156/271 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 107/144 places, 156/271 transitions.
RANDOM walk for 40000 steps (8988 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1949 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 229 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1845 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 408217 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 7
Probabilistic random walk after 408217 steps, saw 176578 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 156 rows 107 cols
[2024-06-01 12:06:19] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 12:06:19] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 143/211 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 52/263 variables, 39/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 194 constraints, problems are : Problem set: 0 solved, 7 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 143/211 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 52/263 variables, 39/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 12:06:21] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
[2024-06-01 12:06:21] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1850ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 7211 ms.
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 156/156 transitions.
Applied a total of 0 rules in 14 ms. Remains 107 /107 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 107/107 places, 156/156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 12:06:29] [INFO ] Invariant cache hit.
[2024-06-01 12:06:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 12:06:29] [INFO ] Invariant cache hit.
[2024-06-01 12:06:29] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 12:06:29] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-01 12:06:29] [INFO ] Redundant transitions in 9 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-01 12:06:29] [INFO ] Invariant cache hit.
[2024-06-01 12:06:29] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/263 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 8987 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/263 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 83/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 155/349 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 12:06:42] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 350 constraints, problems are : Problem set: 0 solved, 155 unsolved in 23342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 2/2 constraints]
After SMT, in 32661ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 32666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33253 ms. Remains : 107/107 places, 156/156 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 107 transition count 149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 101 transition count 134
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 86 transition count 134
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 77 transition count 125
Applied a total of 61 rules in 20 ms. Remains 77 /107 variables (removed 30) and now considering 125/156 (removed 31) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 125 rows 77 cols
[2024-06-01 12:07:02] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:07:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:07:02] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 12:07:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:07:03] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 2
[2024-06-01 12:07:03] [INFO ] After 1164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 12:07:04] [INFO ] After 1394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1791 ms.
Computed a total of 30 stabilizing places and 47 stable transitions
Graph (complete) has 550 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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' '!((X(X(G(!p0))) U (p1 U p2)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 107 transition count 145
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 107 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 89 place count 107 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 104 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 104 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 101 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 101 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 100 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 97 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 97 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 95 transition count 122
Applied a total of 113 rules in 34 ms. Remains 95 /144 variables (removed 49) and now considering 122/271 (removed 149) transitions.
// Phase 1: matrix 122 rows 95 cols
[2024-06-01 12:07:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:07:04] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 12:07:04] [INFO ] Invariant cache hit.
[2024-06-01 12:07:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:07:05] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 12:07:05] [INFO ] Invariant cache hit.
[2024-06-01 12:07:05] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/217 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 159 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/217 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 121/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 12:07:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 281 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints]
After SMT, in 19133ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 19137ms
Starting structural reductions in LTL mode, iteration 1 : 95/144 places, 122/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19770 ms. Remains : 95/144 places, 122/271 transitions.
Stuttering acceptance computed with spot in 485 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, true, (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 finished in 20370 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' '!(X((G(F(p0))&&F(((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 130 transition count 173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 118 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 118 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 118 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 108 transition count 146
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 108 transition count 146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 87 place count 108 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 106 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 104 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 104 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 103 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 103 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 102 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 102 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 101 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 101 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 100 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 100 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 125
Applied a total of 107 rules in 24 ms. Remains 98 /144 variables (removed 46) and now considering 125/271 (removed 146) transitions.
// Phase 1: matrix 125 rows 98 cols
[2024-06-01 12:07:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:07:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 12:07:24] [INFO ] Invariant cache hit.
[2024-06-01 12:07:24] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-01 12:07:25] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 12:07:25] [INFO ] Invariant cache hit.
[2024-06-01 12:07:25] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 5 (OVERLAPS) 125/223 variables, 98/102 constraints. Problems are: Problem set: 2 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 62/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 164 constraints, problems are : Problem set: 2 solved, 122 unsolved in 5799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 122 unsolved
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 125/222 variables, 97/102 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 62/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 15/179 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 1/223 variables, 1/180 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 107/287 constraints. Problems are: Problem set: 2 solved, 122 unsolved
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 1/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 288 constraints, problems are : Problem set: 2 solved, 122 unsolved in 19060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/124 constraints, Known Traps: 2/2 constraints]
After SMT, in 24986ms problems are : Problem set: 2 solved, 122 unsolved
Search for dead transitions found 2 dead transitions in 24988ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 123/271 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 123
Applied a total of 2 rules in 3 ms. Remains 96 /98 variables (removed 2) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 96 cols
[2024-06-01 12:07:50] [INFO ] Computed 4 invariants in 7 ms
[2024-06-01 12:07:50] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 12:07:50] [INFO ] Invariant cache hit.
[2024-06-01 12:07:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 12:07:50] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/144 places, 123/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26194 ms. Remains : 96/144 places, 123/271 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 26547 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' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 91 place count 106 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 103 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 94 transition count 121
Applied a total of 115 rules in 18 ms. Remains 94 /144 variables (removed 50) and now considering 121/271 (removed 150) transitions.
// Phase 1: matrix 121 rows 94 cols
[2024-06-01 12:07:51] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:07:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 12:07:51] [INFO ] Invariant cache hit.
[2024-06-01 12:07:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:07:51] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 12:07:51] [INFO ] Invariant cache hit.
[2024-06-01 12:07:51] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 12:07:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 159 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/215 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 120/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 17762ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 17765ms
Starting structural reductions in LTL mode, iteration 1 : 94/144 places, 121/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18384 ms. Remains : 94/144 places, 121/271 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 finished in 18517 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))||(F(p0)&&F(!p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 102 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 92 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 90 transition count 113
Applied a total of 127 rules in 40 ms. Remains 90 /144 variables (removed 54) and now considering 113/271 (removed 158) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-06-01 12:08:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:08:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 12:08:09] [INFO ] Invariant cache hit.
[2024-06-01 12:08:09] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:08:10] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-01 12:08:10] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 12:08:10] [INFO ] Invariant cache hit.
[2024-06-01 12:08:10] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/203 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 149 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/203 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 112/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 261 constraints, problems are : Problem set: 0 solved, 112 unsolved in 9621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 16414ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 16417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/144 places, 113/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16845 ms. Remains : 90/144 places, 113/271 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 17011 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' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 162
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 161
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 147
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 114 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 103 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 103 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 87 transition count 102
Applied a total of 131 rules in 14 ms. Remains 87 /144 variables (removed 57) and now considering 102/271 (removed 169) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:08:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:08:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 12:08:26] [INFO ] Invariant cache hit.
[2024-06-01 12:08:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:08:27] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 12:08:27] [INFO ] Invariant cache hit.
[2024-06-01 12:08:27] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
After SMT, in 15138ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 15140ms
Starting structural reductions in LTL mode, iteration 1 : 87/144 places, 102/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15593 ms. Remains : 87/144 places, 102/271 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 finished in 15715 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' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 152
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 137
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 137
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 114 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 104 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 104 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 104 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 100 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 96 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 94 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 94 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 94 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 92 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 92 transition count 99
Applied a total of 121 rules in 19 ms. Remains 92 /144 variables (removed 52) and now considering 99/271 (removed 172) transitions.
// Phase 1: matrix 99 rows 92 cols
[2024-06-01 12:08:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:08:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 12:08:42] [INFO ] Invariant cache hit.
[2024-06-01 12:08:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-01 12:08:42] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 12:08:42] [INFO ] Invariant cache hit.
[2024-06-01 12:08:42] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/191 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 135 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/191 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 98/233 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:08:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 236 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 14229ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 14231ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 99/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14691 ms. Remains : 92/144 places, 99/271 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 finished in 14789 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' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 127 transition count 151
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 127 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 127 transition count 150
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 50 place count 112 transition count 135
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 112 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 112 transition count 128
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 101 transition count 117
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 101 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 101 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 96 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 96 transition count 105
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 91 transition count 100
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 88 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 88 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 88 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 85 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 84 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 83 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 82 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 81 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 81 transition count 87
Applied a total of 142 rules in 33 ms. Remains 81 /144 variables (removed 63) and now considering 87/271 (removed 184) transitions.
// Phase 1: matrix 87 rows 81 cols
[2024-06-01 12:08:57] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:08:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 12:08:57] [INFO ] Invariant cache hit.
[2024-06-01 12:08:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:08:57] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-01 12:08:57] [INFO ] Redundant transitions in 3 ms returned []
Running 86 sub problems to find dead transitions.
[2024-06-01 12:08:57] [INFO ] Invariant cache hit.
[2024-06-01 12:08:57] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 10258ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 10260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/144 places, 87/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10653 ms. Remains : 81/144 places, 87/271 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
Product exploration explored 100000 steps with 22360 reset in 289 ms.
Product exploration explored 100000 steps with 22607 reset in 361 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 252 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 20 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8964 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1607 steps, run visited all 1 properties in 7 ms. (steps per millisecond=229 )
Probabilistic random walk after 1607 steps, saw 795 distinct states, run finished after 12 ms. (steps per millisecond=133 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 12:09:09] [INFO ] Invariant cache hit.
[2024-06-01 12:09:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 12:09:09] [INFO ] Invariant cache hit.
[2024-06-01 12:09:09] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:09:09] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-01 12:09:09] [INFO ] Redundant transitions in 3 ms returned []
Running 86 sub problems to find dead transitions.
[2024-06-01 12:09:09] [INFO ] Invariant cache hit.
[2024-06-01 12:09:09] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 9579ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 9581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9950 ms. Remains : 81/81 places, 87/87 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 252 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8938 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1607 steps, run visited all 1 properties in 7 ms. (steps per millisecond=229 )
Probabilistic random walk after 1607 steps, saw 795 distinct states, run finished after 7 ms. (steps per millisecond=229 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22430 reset in 125 ms.
Product exploration explored 100000 steps with 22463 reset in 263 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 12:09:20] [INFO ] Invariant cache hit.
[2024-06-01 12:09:20] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 12:09:20] [INFO ] Invariant cache hit.
[2024-06-01 12:09:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:09:20] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-06-01 12:09:20] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-06-01 12:09:20] [INFO ] Invariant cache hit.
[2024-06-01 12:09:20] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 12:09:23] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5374 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 10476ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 10478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10889 ms. Remains : 81/81 places, 87/87 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 33733 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' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 153
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 138
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 114 transition count 131
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 103 transition count 120
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 103 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 99 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 95 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 95 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 92 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 92 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 89 transition count 97
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 88 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 88 transition count 96
Applied a total of 128 rules in 18 ms. Remains 88 /144 variables (removed 56) and now considering 96/271 (removed 175) transitions.
// Phase 1: matrix 96 rows 88 cols
[2024-06-01 12:09:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:09:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 12:09:31] [INFO ] Invariant cache hit.
[2024-06-01 12:09:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-01 12:09:31] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-01 12:09:31] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:09:31] [INFO ] Invariant cache hit.
[2024-06-01 12:09:31] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/184 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 131 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/184 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 95/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2024-06-01 12:09:37] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints]
After SMT, in 10222ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 10224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 96/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10548 ms. Remains : 88/144 places, 96/271 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 10610 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' '!(X(((G((p1||X(p2)))&&p0) U X(p1))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 163
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 163
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 115 transition count 149
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 115 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 115 transition count 143
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 104 transition count 132
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 104 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 100 transition count 119
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 100 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 96 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 96 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 95 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 94 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 94 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 93 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 93 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 92 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 91 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 91 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 90 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 90 transition count 108
Applied a total of 122 rules in 10 ms. Remains 90 /144 variables (removed 54) and now considering 108/271 (removed 163) transitions.
// Phase 1: matrix 108 rows 90 cols
[2024-06-01 12:09:41] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:09:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 12:09:41] [INFO ] Invariant cache hit.
[2024-06-01 12:09:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:09:42] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-06-01 12:09:42] [INFO ] Invariant cache hit.
[2024-06-01 12:09:42] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/198 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 51/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 12:09:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/198 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/198 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 51/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 15712ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 15715ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 108/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16192 ms. Remains : 90/144 places, 108/271 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 16578 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' '!(F(G((!p0 U p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 102 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 92 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 90 transition count 113
Applied a total of 127 rules in 33 ms. Remains 90 /144 variables (removed 54) and now considering 113/271 (removed 158) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-06-01 12:09:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:09:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 12:09:58] [INFO ] Invariant cache hit.
[2024-06-01 12:09:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:09:58] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-06-01 12:09:58] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 12:09:58] [INFO ] Invariant cache hit.
[2024-06-01 12:09:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 148 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 112/260 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:10:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 261 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11291 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 17074ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 17076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/144 places, 113/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17656 ms. Remains : 90/144 places, 113/271 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 finished in 17747 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' '!((F(G(p0)) U p0))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 162
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 161
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 147
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 114 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 103 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 103 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 87 transition count 102
Applied a total of 131 rules in 20 ms. Remains 87 /144 variables (removed 57) and now considering 102/271 (removed 169) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:10:15] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:10:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 12:10:16] [INFO ] Invariant cache hit.
[2024-06-01 12:10:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:10:16] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-01 12:10:16] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 12:10:16] [INFO ] Invariant cache hit.
[2024-06-01 12:10:16] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:10:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
After SMT, in 12827ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 12829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/144 places, 102/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13172 ms. Remains : 87/144 places, 102/271 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 13270 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 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 165
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 130 transition count 163
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 117 transition count 150
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 117 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 117 transition count 144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 107 transition count 134
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 107 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 107 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 103 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 97 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 97 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 97 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 95 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 95 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 92 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 91 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 91 transition count 108
Applied a total of 122 rules in 34 ms. Remains 91 /144 variables (removed 53) and now considering 108/271 (removed 163) transitions.
// Phase 1: matrix 108 rows 91 cols
[2024-06-01 12:10:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:10:29] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:10:29] [INFO ] Invariant cache hit.
[2024-06-01 12:10:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:10:29] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-06-01 12:10:29] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 12:10:29] [INFO ] Invariant cache hit.
[2024-06-01 12:10:29] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/199 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 144 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/199 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 107/251 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 252 constraints, problems are : Problem set: 0 solved, 107 unsolved in 10868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 15599ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 15601ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/144 places, 108/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16110 ms. Remains : 91/144 places, 108/271 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 16214 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' '!(F((G(p0)&&F(G((p1||X(p2)))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 164
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 129 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 117 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 117 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 117 transition count 145
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 108 transition count 136
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 108 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 108 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 104 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 104 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 100 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 100 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 98 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 98 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 96 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 96 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 95 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 93 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 93 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 92 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 92 transition count 110
Applied a total of 119 rules in 29 ms. Remains 92 /144 variables (removed 52) and now considering 110/271 (removed 161) transitions.
// Phase 1: matrix 110 rows 92 cols
[2024-06-01 12:10:45] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:10:45] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 12:10:45] [INFO ] Invariant cache hit.
[2024-06-01 12:10:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:10:45] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-06-01 12:10:45] [INFO ] Invariant cache hit.
[2024-06-01 12:10:45] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/202 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 49/146 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:10:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:10:50] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 148 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 110/202 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 109/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 257 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 15586ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 15587ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 110/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16084 ms. Remains : 92/144 places, 110/271 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 finished in 16229 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' '!(F(G(p0)))'
[2024-06-01 12:11:01] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:11:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 12:11:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 271 transitions and 1070 arcs took 10 ms.
Total runtime 375118 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717244006986

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
ltl formula formula --ltl=/tmp/1222/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 144 places, 271 transitions and 1070 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1222/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1222/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1222/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1222/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 145 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 145, there are 277 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( 1/ 4): ~102 levels ~10000 states ~29496 transitions
pnml2lts-mc( 1/ 4): ~102 levels ~20000 states ~60892 transitions
pnml2lts-mc( 1/ 4): ~154 levels ~40000 states ~122856 transitions
pnml2lts-mc( 2/ 4): ~180 levels ~80000 states ~242048 transitions
pnml2lts-mc( 1/ 4): ~267 levels ~160000 states ~498804 transitions
pnml2lts-mc( 2/ 4): ~268 levels ~320000 states ~991044 transitions
pnml2lts-mc( 2/ 4): ~268 levels ~640000 states ~1998368 transitions
pnml2lts-mc( 2/ 4): ~312 levels ~1280000 states ~4020368 transitions
pnml2lts-mc( 2/ 4): ~356 levels ~2560000 states ~8093300 transitions
pnml2lts-mc( 2/ 4): ~444 levels ~5120000 states ~16251100 transitions
pnml2lts-mc( 2/ 4): ~488 levels ~10240000 states ~32656500 transitions
pnml2lts-mc( 2/ 4): ~576 levels ~20480000 states ~65460224 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33056564
pnml2lts-mc( 0/ 4): unique states count: 33162551
pnml2lts-mc( 0/ 4): unique transitions count: 108989093
pnml2lts-mc( 0/ 4): - self-loop count: 55118981
pnml2lts-mc( 0/ 4): - claim dead count: 20133142
pnml2lts-mc( 0/ 4): - claim found count: 109504
pnml2lts-mc( 0/ 4): - claim success count: 33162703
pnml2lts-mc( 0/ 4): - cum. max stack depth: 81373
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33162716 states 108990110 transitions, fanout: 3.287
pnml2lts-mc( 0/ 4): Total exploration time 144.230 sec (144.160 sec minimum, 144.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 229929, Transitions per second: 755669
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 295.4MB, 9.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/61.0%
pnml2lts-mc( 0/ 4): Stored 274 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 295.4MB (~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-d1m18"
export BK_EXAMINATION="LTLFireability"
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-d1m18, examination is LTLFireability"
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-171683810700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;