MCC'2024- Execution of r334-tall-171679079500068

About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11207.004	2645013.00	8537850.00	1886.10	FTFFFFFFFFFTFTFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079500068.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 itstools
Input is RingSingleMessageInMbox-PT-d1m010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 00:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 00:35 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-d1m010-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716795202231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 07:33:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 07:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:33:23] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2024-05-27 07:33:24] [INFO ] Transformed 6690 places.
[2024-05-27 07:33:24] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:33:24] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 598 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4305 places in 44 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 1082 places :
Symmetric choice reduction at 1 with 1082 rule applications. Total rules 1201 place count 1286 transition count 8158
Iterating global reduction 1 with 1082 rules applied. Total rules applied 2283 place count 1286 transition count 8158
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 1 with 324 rules applied. Total rules applied 2607 place count 1286 transition count 7834
Discarding 917 places :
Symmetric choice reduction at 2 with 917 rule applications. Total rules 3524 place count 369 transition count 6917
Iterating global reduction 2 with 917 rules applied. Total rules applied 4441 place count 369 transition count 6917
Ensure Unique test removed 5563 transitions
Reduce isomorphic transitions removed 5563 transitions.
Iterating post reduction 2 with 5563 rules applied. Total rules applied 10004 place count 369 transition count 1354
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 10050 place count 323 transition count 1308
Iterating global reduction 3 with 46 rules applied. Total rules applied 10096 place count 323 transition count 1308
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 10194 place count 323 transition count 1210
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 10202 place count 315 transition count 1202
Iterating global reduction 4 with 8 rules applied. Total rules applied 10210 place count 315 transition count 1202
Applied a total of 10210 rules in 370 ms. Remains 315 /2385 variables (removed 2070) and now considering 1202/11934 (removed 10732) transitions.
// Phase 1: matrix 1202 rows 315 cols
[2024-05-27 07:33:24] [INFO ] Computed 3 invariants in 41 ms
[2024-05-27 07:33:25] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-27 07:33:25] [INFO ] Invariant cache hit.
[2024-05-27 07:33:25] [INFO ] State equation strengthened by 919 read => feed constraints.
[2024-05-27 07:33:27] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-05-27 07:33:27] [INFO ] Invariant cache hit.
[2024-05-27 07:33:27] [INFO ] State equation strengthened by 919 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
At refinement iteration 4 (OVERLAPS) 1202/1517 variables, 315/318 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1517 variables, 919/1237 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1517/1517 variables, and 1237 constraints, problems are : Problem set: 24 solved, 1177 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, ReadFeed: 919/919 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 1177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 1 (OVERLAPS) 17/307 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 3 (OVERLAPS) 8/315 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 5 (OVERLAPS) 1202/1517 variables, 315/318 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1517 variables, 919/1237 constraints. Problems are: Problem set: 24 solved, 1177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1517/1517 variables, and 2414 constraints, problems are : Problem set: 24 solved, 1177 unsolved in 31089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, ReadFeed: 919/919 constraints, PredecessorRefiner: 1177/1201 constraints, Known Traps: 0/0 constraints]
After SMT, in 66072ms problems are : Problem set: 24 solved, 1177 unsolved
Search for dead transitions found 24 dead transitions in 66098ms
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 : 315/2385 places, 1178/11934 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 291 transition count 1166
Applied a total of 36 rules in 8 ms. Remains 291 /315 variables (removed 24) and now considering 1166/1178 (removed 12) transitions.
// Phase 1: matrix 1166 rows 291 cols
[2024-05-27 07:34:33] [INFO ] Computed 2 invariants in 15 ms
[2024-05-27 07:34:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-27 07:34:33] [INFO ] Invariant cache hit.
[2024-05-27 07:34:33] [INFO ] State equation strengthened by 915 read => feed constraints.
[2024-05-27 07:34:35] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 291/2385 places, 1166/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70795 ms. Remains : 291/2385 places, 1166/11934 transitions.
Support contains 28 out of 291 places after structural reductions.
[2024-05-27 07:34:35] [INFO ] Flatten gal took : 96 ms
[2024-05-27 07:34:35] [INFO ] Flatten gal took : 61 ms
[2024-05-27 07:34:35] [INFO ] Input system was already deterministic with 1166 transitions.
Support contains 27 out of 291 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (6882 resets) in 3036 ms. (13 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (805 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
[2024-05-27 07:34:36] [INFO ] Invariant cache hit.
[2024-05-27 07:34:36] [INFO ] State equation strengthened by 915 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) 68/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) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 377/453 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 126/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 1457/1457 variables, and 419 constraints, problems are : Problem set: 1 solved, 0 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 291/291 constraints, ReadFeed: 126/915 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 76 stabilizing places and 540 stable transitions
Graph (complete) has 1746 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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(F(p0))))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 471
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 266 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 242 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 242 transition count 446
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 105 place count 242 transition count 440
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 185 place count 162 transition count 360
Iterating global reduction 2 with 80 rules applied. Total rules applied 265 place count 162 transition count 360
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 365 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 367 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 370 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 372 place count 159 transition count 232
Applied a total of 372 rules in 20 ms. Remains 159 /291 variables (removed 132) and now considering 232/1166 (removed 934) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-05-27 07:34:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:34:38] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-27 07:34:38] [INFO ] Invariant cache hit.
[2024-05-27 07:34:38] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:34:38] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-27 07:34:38] [INFO ] Invariant cache hit.
[2024-05-27 07:34:38] [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
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 7453 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-05-27 07:34:51] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 12 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:34:51] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 07:34:51] [INFO ] Deduced a trap composed of 56 places in 51 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
[2024-05-27 07:34:53] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
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-05-27 07:34:54] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:34:54] [INFO ] Deduced a trap composed of 58 places in 42 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 21665 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 29458ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 29460ms
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 : 159/291 places, 210/1166 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 141 transition count 204
Applied a total of 24 rules in 1 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:35:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:35:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:35:08] [INFO ] Invariant cache hit.
[2024-05-27 07:35:08] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:35:08] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/291 places, 204/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30660 ms. Remains : 141/291 places, 204/1166 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-00 finished in 30961 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(X(G(X(p0))))) U p1))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 505
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 267 transition count 504
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 72 place count 244 transition count 481
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 244 transition count 481
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 102 place count 244 transition count 474
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 178 place count 168 transition count 398
Iterating global reduction 2 with 76 rules applied. Total rules applied 254 place count 168 transition count 398
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 370 place count 168 transition count 282
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 372 place count 166 transition count 256
Iterating global reduction 3 with 2 rules applied. Total rules applied 374 place count 166 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 375 place count 165 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 376 place count 165 transition count 255
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 380 place count 161 transition count 251
Iterating global reduction 3 with 4 rules applied. Total rules applied 384 place count 161 transition count 251
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 400 place count 161 transition count 235
Applied a total of 400 rules in 22 ms. Remains 161 /291 variables (removed 130) and now considering 235/1166 (removed 931) transitions.
// Phase 1: matrix 235 rows 161 cols
[2024-05-27 07:35:08] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:35:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:35:08] [INFO ] Invariant cache hit.
[2024-05-27 07:35:08] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-27 07:35:09] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-27 07:35:09] [INFO ] Invariant cache hit.
[2024-05-27 07:35:09] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/396 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 93/256 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-27 07:35:17] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-27 07:35:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:35:17] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/396 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-27 07:35:18] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:35:18] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 07:35:18] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 3/262 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/262 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/262 constraints. Problems are: Problem set: 20 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 262 constraints, problems are : Problem set: 20 solved, 214 unsolved in 16329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 8/153 variables, 1/4 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/5 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 235/388 variables, 153/158 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 93/251 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 41/292 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/292 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 11 (OVERLAPS) 8/396 variables, 8/300 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 173/473 constraints. Problems are: Problem set: 20 solved, 214 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 3/476 constraints. Problems are: Problem set: 20 solved, 214 unsolved
[2024-05-27 07:35:38] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
Problem TDEAD194 is UNSAT
[2024-05-27 07:35:40] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
[2024-05-27 07:35:40] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-05-27 07:35:40] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 4/480 constraints. Problems are: Problem set: 22 solved, 212 unsolved
[2024-05-27 07:35:44] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:35:44] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2024-05-27 07:35:46] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 3/483 constraints. Problems are: Problem set: 22 solved, 212 unsolved
[2024-05-27 07:35:52] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 1/484 constraints. Problems are: Problem set: 22 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 484 constraints, problems are : Problem set: 22 solved, 212 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 214/234 constraints, Known Traps: 14/14 constraints]
After SMT, in 46663ms problems are : Problem set: 22 solved, 212 unsolved
Search for dead transitions found 22 dead transitions in 46666ms
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 : 161/291 places, 213/1166 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 143 transition count 207
Applied a total of 24 rules in 3 ms. Remains 143 /161 variables (removed 18) and now considering 207/213 (removed 6) transitions.
// Phase 1: matrix 207 rows 143 cols
[2024-05-27 07:35:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:35:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:35:55] [INFO ] Invariant cache hit.
[2024-05-27 07:35:55] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-27 07:35:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/291 places, 207/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47477 ms. Remains : 143/291 places, 207/1166 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, (NOT p1), p0, (OR (NOT p1) p0), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-02 finished in 47709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(G(p1))||G(p2)||p0) U p3)||X(p1)))'
Support contains 5 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 507
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 268 transition count 506
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 246 transition count 484
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 246 transition count 484
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 246 transition count 477
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 174 place count 170 transition count 401
Iterating global reduction 2 with 76 rules applied. Total rules applied 250 place count 170 transition count 401
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 358 place count 170 transition count 293
Applied a total of 358 rules in 12 ms. Remains 170 /291 variables (removed 121) and now considering 293/1166 (removed 873) transitions.
// Phase 1: matrix 293 rows 170 cols
[2024-05-27 07:35:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:35:56] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-27 07:35:56] [INFO ] Invariant cache hit.
[2024-05-27 07:35:56] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 07:35:56] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-27 07:35:56] [INFO ] Invariant cache hit.
[2024-05-27 07:35:56] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-27 07:36:03] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 317 constraints, problems are : Problem set: 0 solved, 292 unsolved in 13466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/463 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 144/317 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 292/609 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-27 07:36:17] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 2 ms to minimize.
[2024-05-27 07:36:18] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-27 07:36:19] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-27 07:36:19] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-05-27 07:36:22] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
[2024-05-27 07:36:22] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:36:22] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 7/616 constraints. Problems are: Problem set: 22 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/616 constraints. Problems are: Problem set: 22 solved, 270 unsolved
[2024-05-27 07:36:39] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/463 variables, 1/617 constraints. Problems are: Problem set: 22 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 617 constraints, problems are : Problem set: 22 solved, 270 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 9/9 constraints]
After SMT, in 43938ms problems are : Problem set: 22 solved, 270 unsolved
Search for dead transitions found 22 dead transitions in 43943ms
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 : 170/291 places, 271/1166 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 152 transition count 265
Applied a total of 24 rules in 1 ms. Remains 152 /170 variables (removed 18) and now considering 265/271 (removed 6) transitions.
// Phase 1: matrix 265 rows 152 cols
[2024-05-27 07:36:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:36:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:36:40] [INFO ] Invariant cache hit.
[2024-05-27 07:36:41] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-27 07:36:41] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/291 places, 265/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44917 ms. Remains : 152/291 places, 265/1166 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-03 finished in 45335 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 U (!p1 U (G(!p1)||(!p1&&G(p0))))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 505
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 267 transition count 504
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 72 place count 244 transition count 481
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 244 transition count 481
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 102 place count 244 transition count 474
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 178 place count 168 transition count 398
Iterating global reduction 2 with 76 rules applied. Total rules applied 254 place count 168 transition count 398
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 366 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 367 place count 167 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 368 place count 167 transition count 273
Applied a total of 368 rules in 61 ms. Remains 167 /291 variables (removed 124) and now considering 273/1166 (removed 893) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:36:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:36:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:36:41] [INFO ] Invariant cache hit.
[2024-05-27 07:36:41] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:36:42] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-27 07:36:42] [INFO ] Redundant transitions in 17 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-27 07:36:42] [INFO ] Invariant cache hit.
[2024-05-27 07:36:42] [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
[2024-05-27 07:36:46] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:36:46] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:36:47] [INFO ] Deduced a trap composed of 61 places in 49 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 TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 3/298 constraints. Problems are: Problem set: 20 solved, 252 unsolved
[2024-05-27 07:36:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:36:51] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 2/300 constraints. Problems are: Problem set: 20 solved, 252 unsolved
[2024-05-27 07:36:52] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 5 ms to minimize.
Problem TDEAD236 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/301 constraints. Problems are: Problem set: 21 solved, 251 unsolved
[2024-05-27 07:36:54] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/302 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/302 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 11 (OVERLAPS) 0/440 variables, 0/302 constraints. Problems are: Problem set: 21 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 302 constraints, problems are : Problem set: 21 solved, 251 unsolved in 20995 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: 7/7 constraints]
Escalating to Integer solving :Problem set: 21 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 8/158 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 273/431 variables, 158/162 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 126/288 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 40/328 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/328 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 10 (OVERLAPS) 9/440 variables, 9/337 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 211/548 constraints. Problems are: Problem set: 21 solved, 251 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 5/553 constraints. Problems are: Problem set: 21 solved, 251 unsolved
[2024-05-27 07:37:22] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/554 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/554 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 554 constraints, problems are : Problem set: 22 solved, 250 unsolved in 30010 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: 251/272 constraints, Known Traps: 8/8 constraints]
After SMT, in 51411ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 51413ms
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/291 places, 251/1166 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.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 149 transition count 245
Applied a total of 7 rules in 13 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:37:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:37:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:37:33] [INFO ] Invariant cache hit.
[2024-05-27 07:37:33] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:37:34] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/291 places, 245/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52450 ms. Remains : 149/291 places, 245/1166 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, p1, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-04
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-04 finished in 52682 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((X(X(!G(X(G(p0))))) U p1)))'
Support contains 2 out of 291 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 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 505
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 267 transition count 504
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 72 place count 244 transition count 481
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 244 transition count 481
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 102 place count 244 transition count 474
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 178 place count 168 transition count 398
Iterating global reduction 2 with 76 rules applied. Total rules applied 254 place count 168 transition count 398
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 366 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 367 place count 167 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 368 place count 167 transition count 273
Applied a total of 368 rules in 35 ms. Remains 167 /291 variables (removed 124) and now considering 273/1166 (removed 893) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:37:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:37:34] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 07:37:34] [INFO ] Invariant cache hit.
[2024-05-27 07:37:34] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:37:35] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-27 07:37:35] [INFO ] Redundant transitions in 3 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-27 07:37:35] [INFO ] Invariant cache hit.
[2024-05-27 07:37:35] [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
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 9617 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-05-27 07:37:51] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-27 07:37:52] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:37:52] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 2 ms to minimize.
[2024-05-27 07:37:52] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:37:52] [INFO ] Deduced a trap composed of 65 places in 43 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
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:37:55] [INFO ] Deduced a trap composed of 65 places in 41 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-05-27 07:38:06] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/440 variables, 1/574 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 574 constraints, problems are : Problem set: 22 solved, 250 unsolved in 30010 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: 7/7 constraints]
After SMT, in 40052ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 40055ms
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/291 places, 251/1166 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.5 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 19 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:38:15] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:38:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:38:15] [INFO ] Invariant cache hit.
[2024-05-27 07:38:15] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:38:15] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/291 places, 245/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41084 ms. Remains : 149/291 places, 245/1166 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-06
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-06 finished in 41151 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||G(p1)))&&(p2 U !p3)))'
Support contains 6 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 269 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 269 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 269 transition count 541
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 66 place count 248 transition count 520
Iterating global reduction 1 with 21 rules applied. Total rules applied 87 place count 248 transition count 520
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 248 transition count 511
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 168 place count 176 transition count 439
Iterating global reduction 2 with 72 rules applied. Total rules applied 240 place count 176 transition count 439
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 360 place count 176 transition count 319
Applied a total of 360 rules in 33 ms. Remains 176 /291 variables (removed 115) and now considering 319/1166 (removed 847) transitions.
// Phase 1: matrix 319 rows 176 cols
[2024-05-27 07:38:15] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:38:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 07:38:15] [INFO ] Invariant cache hit.
[2024-05-27 07:38:15] [INFO ] State equation strengthened by 165 read => feed constraints.
[2024-05-27 07:38:16] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-27 07:38:16] [INFO ] Redundant transitions in 7 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-27 07:38:16] [INFO ] Invariant cache hit.
[2024-05-27 07:38:16] [INFO ] State equation strengthened by 165 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/495 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 165/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-27 07:38:27] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/495 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-27 07:38:28] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 07:38:28] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:38:29] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:38:29] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-27 07:38:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-27 07:38:30] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 6/350 constraints. Problems are: Problem set: 21 solved, 297 unsolved
[2024-05-27 07:38:32] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:38:34] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 2/352 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/352 constraints. Problems are: Problem set: 22 solved, 296 unsolved
[2024-05-27 07:38:42] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/495 variables, 1/353 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/353 constraints. Problems are: Problem set: 22 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 353 constraints, problems are : Problem set: 22 solved, 296 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 22 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 3/3 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 8/166 variables, 1/5 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/6 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 319/485 variables, 166/172 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 165/337 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 39/376 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/376 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 10/495 variables, 10/386 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 257/643 constraints. Problems are: Problem set: 22 solved, 296 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 6/649 constraints. Problems are: Problem set: 22 solved, 296 unsolved
[2024-05-27 07:39:16] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 650 constraints, problems are : Problem set: 22 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 296/318 constraints, Known Traps: 11/11 constraints]
After SMT, in 60634ms problems are : Problem set: 22 solved, 296 unsolved
Search for dead transitions found 22 dead transitions in 60639ms
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 : 176/291 places, 297/1166 transitions.
Graph (complete) has 633 edges and 176 vertex of which 158 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 158 transition count 291
Applied a total of 7 rules in 11 ms. Remains 158 /176 variables (removed 18) and now considering 291/297 (removed 6) transitions.
// Phase 1: matrix 291 rows 158 cols
[2024-05-27 07:39:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:39:16] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 07:39:16] [INFO ] Invariant cache hit.
[2024-05-27 07:39:17] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-27 07:39:17] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/291 places, 291/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61913 ms. Remains : 158/291 places, 291/1166 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR p3 (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), p3]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-07 finished in 62091 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((X(((G(p0) U p1)&&G(p2)))||G(p3))))'
Support contains 6 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 269 transition count 541
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 269 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 269 transition count 540
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 66 place count 248 transition count 519
Iterating global reduction 1 with 21 rules applied. Total rules applied 87 place count 248 transition count 519
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 248 transition count 513
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 165 place count 176 transition count 441
Iterating global reduction 2 with 72 rules applied. Total rules applied 237 place count 176 transition count 441
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 365 place count 176 transition count 313
Applied a total of 365 rules in 19 ms. Remains 176 /291 variables (removed 115) and now considering 313/1166 (removed 853) transitions.
// Phase 1: matrix 313 rows 176 cols
[2024-05-27 07:39:17] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:39:17] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:39:17] [INFO ] Invariant cache hit.
[2024-05-27 07:39:17] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-27 07:39:18] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-05-27 07:39:18] [INFO ] Invariant cache hit.
[2024-05-27 07:39:18] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/489 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 159/337 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-27 07:39:29] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 4 ms to minimize.
[2024-05-27 07:39:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/489 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-27 07:39:33] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 07:39:34] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:39:34] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/489 variables, 3/342 constraints. Problems are: Problem set: 20 solved, 292 unsolved
[2024-05-27 07:39:39] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:39:41] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 2/344 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 12 (OVERLAPS) 0/489 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 344 constraints, problems are : Problem set: 22 solved, 290 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 22 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 8/166 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 313/479 variables, 166/170 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 159/329 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 39/368 constraints. Problems are: Problem set: 22 solved, 290 unsolved
[2024-05-27 07:39:56] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/369 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/369 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 11 (OVERLAPS) 10/489 variables, 10/379 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 251/630 constraints. Problems are: Problem set: 22 solved, 290 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 5/635 constraints. Problems are: Problem set: 22 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 635 constraints, problems are : Problem set: 22 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 290/312 constraints, Known Traps: 8/8 constraints]
After SMT, in 60564ms problems are : Problem set: 22 solved, 290 unsolved
Search for dead transitions found 22 dead transitions in 60569ms
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 : 176/291 places, 291/1166 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 158 transition count 285
Applied a total of 24 rules in 3 ms. Remains 158 /176 variables (removed 18) and now considering 285/291 (removed 6) transitions.
// Phase 1: matrix 285 rows 158 cols
[2024-05-27 07:40:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:40:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 07:40:18] [INFO ] Invariant cache hit.
[2024-05-27 07:40:18] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-27 07:40:19] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/291 places, 285/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61597 ms. Remains : 158/291 places, 285/1166 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p2), (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p0) (NOT p3) p1 p2), (AND p0 (NOT p1) (NOT p3) (NOT p2)), false]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-08
Product exploration explored 100000 steps with 28679 reset in 430 ms.
Product exploration explored 100000 steps with 28691 reset in 343 ms.
Computed a total of 19 stabilizing places and 101 stable transitions
Graph (complete) has 607 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p1) p0 p2))), (X (NOT (OR (AND p3 p1 p2) (AND p3 p0 p2)))), (X (OR (AND p3 (NOT p1) (NOT p0)) (AND p3 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2)))), (X (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (X (NOT (AND p3 (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p2))), (X (X (NOT (OR (AND p3 p1 p2) (AND p3 p0 p2))))), (X (X (NOT (AND p3 p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p3 p1 p0) (AND p3 p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2))))), (X (X (NOT (OR (AND (NOT p3) p1 p0) (AND (NOT p3) p0 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 30 factoid took 145 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) p2 p3), true, (NOT p0), (NOT p1), (NOT p2), (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), (AND (NOT p0) p2 (NOT p3) p1)]
RANDOM walk for 40000 steps (7064 resets) in 693 ms. (57 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40004 steps (1170 resets) in 349 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1227 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1177 resets) in 391 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1163 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1179 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1132 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1127 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1141 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
[2024-05-27 07:40:21] [INFO ] Invariant cache hit.
[2024-05-27 07:40:21] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 195/264 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 443/443 variables, and 225 constraints, problems are : Problem set: 8 solved, 0 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 65/155 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p1) p0 p2))), (X (NOT (OR (AND p3 p1 p2) (AND p3 p0 p2)))), (X (OR (AND p3 (NOT p1) (NOT p0)) (AND p3 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2)))), (X (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (X (NOT (AND p3 (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p2))), (X (X (NOT (OR (AND p3 p1 p2) (AND p3 p0 p2))))), (X (X (NOT (AND p3 p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p3 p1 p0) (AND p3 p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2))))), (X (X (NOT (OR (AND (NOT p3) p1 p0) (AND (NOT p3) p0 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT p1))), (G (AND (OR (NOT p0) (NOT p3) (NOT p2)) (OR (NOT p1) (NOT p3) (NOT p2)))), (G (AND (OR (NOT p0) p3 (NOT p2)) (OR (NOT p1) p3 (NOT p2)))), (G (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) p3 p2))), (G (OR p0 (NOT p1) (NOT p3) (NOT p2))), (G (OR p0 (NOT p1) p3 (NOT p2))), (G (OR (NOT p1) p3 (NOT p2))), (G (OR (NOT p0) p1 p3 (NOT p2))), (G (OR (NOT p0) p1 (NOT p3) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p3) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2) p3))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p3)) (OR (NOT p0) (NOT p3) p2)))), (F p2), (F p1), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND p3 (NOT p2))))), (F (NOT (OR (NOT p0) p1))), (F (NOT p3)), (F (NOT (AND (OR p0 p1 p3) (OR p3 p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p0 p2) (AND p1 p2) p3)))
Knowledge based reduction with 38 factoid took 234 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-08 finished in 64606 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)&&F(G(p1))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 472
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 472
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 243 transition count 448
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 243 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 243 transition count 442
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 182 place count 163 transition count 362
Iterating global reduction 1 with 80 rules applied. Total rules applied 262 place count 163 transition count 362
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 362 place count 163 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 363 place count 162 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 364 place count 162 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 365 place count 161 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 161 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 370 place count 157 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 374 place count 157 transition count 244
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 390 place count 157 transition count 228
Applied a total of 390 rules in 30 ms. Remains 157 /291 variables (removed 134) and now considering 228/1166 (removed 938) transitions.
// Phase 1: matrix 228 rows 157 cols
[2024-05-27 07:40:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:40:22] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 07:40:22] [INFO ] Invariant cache hit.
[2024-05-27 07:40:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-27 07:40:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-27 07:40:22] [INFO ] Redundant transitions in 1 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-27 07:40:22] [INFO ] Invariant cache hit.
[2024-05-27 07:40:22] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/385 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 90/249 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 249 constraints, problems are : Problem set: 0 solved, 227 unsolved in 6915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/385 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 90/249 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 227/476 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-27 07:40:34] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-27 07:40:34] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:40:35] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-05-27 07:40:36] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
[2024-05-27 07:40:37] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:40:37] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 6/482 constraints. Problems are: Problem set: 22 solved, 205 unsolved
[2024-05-27 07:40:42] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/483 constraints. Problems are: Problem set: 22 solved, 205 unsolved
[2024-05-27 07:40:47] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/484 constraints. Problems are: Problem set: 22 solved, 205 unsolved
[2024-05-27 07:40:52] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/485 constraints. Problems are: Problem set: 22 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/485 constraints. Problems are: Problem set: 22 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 485 constraints, problems are : Problem set: 22 solved, 205 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 9/9 constraints]
After SMT, in 37266ms problems are : Problem set: 22 solved, 205 unsolved
Search for dead transitions found 22 dead transitions in 37269ms
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 : 157/291 places, 206/1166 transitions.
Graph (complete) has 507 edges and 157 vertex of which 139 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 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 139 transition count 200
Applied a total of 7 rules in 16 ms. Remains 139 /157 variables (removed 18) and now considering 200/206 (removed 6) transitions.
// Phase 1: matrix 200 rows 139 cols
[2024-05-27 07:41:00] [INFO ] Computed 2 invariants in 12 ms
[2024-05-27 07:41:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:41:00] [INFO ] Invariant cache hit.
[2024-05-27 07:41:00] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-27 07:41:00] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 139/291 places, 200/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38090 ms. Remains : 139/291 places, 200/1166 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-09 finished in 38239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U (!p1||G(F(p2))))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 539
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 268 transition count 538
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 246 transition count 516
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 246 transition count 516
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 99 place count 246 transition count 508
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 171 place count 174 transition count 436
Iterating global reduction 2 with 72 rules applied. Total rules applied 243 place count 174 transition count 436
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 355 place count 174 transition count 324
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 356 place count 173 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 173 transition count 311
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 172 transition count 310
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 172 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 172 transition count 309
Applied a total of 360 rules in 20 ms. Remains 172 /291 variables (removed 119) and now considering 309/1166 (removed 857) transitions.
// Phase 1: matrix 309 rows 172 cols
[2024-05-27 07:41:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:41:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:41:00] [INFO ] Invariant cache hit.
[2024-05-27 07:41:00] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-27 07:41:01] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-05-27 07:41:01] [INFO ] Invariant cache hit.
[2024-05-27 07:41:01] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/481 variables, 172/174 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 158/332 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 332 constraints, problems are : Problem set: 0 solved, 308 unsolved in 11415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/481 variables, 172/174 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 158/332 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 308/640 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-27 07:41:20] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-27 07:41:21] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-27 07:41:21] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
[2024-05-27 07:41:24] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
[2024-05-27 07:41:25] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:41:25] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:41:25] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 7/647 constraints. Problems are: Problem set: 22 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/647 constraints. Problems are: Problem set: 22 solved, 286 unsolved
[2024-05-27 07:41:38] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:41:42] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:41:42] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/481 variables, 3/650 constraints. Problems are: Problem set: 22 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 650 constraints, problems are : Problem set: 22 solved, 286 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 10/10 constraints]
After SMT, in 42004ms problems are : Problem set: 22 solved, 286 unsolved
Search for dead transitions found 22 dead transitions in 42008ms
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 : 172/291 places, 287/1166 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 154 transition count 281
Applied a total of 24 rules in 2 ms. Remains 154 /172 variables (removed 18) and now considering 281/287 (removed 6) transitions.
// Phase 1: matrix 281 rows 154 cols
[2024-05-27 07:41:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:41:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:41:43] [INFO ] Invariant cache hit.
[2024-05-27 07:41:43] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-27 07:41:43] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/291 places, 281/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43001 ms. Remains : 154/291 places, 281/1166 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 5 stabilizing places and 39 stable transitions
Graph (complete) has 596 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 12 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-11 finished in 43839 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 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 471
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 266 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 242 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 242 transition count 446
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 105 place count 242 transition count 440
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 185 place count 162 transition count 360
Iterating global reduction 2 with 80 rules applied. Total rules applied 265 place count 162 transition count 360
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 365 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 367 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 370 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 375 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 379 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 391 place count 155 transition count 217
Applied a total of 391 rules in 36 ms. Remains 155 /291 variables (removed 136) and now considering 217/1166 (removed 949) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:41:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:41:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:41:44] [INFO ] Invariant cache hit.
[2024-05-27 07:41:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:41:44] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-27 07:41:44] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-27 07:41:44] [INFO ] Invariant cache hit.
[2024-05-27 07:41:44] [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
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:41:50] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:41:51] [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-05-27 07:41:51] [INFO ] Deduced a trap composed of 62 places in 47 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
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/372 variables, 3/240 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/240 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:41:53] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:41:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:41:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 3/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 243 constraints, problems are : Problem set: 21 solved, 195 unsolved in 14611 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]
Escalating to Integer solving :Problem set: 21 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 8/146 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 217/363 variables, 146/150 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 80/230 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 40/270 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:42:03] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/271 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/271 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 9/372 variables, 9/280 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 155/435 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 4/439 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:42:12] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/440 constraints. Problems are: Problem set: 22 solved, 194 unsolved
[2024-05-27 07:42:20] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:42:21] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
[2024-05-27 07:42:21] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 3/443 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/443 constraints. Problems are: Problem set: 22 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 443 constraints, problems are : Problem set: 22 solved, 194 unsolved in 30013 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: 195/216 constraints, Known Traps: 11/11 constraints]
After SMT, in 44897ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 44899ms
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 : 155/291 places, 195/1166 transitions.
Graph (complete) has 494 edges and 155 vertex of which 137 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 137 transition count 189
Applied a total of 7 rules in 7 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:42:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:42:29] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:42:29] [INFO ] Invariant cache hit.
[2024-05-27 07:42:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:42:29] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/291 places, 189/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45638 ms. Remains : 137/291 places, 189/1166 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-13
Product exploration explored 100000 steps with 18557 reset in 139 ms.
Product exploration explored 100000 steps with 18503 reset in 191 ms.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 25 ms :[(NOT p0)]
RANDOM walk for 1600 steps (297 resets) in 12 ms. (123 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 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-27 07:42:30] [INFO ] Invariant cache hit.
[2024-05-27 07:42:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 07:42:30] [INFO ] Invariant cache hit.
[2024-05-27 07:42:30] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:42:30] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-27 07:42:30] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-27 07:42:30] [INFO ] Invariant cache hit.
[2024-05-27 07:42:30] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 5336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 403 constraints, problems are : Problem set: 0 solved, 188 unsolved in 10486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 16062ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 16066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16398 ms. Remains : 137/137 places, 189/189 transitions.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 :[(NOT p0)]
RANDOM walk for 988 steps (192 resets) in 12 ms. (76 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 99 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 170 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18538 reset in 147 ms.
Product exploration explored 100000 steps with 18460 reset in 145 ms.
Built C files in :
/tmp/ltsmin17294695413729177375
[2024-05-27 07:42:47] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2024-05-27 07:42:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:42:47] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2024-05-27 07:42:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:42:47] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2024-05-27 07:42:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:42:47] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294695413729177375
Running compilation step : cd /tmp/ltsmin17294695413729177375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 577 ms.
Running link step : cd /tmp/ltsmin17294695413729177375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17294695413729177375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2011443731587586757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-27 07:43:02] [INFO ] Invariant cache hit.
[2024-05-27 07:43:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:43:03] [INFO ] Invariant cache hit.
[2024-05-27 07:43:03] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:43:03] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-27 07:43:03] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-27 07:43:03] [INFO ] Invariant cache hit.
[2024-05-27 07:43:03] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 5215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 403 constraints, problems are : Problem set: 0 solved, 188 unsolved in 10341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 15798ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 15800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16137 ms. Remains : 137/137 places, 189/189 transitions.
Built C files in :
/tmp/ltsmin2526368679823217037
[2024-05-27 07:43:19] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2024-05-27 07:43:19] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:43:19] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2024-05-27 07:43:19] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:43:19] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2024-05-27 07:43:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:43:19] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2526368679823217037
Running compilation step : cd /tmp/ltsmin2526368679823217037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 448 ms.
Running link step : cd /tmp/ltsmin2526368679823217037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2526368679823217037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9935306131068478535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 07:43:34] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:43:34] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:43:34] [INFO ] Time to serialize gal into /tmp/LTL7887683124462826312.gal : 2 ms
[2024-05-27 07:43:34] [INFO ] Time to serialize properties into /tmp/LTL9936570268287777028.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7887683124462826312.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3400201276707849702.hoa' '-atoms' '/tmp/LTL9936570268287777028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9936570268287777028.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3400201276707849702.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t43, t44, t45, t46, t72, t73, t74, t75, t76, t77, t78, t79, t80, t182, t185, t188, t...681
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-27 07:43:49] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:43:49] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:43:49] [INFO ] Time to serialize gal into /tmp/LTL10815592839624820749.gal : 4 ms
[2024-05-27 07:43:49] [INFO ] Time to serialize properties into /tmp/LTL1655985694562779983.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10815592839624820749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1655985694562779983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l3915<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3915<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t43, t44, t45, t46, t72, t73, t74, t75, t76, t77, t78, t79, t80, t182, t185, t188, t...681
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-27 07:44:04] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:44:04] [INFO ] Applying decomposition
[2024-05-27 07:44:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10557473297314470269.txt' '-o' '/tmp/graph10557473297314470269.bin' '-w' '/tmp/graph10557473297314470269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10557473297314470269.bin' '-l' '-1' '-v' '-w' '/tmp/graph10557473297314470269.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:44:04] [INFO ] Decomposing Gal with order
[2024-05-27 07:44:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:44:04] [INFO ] Removed a total of 175 redundant transitions.
[2024-05-27 07:44:04] [INFO ] Flatten gal took : 55 ms
[2024-05-27 07:44:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 11 ms.
[2024-05-27 07:44:04] [INFO ] Time to serialize gal into /tmp/LTL15751747248370985317.gal : 4 ms
[2024-05-27 07:44:04] [INFO ] Time to serialize properties into /tmp/LTL13748941955496827349.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15751747248370985317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13748941955496827349.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i7.u0.s1<1)||(i4.u4.l3915<1))"))))
Formula 0 simplified : GF!"((i7.u0.s1<1)||(i4.u4.l3915<1))"
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-13 finished in 155368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 472
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 267 transition count 471
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 72 place count 244 transition count 448
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 244 transition count 448
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 244 transition count 444
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 179 place count 164 transition count 364
Iterating global reduction 2 with 80 rules applied. Total rules applied 259 place count 164 transition count 364
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 359 place count 164 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 360 place count 163 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 163 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 362 place count 162 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 363 place count 162 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 364 place count 162 transition count 249
Applied a total of 364 rules in 27 ms. Remains 162 /291 variables (removed 129) and now considering 249/1166 (removed 917) transitions.
// Phase 1: matrix 249 rows 162 cols
[2024-05-27 07:44:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:44:19] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 07:44:19] [INFO ] Invariant cache hit.
[2024-05-27 07:44:19] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 07:44:20] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-27 07:44:20] [INFO ] Redundant transitions in 2 ms returned []
Running 248 sub problems to find dead transitions.
[2024-05-27 07:44:20] [INFO ] Invariant cache hit.
[2024-05-27 07:44:20] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 270 constraints, problems are : Problem set: 0 solved, 248 unsolved in 8142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 248/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-27 07:44:33] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:44:34] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 4 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:44:34] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 10 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 07:44:36] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-05-27 07:44:36] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:44:37] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 6/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
[2024-05-27 07:44:43] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:44:43] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 2/526 constraints. Problems are: Problem set: 22 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/526 constraints. Problems are: Problem set: 22 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/526 constraints. Problems are: Problem set: 22 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 526 constraints, problems are : Problem set: 22 solved, 226 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: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 8/8 constraints]
After SMT, in 38572ms problems are : Problem set: 22 solved, 226 unsolved
Search for dead transitions found 22 dead transitions in 38576ms
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 : 162/291 places, 227/1166 transitions.
Graph (complete) has 538 edges and 162 vertex of which 144 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 144 transition count 221
Applied a total of 7 rules in 9 ms. Remains 144 /162 variables (removed 18) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 144 cols
[2024-05-27 07:44:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:44:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:44:58] [INFO ] Invariant cache hit.
[2024-05-27 07:44:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 07:44:59] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/291 places, 221/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39371 ms. Remains : 144/291 places, 221/1166 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-14 finished in 39488 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(X((p0&&G(p1))))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 1166/1166 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 267 transition count 504
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 267 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 267 transition count 503
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 72 place count 244 transition count 480
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 244 transition count 480
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 244 transition count 474
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 177 place count 168 transition count 398
Iterating global reduction 2 with 76 rules applied. Total rules applied 253 place count 168 transition count 398
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 369 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 370 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 167 transition count 269
Applied a total of 371 rules in 15 ms. Remains 167 /291 variables (removed 124) and now considering 269/1166 (removed 897) transitions.
// Phase 1: matrix 269 rows 167 cols
[2024-05-27 07:44:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:44:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 07:44:59] [INFO ] Invariant cache hit.
[2024-05-27 07:44:59] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:44:59] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-27 07:44:59] [INFO ] Invariant cache hit.
[2024-05-27 07:44:59] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 291 constraints, problems are : Problem set: 0 solved, 268 unsolved in 9275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 268/559 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-27 07:45:16] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:45:17] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:45:17] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:45:17] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-05-27 07:45:20] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:45:20] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 6/565 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-27 07:45:26] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/566 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-27 07:45:34] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/567 constraints. Problems are: Problem set: 22 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 567 constraints, problems are : Problem set: 22 solved, 246 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 8/8 constraints]
After SMT, in 39723ms problems are : Problem set: 22 solved, 246 unsolved
Search for dead transitions found 22 dead transitions in 39727ms
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/291 places, 247/1166 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 241
Applied a total of 24 rules in 3 ms. Remains 149 /167 variables (removed 18) and now considering 241/247 (removed 6) transitions.
// Phase 1: matrix 241 rows 149 cols
[2024-05-27 07:45:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:45:39] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 07:45:39] [INFO ] Invariant cache hit.
[2024-05-27 07:45:39] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-27 07:45:39] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/291 places, 241/1166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40717 ms. Remains : 149/291 places, 241/1166 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-15
Entered a terminal (fully accepting) state of product in 36 steps with 5 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-15 finished in 40947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-27 07:45:40] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11712012471879683445
[2024-05-27 07:45:40] [INFO ] Computing symmetric may disable matrix : 1166 transitions.
[2024-05-27 07:45:40] [INFO ] Applying decomposition
[2024-05-27 07:45:40] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:45:40] [INFO ] Flatten gal took : 35 ms
[2024-05-27 07:45:40] [INFO ] Computing symmetric may enable matrix : 1166 transitions.
[2024-05-27 07:45:40] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5566245751249104160.txt' '-o' '/tmp/graph5566245751249104160.bin' '-w' '/tmp/graph5566245751249104160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5566245751249104160.bin' '-l' '-1' '-v' '-w' '/tmp/graph5566245751249104160.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:45:40] [INFO ] Decomposing Gal with order
[2024-05-27 07:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:45:40] [INFO ] Removed a total of 1037 redundant transitions.
[2024-05-27 07:45:40] [INFO ] Flatten gal took : 157 ms
[2024-05-27 07:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 810 labels/synchronizations in 38 ms.
[2024-05-27 07:45:40] [INFO ] Time to serialize gal into /tmp/LTLFireability12296329107265988643.gal : 8 ms
[2024-05-27 07:45:40] [INFO ] Time to serialize properties into /tmp/LTLFireability3169073986275659880.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12296329107265988643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3169073986275659880.ltl' '-c' '-stutter-deadlock'
[2024-05-27 07:45:40] [INFO ] Computing Do-Not-Accords matrix : 1166 transitions.

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2024-05-27 07:45:40] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((F(G("((u0.s1<1)||(u0.l3915<1))"))))
Formula 0 simplified : GF!"((u0.s1<1)||(u0.l3915<1))"
[2024-05-27 07:45:40] [INFO ] Built C files in 511ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11712012471879683445
Running compilation step : cd /tmp/ltsmin11712012471879683445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4754 ms.
Running link step : cd /tmp/ltsmin11712012471879683445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin11712012471879683445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 08:09:46] [INFO ] Flatten gal took : 72 ms
[2024-05-27 08:09:46] [INFO ] Time to serialize gal into /tmp/LTLFireability511284116196754685.gal : 21 ms
[2024-05-27 08:09:46] [INFO ] Time to serialize properties into /tmp/LTLFireability11300028649897821846.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability511284116196754685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11300028649897821846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l3915<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3915<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t15, t16, t17, t34, t35, t36, t37, t42, t43, t44, t45, t46, t56, t57, t58, t59, t72,...5376
Computing Next relation with stutter on 2.67206e+08 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
20197 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,202.08,2218232,1,0,1315,5.92623e+06,20,661,6114,3.87246e+06,282
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2643677 ms.

BK_STOP 1716797847244

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m010, 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 r334-tall-171679079500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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