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.r524-tall-171679079500076.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 RingSingleMessageInMbox-PT-d1m020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m020-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717218306126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:05:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:05:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:05:07] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2024-06-01 05:05:07] [INFO ] Transformed 6690 places.
[2024-06-01 05:05:07] [INFO ] Transformed 11934 transitions.
[2024-06-01 05:05:07] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4305 places in 38 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1088 places :
Symmetric choice reduction at 1 with 1088 rule applications. Total rules 1207 place count 1280 transition count 7064
Iterating global reduction 1 with 1088 rules applied. Total rules applied 2295 place count 1280 transition count 7064
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 2571 place count 1280 transition count 6788
Discarding 924 places :
Symmetric choice reduction at 2 with 924 rule applications. Total rules 3495 place count 356 transition count 5864
Iterating global reduction 2 with 924 rules applied. Total rules applied 4419 place count 356 transition count 5864
Ensure Unique test removed 4693 transitions
Reduce isomorphic transitions removed 4693 transitions.
Iterating post reduction 2 with 4693 rules applied. Total rules applied 9112 place count 356 transition count 1171
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 9173 place count 295 transition count 1110
Iterating global reduction 3 with 61 rules applied. Total rules applied 9234 place count 295 transition count 1110
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 3 with 205 rules applied. Total rules applied 9439 place count 295 transition count 905
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9447 place count 287 transition count 897
Iterating global reduction 4 with 8 rules applied. Total rules applied 9455 place count 287 transition count 897
Applied a total of 9455 rules in 582 ms. Remains 287 /2385 variables (removed 2098) and now considering 897/11934 (removed 11037) transitions.
// Phase 1: matrix 897 rows 287 cols
[2024-06-01 05:05:08] [INFO ] Computed 3 invariants in 30 ms
[2024-06-01 05:05:09] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 05:05:09] [INFO ] Invariant cache hit.
[2024-06-01 05:05:09] [INFO ] State equation strengthened by 638 read => feed constraints.
[2024-06-01 05:05:10] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2024-06-01 05:05:10] [INFO ] Invariant cache hit.
[2024-06-01 05:05:10] [INFO ] State equation strengthened by 638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
At refinement iteration 4 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 928 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 1 (OVERLAPS) 17/279 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 3 (OVERLAPS) 8/287 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 872/1800 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1800 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 872/896 constraints, Known Traps: 0/0 constraints]
After SMT, in 63496ms problems are : Problem set: 24 solved, 872 unsolved
Search for dead transitions found 24 dead transitions in 63518ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 287/2385 places, 873/11934 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 264 transition count 862
Applied a total of 34 rules in 6 ms. Remains 264 /287 variables (removed 23) and now considering 862/873 (removed 11) transitions.
// Phase 1: matrix 862 rows 264 cols
[2024-06-01 05:06:14] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:06:14] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 05:06:14] [INFO ] Invariant cache hit.
[2024-06-01 05:06:14] [INFO ] State equation strengthened by 634 read => feed constraints.
[2024-06-01 05:06:15] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/2385 places, 862/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67228 ms. Remains : 264/2385 places, 862/11934 transitions.
Support contains 25 out of 264 places after structural reductions.
[2024-06-01 05:06:15] [INFO ] Flatten gal took : 108 ms
[2024-06-01 05:06:15] [INFO ] Flatten gal took : 47 ms
[2024-06-01 05:06:16] [INFO ] Input system was already deterministic with 862 transitions.
RANDOM walk for 40000 steps (6574 resets) in 2851 ms. (14 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (848 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2024-06-01 05:06:16] [INFO ] Invariant cache hit.
[2024-06-01 05:06:16] [INFO ] State equation strengthened by 634 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 319/396 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 91/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 1126/1126 variables, and 357 constraints, problems are : Problem set: 1 solved, 0 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 264/264 constraints, ReadFeed: 91/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 70 stabilizing places and 424 stable transitions
Graph (complete) has 1391 edges and 264 vertex of which 262 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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))||F(p1))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 15 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-06-01 05:06:17] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:06:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:06:17] [INFO ] Invariant cache hit.
[2024-06-01 05:06:17] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-06-01 05:06:18] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 05:06:18] [INFO ] Invariant cache hit.
[2024-06-01 05:06:18] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 8727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-01 05:06:33] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 7 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 05:06:34] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 05:06:34] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-06-01 05:06:37] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-06-01 05:06:37] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-06-01 05:06:37] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 573 constraints, problems are : Problem set: 22 solved, 250 unsolved in 28747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 6/6 constraints]
After SMT, in 38041ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 38043ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/264 places, 251/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 245
Applied a total of 24 rules in 2 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-06-01 05:06:56] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:06:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 05:06:56] [INFO ] Invariant cache hit.
[2024-06-01 05:06:56] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 05:06:56] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39042 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 finished in 40214 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(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 290 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 294 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 306 place count 155 transition count 217
Applied a total of 306 rules in 14 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-06-01 05:06:57] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:06:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:06:57] [INFO ] Invariant cache hit.
[2024-06-01 05:06:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-01 05:06:58] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-01 05:06:58] [INFO ] Invariant cache hit.
[2024-06-01 05:06:58] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 05:07:09] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-01 05:07:09] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-01 05:07:09] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 17 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-06-01 05:07:11] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-06-01 05:07:11] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 16 ms to minimize.
[2024-06-01 05:07:11] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 18594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25413ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25415ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 2 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-06-01 05:07:23] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:07:23] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 05:07:23] [INFO ] Invariant cache hit.
[2024-06-01 05:07:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:07:23] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26138 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 finished in 26249 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((p0&&(X(G((X(p1) U !p0)))||p2))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 272 place count 174 transition count 320
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 173 transition count 307
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 173 transition count 307
Applied a total of 274 rules in 19 ms. Remains 173 /264 variables (removed 91) and now considering 307/862 (removed 555) transitions.
// Phase 1: matrix 307 rows 173 cols
[2024-06-01 05:07:23] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:07:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 05:07:24] [INFO ] Invariant cache hit.
[2024-06-01 05:07:24] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-06-01 05:07:24] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-01 05:07:24] [INFO ] Invariant cache hit.
[2024-06-01 05:07:24] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 330 constraints, problems are : Problem set: 0 solved, 306 unsolved in 10446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 306/636 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 05:07:41] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:07:42] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 05:07:43] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-06-01 05:07:43] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-06-01 05:07:46] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:07:46] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 6/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 642 constraints, problems are : Problem set: 22 solved, 284 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints]
After SMT, in 41093ms problems are : Problem set: 22 solved, 284 unsolved
Search for dead transitions found 22 dead transitions in 41098ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 285/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 279
Applied a total of 24 rules in 3 ms. Remains 155 /173 variables (removed 18) and now considering 279/285 (removed 6) transitions.
// Phase 1: matrix 279 rows 155 cols
[2024-06-01 05:08:05] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:08:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:08:05] [INFO ] Invariant cache hit.
[2024-06-01 05:08:05] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-06-01 05:08:06] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 279/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42298 ms. Remains : 155/264 places, 279/862 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (NOT p0)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 finished in 42476 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' '!(((p0&&F(p1)) U (X(!p3)&&p2)))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 495
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 494
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 478
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 230 transition count 476
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 127 place count 174 transition count 420
Iterating global reduction 3 with 56 rules applied. Total rules applied 183 place count 174 transition count 420
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 275 place count 174 transition count 328
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 276 place count 173 transition count 315
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 173 transition count 315
Applied a total of 277 rules in 46 ms. Remains 173 /264 variables (removed 91) and now considering 315/862 (removed 547) transitions.
// Phase 1: matrix 315 rows 173 cols
[2024-06-01 05:08:06] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:08:06] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:08:06] [INFO ] Invariant cache hit.
[2024-06-01 05:08:06] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-01 05:08:07] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-06-01 05:08:07] [INFO ] Invariant cache hit.
[2024-06-01 05:08:07] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 338 constraints, problems are : Problem set: 0 solved, 314 unsolved in 11270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 314/652 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 05:08:26] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 05:08:26] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-06-01 05:08:30] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
[2024-06-01 05:08:30] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 2 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
[2024-06-01 05:08:30] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:08:30] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
[2024-06-01 05:08:37] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 2/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 660 constraints, problems are : Problem set: 22 solved, 292 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints]
After SMT, in 41786ms problems are : Problem set: 22 solved, 292 unsolved
Search for dead transitions found 22 dead transitions in 41792ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 293/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 287
Applied a total of 24 rules in 3 ms. Remains 155 /173 variables (removed 18) and now considering 287/293 (removed 6) transitions.
// Phase 1: matrix 287 rows 155 cols
[2024-06-01 05:08:48] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:08:48] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 05:08:48] [INFO ] Invariant cache hit.
[2024-06-01 05:08:49] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-06-01 05:08:49] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 287/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42903 ms. Remains : 155/264 places, 287/862 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) p3), true, p3, (NOT p1), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3)), p3]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 finished in 43189 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 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 429
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 428
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 410
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 226 transition count 408
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 143 place count 162 transition count 344
Iterating global reduction 3 with 64 rules applied. Total rules applied 207 place count 162 transition count 344
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 291 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 293 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 295 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 296 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 301 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 305 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 317 place count 155 transition count 217
Applied a total of 317 rules in 37 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-06-01 05:08:49] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:08:49] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 05:08:49] [INFO ] Invariant cache hit.
[2024-06-01 05:08:49] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-01 05:08:50] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-01 05:08:50] [INFO ] Invariant cache hit.
[2024-06-01 05:08:50] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:09:03] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 18606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25324ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25327ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 6 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-06-01 05:09:15] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:09:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 05:09:15] [INFO ] Invariant cache hit.
[2024-06-01 05:09:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:09:15] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26079 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 finished in 26171 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((p0 U X(p1)))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 245 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 245 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 245 transition count 418
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 227 transition count 400
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 227 transition count 400
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 227 transition count 397
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 142 place count 163 transition count 333
Iterating global reduction 2 with 64 rules applied. Total rules applied 206 place count 163 transition count 333
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 278 place count 163 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 162 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 162 transition count 248
Applied a total of 280 rules in 15 ms. Remains 162 /264 variables (removed 102) and now considering 248/862 (removed 614) transitions.
// Phase 1: matrix 248 rows 162 cols
[2024-06-01 05:09:15] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:09:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:09:15] [INFO ] Invariant cache hit.
[2024-06-01 05:09:15] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 05:09:16] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-06-01 05:09:16] [INFO ] Invariant cache hit.
[2024-06-01 05:09:16] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 269 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 49/317 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 05:09:31] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 05:09:31] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-01 05:09:31] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-06-01 05:09:32] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
[2024-06-01 05:09:32] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:09:33] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 6/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/324 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 186/510 constraints. Problems are: Problem set: 22 solved, 225 unsolved
[2024-06-01 05:09:44] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 511 constraints, problems are : Problem set: 22 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 235/247 constraints, Known Traps: 7/7 constraints]
After SMT, in 41825ms problems are : Problem set: 22 solved, 225 unsolved
Search for dead transitions found 22 dead transitions in 41830ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/264 places, 226/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 220
Applied a total of 24 rules in 3 ms. Remains 144 /162 variables (removed 18) and now considering 220/226 (removed 6) transitions.
// Phase 1: matrix 220 rows 144 cols
[2024-06-01 05:09:58] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 05:09:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 05:09:58] [INFO ] Invariant cache hit.
[2024-06-01 05:09:58] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:09:58] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/264 places, 220/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42649 ms. Remains : 144/264 places, 220/862 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 finished in 42919 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 U p1)))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 288 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 289 place count 173 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 290 place count 173 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 172 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 172 transition count 290
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 168 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 168 transition count 286
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 324 place count 168 transition count 262
Applied a total of 324 rules in 66 ms. Remains 168 /264 variables (removed 96) and now considering 262/862 (removed 600) transitions.
// Phase 1: matrix 262 rows 168 cols
[2024-06-01 05:09:58] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:09:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:09:58] [INFO ] Invariant cache hit.
[2024-06-01 05:09:58] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 05:09:59] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-06-01 05:09:59] [INFO ] Redundant transitions in 15 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 05:09:59] [INFO ] Invariant cache hit.
[2024-06-01 05:09:59] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 285 constraints, problems are : Problem set: 0 solved, 261 unsolved in 9040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 261/546 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:10:14] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 05:10:14] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-06-01 05:10:16] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-06-01 05:10:16] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 05:10:17] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
[2024-06-01 05:10:17] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 552 constraints, problems are : Problem set: 22 solved, 239 unsolved in 25470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 34887ms problems are : Problem set: 22 solved, 239 unsolved
Search for dead transitions found 22 dead transitions in 34889ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/264 places, 240/862 transitions.
Graph (complete) has 561 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 234
Applied a total of 7 rules in 11 ms. Remains 150 /168 variables (removed 18) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 150 cols
[2024-06-01 05:10:34] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:10:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:10:34] [INFO ] Invariant cache hit.
[2024-06-01 05:10:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:10:34] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/264 places, 234/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35913 ms. Remains : 150/264 places, 234/862 transitions.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
Product exploration explored 100000 steps with 18527 reset in 314 ms.
Product exploration explored 100000 steps with 18573 reset in 281 ms.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 105 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p1, p1, p1]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (7250 resets) in 272 ms. (146 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (1234 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
[2024-06-01 05:10:35] [INFO ] Invariant cache hit.
[2024-06-01 05:10:35] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/238 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 384/384 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 47/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 284 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[p1, p1]
Stuttering acceptance computed with spot in 86 ms :[p1, p1]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 14 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-06-01 05:10:36] [INFO ] Invariant cache hit.
[2024-06-01 05:10:36] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:10:36] [INFO ] Invariant cache hit.
[2024-06-01 05:10:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:10:36] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-01 05:10:36] [INFO ] Redundant transitions in 6 ms returned []
Running 233 sub problems to find dead transitions.
[2024-06-01 05:10:36] [INFO ] Invariant cache hit.
[2024-06-01 05:10:36] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24322ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24801 ms. Remains : 150/150 places, 234/234 transitions.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[p1, p1]
RANDOM walk for 547 steps (101 resets) in 12 ms. (42 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
Stuttering acceptance computed with spot in 95 ms :[p1, p1]
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Product exploration explored 100000 steps with 18495 reset in 218 ms.
Product exploration explored 100000 steps with 18696 reset in 234 ms.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-06-01 05:11:02] [INFO ] Invariant cache hit.
[2024-06-01 05:11:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 05:11:02] [INFO ] Invariant cache hit.
[2024-06-01 05:11:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:11:02] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-06-01 05:11:02] [INFO ] Redundant transitions in 5 ms returned []
Running 233 sub problems to find dead transitions.
[2024-06-01 05:11:02] [INFO ] Invariant cache hit.
[2024-06-01 05:11:02] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24298ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24744 ms. Remains : 150/150 places, 234/234 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 finished in 88426 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 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 441
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 440
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 424
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 230 transition count 423
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 130 place count 170 transition count 363
Iterating global reduction 3 with 60 rules applied. Total rules applied 190 place count 170 transition count 363
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 266 place count 170 transition count 287
Applied a total of 266 rules in 32 ms. Remains 170 /264 variables (removed 94) and now considering 287/862 (removed 575) transitions.
// Phase 1: matrix 287 rows 170 cols
[2024-06-01 05:11:27] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:11:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:11:27] [INFO ] Invariant cache hit.
[2024-06-01 05:11:27] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-01 05:11:27] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-01 05:11:27] [INFO ] Redundant transitions in 2 ms returned []
Running 286 sub problems to find dead transitions.
[2024-06-01 05:11:27] [INFO ] Invariant cache hit.
[2024-06-01 05:11:27] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 310 constraints, problems are : Problem set: 0 solved, 286 unsolved in 9943 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 286/596 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-06-01 05:11:45] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 6/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 602 constraints, problems are : Problem set: 22 solved, 264 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints]
After SMT, in 40486ms problems are : Problem set: 22 solved, 264 unsolved
Search for dead transitions found 22 dead transitions in 40490ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 170/264 places, 265/862 transitions.
Graph (complete) has 590 edges and 170 vertex of which 152 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 152 transition count 259
Applied a total of 7 rules in 9 ms. Remains 152 /170 variables (removed 18) and now considering 259/265 (removed 6) transitions.
// Phase 1: matrix 259 rows 152 cols
[2024-06-01 05:12:08] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:12:08] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 05:12:08] [INFO ] Invariant cache hit.
[2024-06-01 05:12:08] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-01 05:12:08] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 152/264 places, 259/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41389 ms. Remains : 152/264 places, 259/862 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Product exploration explored 100000 steps with 18101 reset in 218 ms.
Product exploration explored 100000 steps with 18037 reset in 211 ms.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2492 steps (468 resets) in 24 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 11 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-01 05:12:09] [INFO ] Invariant cache hit.
[2024-06-01 05:12:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:12:09] [INFO ] Invariant cache hit.
[2024-06-01 05:12:09] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-01 05:12:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-01 05:12:09] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 05:12:09] [INFO ] Invariant cache hit.
[2024-06-01 05:12:09] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 27843ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 27846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28227 ms. Remains : 152/152 places, 259/259 transitions.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1222 steps (216 resets) in 14 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17981 reset in 209 ms.
Product exploration explored 100000 steps with 18055 reset in 214 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-01 05:12:38] [INFO ] Invariant cache hit.
[2024-06-01 05:12:38] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:12:38] [INFO ] Invariant cache hit.
[2024-06-01 05:12:38] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-01 05:12:39] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-06-01 05:12:39] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 05:12:39] [INFO ] Invariant cache hit.
[2024-06-01 05:12:39] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 27430ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 27434ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27825 ms. Remains : 152/152 places, 259/259 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 99563 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||F(p2))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 431
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 431
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 229 transition count 414
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 229 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 229 transition count 413
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 135 place count 165 transition count 349
Iterating global reduction 2 with 64 rules applied. Total rules applied 199 place count 165 transition count 349
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 279 place count 165 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 164 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 164 transition count 256
Applied a total of 281 rules in 26 ms. Remains 164 /264 variables (removed 100) and now considering 256/862 (removed 606) transitions.
// Phase 1: matrix 256 rows 164 cols
[2024-06-01 05:13:06] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:13:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:13:06] [INFO ] Invariant cache hit.
[2024-06-01 05:13:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:13:07] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-06-01 05:13:07] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-01 05:13:07] [INFO ] Invariant cache hit.
[2024-06-01 05:13:07] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 255 unsolved in 7718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 255/532 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-01 05:13:20] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 05:13:21] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2024-06-01 05:13:23] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-06-01 05:13:23] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:13:23] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 6/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 538 constraints, problems are : Problem set: 22 solved, 233 unsolved in 23128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
After SMT, in 31273ms problems are : Problem set: 22 solved, 233 unsolved
Search for dead transitions found 22 dead transitions in 31276ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 164/264 places, 234/862 transitions.
Graph (complete) has 550 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 146 transition count 228
Applied a total of 7 rules in 7 ms. Remains 146 /164 variables (removed 18) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 146 cols
[2024-06-01 05:13:38] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 05:13:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:13:38] [INFO ] Invariant cache hit.
[2024-06-01 05:13:38] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 05:13:38] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/264 places, 228/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32147 ms. Remains : 146/264 places, 228/862 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
Stuttering criterion allowed to conclude after 24 steps with 6 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 finished in 32263 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 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 42 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-06-01 05:13:38] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:13:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 05:13:39] [INFO ] Invariant cache hit.
[2024-06-01 05:13:39] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-06-01 05:13:39] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-01 05:13:39] [INFO ] Redundant transitions in 1 ms returned []
Running 272 sub problems to find dead transitions.
[2024-06-01 05:13:39] [INFO ] Invariant cache hit.
[2024-06-01 05:13:39] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 9034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-06-01 05:13:58] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-06-01 05:13:58] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:13:58] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
[2024-06-01 05:14:11] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:14:11] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:14:11] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:14:11] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/440 variables, 4/577 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/577 constraints. Problems are: Problem set: 22 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 577 constraints, problems are : Problem set: 22 solved, 250 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 10/10 constraints]
After SMT, in 39554ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 39557ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/264 places, 251/862 transitions.
Graph (complete) has 572 edges and 167 vertex of which 149 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 149 transition count 245
Applied a total of 7 rules in 7 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-06-01 05:14:19] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 05:14:19] [INFO ] Invariant cache hit.
[2024-06-01 05:14:19] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40593 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
Product exploration explored 100000 steps with 18005 reset in 238 ms.
Product exploration explored 100000 steps with 18072 reset in 253 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 206 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (7239 resets) in 229 ms. (173 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (1185 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-06-01 05:14:20] [INFO ] Invariant cache hit.
[2024-06-01 05:14:20] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/240 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 394/394 variables, and 201 constraints, problems are : Problem set: 1 solved, 0 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 50/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 310 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 149 /149 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
[2024-06-01 05:14:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
[2024-06-01 05:14:21] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 05:14:21] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-01 05:14:21] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
[2024-06-01 05:14:21] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 273 constraints, problems are : Problem set: 0 solved, 244 unsolved in 8141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 244/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 517 constraints, problems are : Problem set: 0 solved, 244 unsolved in 16045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 24604ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 24607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25064 ms. Remains : 149/149 places, 245/245 transitions.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 38 ms :[p0]
RANDOM walk for 2901 steps (539 resets) in 16 ms. (170 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 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 34 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Product exploration explored 100000 steps with 18016 reset in 217 ms.
Product exploration explored 100000 steps with 18045 reset in 224 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 148 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 147 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 147 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 143 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 143 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 143 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 141 transition count 208
Applied a total of 21 rules in 13 ms. Remains 141 /149 variables (removed 8) and now considering 208/245 (removed 37) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-06-01 05:14:47] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:14:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 05:14:47] [INFO ] Invariant cache hit.
[2024-06-01 05:14:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:14:47] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-01 05:14:47] [INFO ] Redundant transitions in 2 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-01 05:14:47] [INFO ] Invariant cache hit.
[2024-06-01 05:14:47] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 234 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 207/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 441 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 17690ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 17694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/149 places, 208/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18101 ms. Remains : 141/149 places, 208/245 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 finished in 86300 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 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 159 transition count 232
Applied a total of 287 rules in 30 ms. Remains 159 /264 variables (removed 105) and now considering 232/862 (removed 630) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-06-01 05:15:05] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:15:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 05:15:05] [INFO ] Invariant cache hit.
[2024-06-01 05:15:05] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:15:05] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-01 05:15:05] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2024-06-01 05:15:05] [INFO ] Invariant cache hit.
[2024-06-01 05:15:05] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 252 constraints, problems are : Problem set: 0 solved, 231 unsolved in 6649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 231/483 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 05:15:17] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 05:15:17] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-01 05:15:17] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:15:17] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 05:15:19] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:15:19] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 6/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 489 constraints, problems are : Problem set: 22 solved, 209 unsolved in 19694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints]
After SMT, in 26697ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 26700ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/264 places, 210/862 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 204
Applied a total of 7 rules in 7 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-06-01 05:15:32] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:15:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 05:15:32] [INFO ] Invariant cache hit.
[2024-06-01 05:15:32] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 05:15:32] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/264 places, 204/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27494 ms. Remains : 141/264 places, 204/862 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 finished in 27556 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 U p1)))))'
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)))'
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))))'
[2024-06-01 05:15:33] [INFO ] Flatten gal took : 36 ms
[2024-06-01 05:15:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 05:15:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 862 transitions and 3414 arcs took 11 ms.
Total runtime 625980 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14

BK_STOP 1717219397667

--------------------
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 RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
ltl formula formula --ltl=/tmp/1582/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 264 places, 862 transitions and 3414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1582/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1582/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1582/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1582/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 264 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 265, there are 890 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( 3/ 4): ~61 levels ~10000 states ~36216 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~20000 states ~65872 transitions
pnml2lts-mc( 3/ 4): ~426 levels ~40000 states ~131608 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~80000 states ~243580 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~160000 states ~483644 transitions
pnml2lts-mc( 1/ 4): ~132 levels ~320000 states ~968620 transitions
pnml2lts-mc( 1/ 4): ~132 levels ~640000 states ~1950560 transitions
pnml2lts-mc( 1/ 4): ~356 levels ~1280000 states ~3935760 transitions
pnml2lts-mc( 1/ 4): ~28291 levels ~2560000 states ~8559548 transitions
pnml2lts-mc( 1/ 4): ~94413 levels ~5120000 states ~18241396 transitions
pnml2lts-mc( 1/ 4): ~184858 levels ~10240000 states ~36598652 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11798095
pnml2lts-mc( 0/ 4): unique states count: 13358612
pnml2lts-mc( 0/ 4): unique transitions count: 43976064
pnml2lts-mc( 0/ 4): - self-loop count: 22580448
pnml2lts-mc( 0/ 4): - claim dead count: 1637514
pnml2lts-mc( 0/ 4): - claim found count: 4058578
pnml2lts-mc( 0/ 4): - claim success count: 13358625
pnml2lts-mc( 0/ 4): - cum. max stack depth: 408080
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13358625 states 43976164 transitions, fanout: 3.292
pnml2lts-mc( 0/ 4): Total exploration time 150.720 sec (150.580 sec minimum, 150.635 sec on average)
pnml2lts-mc( 0/ 4): States per second: 88632, Transitions per second: 291774
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 180.8MB, 12.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 45.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 180.8MB (~256.0MB paged-in)
ltl formula name RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
ltl formula formula --ltl=/tmp/1582/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 264 places, 862 transitions and 3414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1582/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1582/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1582/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1582/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 265, there are 871 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( 2/ 4): ~112 levels ~10000 states ~22132 transitions
pnml2lts-mc( 2/ 4): ~112 levels ~20000 states ~41416 transitions
pnml2lts-mc( 2/ 4): ~112 levels ~40000 states ~83480 transitions
pnml2lts-mc( 2/ 4): ~112 levels ~80000 states ~167888 transitions
pnml2lts-mc( 1/ 4): ~132 levels ~160000 states ~330316 transitions
pnml2lts-mc( 1/ 4): ~132 levels ~320000 states ~669700 transitions
pnml2lts-mc( 0/ 4): ~129 levels ~640000 states ~1338992 transitions
pnml2lts-mc( 0/ 4): ~129 levels ~1280000 states ~2759332 transitions
pnml2lts-mc( 0/ 4): ~11627 levels ~2560000 states ~5709572 transitions
pnml2lts-mc( 0/ 4): ~30822 levels ~5120000 states ~11251596 transitions
pnml2lts-mc( 0/ 4): ~30822 levels ~10240000 states ~22591868 transitions
pnml2lts-mc( 0/ 4): ~61812 levels ~20480000 states ~45210828 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18888199
pnml2lts-mc( 0/ 4): unique states count: 21948227
pnml2lts-mc( 0/ 4): unique transitions count: 48817264
pnml2lts-mc( 0/ 4): - self-loop count: 18486298
pnml2lts-mc( 0/ 4): - claim dead count: 1424760
pnml2lts-mc( 0/ 4): - claim found count: 6238823
pnml2lts-mc( 0/ 4): - claim success count: 21948238
pnml2lts-mc( 0/ 4): - cum. max stack depth: 319241
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21948238 states 48817360 transitions, fanout: 2.224
pnml2lts-mc( 0/ 4): Total exploration time 215.990 sec (215.980 sec minimum, 215.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 101617, Transitions per second: 226017
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 236.5MB, 11.0 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 67.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 236.5MB (~256.0MB paged-in)
ltl formula name RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
ltl formula formula --ltl=/tmp/1582/ltl_2_
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 264 places, 862 transitions and 3414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1582/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1582/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1582/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1582/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 264 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 265, there are 873 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( 2/ 4): ~181 levels ~10000 states ~30456 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~20000 states ~62096 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~40000 states ~122596 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~80000 states ~244696 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~160000 states ~490364 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~320000 states ~990792 transitions
pnml2lts-mc( 0/ 4): ~2564 levels ~640000 states ~2024676 transitions
pnml2lts-mc( 0/ 4): ~22133 levels ~1280000 states ~4433584 transitions
pnml2lts-mc( 0/ 4): ~42044 levels ~2560000 states ~8851540 transitions
pnml2lts-mc( 0/ 4): ~71998 levels ~5120000 states ~17533840 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7884208
pnml2lts-mc( 0/ 4): unique states count: 9143591
pnml2lts-mc( 0/ 4): unique transitions count: 32212796
pnml2lts-mc( 0/ 4): - self-loop count: 15745415
pnml2lts-mc( 0/ 4): - claim dead count: 38211
pnml2lts-mc( 0/ 4): - claim found count: 3432134
pnml2lts-mc( 0/ 4): - claim success count: 9143606
pnml2lts-mc( 0/ 4): - cum. max stack depth: 592560
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9143606 states 32212893 transitions, fanout: 3.523
pnml2lts-mc( 0/ 4): Total exploration time 95.640 sec (95.570 sec minimum, 95.613 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95604, Transitions per second: 336814
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 159.5MB, 13.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 159.5MB (~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="RingSingleMessageInMbox-PT-d1m020"
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 RingSingleMessageInMbox-PT-d1m020, 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 r524-tall-171679079500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 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 ;