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-171679079600100.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-d1m160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079600100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 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-d1m160-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716800196089

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-d1m160
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 08:56:37] [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 08:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:56:37] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2024-05-27 08:56:37] [INFO ] Transformed 6690 places.
[2024-05-27 08:56:37] [INFO ] Transformed 11934 transitions.
[2024-05-27 08:56:37] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4305 places in 39 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 1090 places :
Symmetric choice reduction at 1 with 1090 rule applications. Total rules 1209 place count 1278 transition count 6790
Iterating global reduction 1 with 1090 rules applied. Total rules applied 2299 place count 1278 transition count 6790
Ensure Unique test removed 264 transitions
Reduce isomorphic transitions removed 264 transitions.
Iterating post reduction 1 with 264 rules applied. Total rules applied 2563 place count 1278 transition count 6526
Discarding 925 places :
Symmetric choice reduction at 2 with 925 rule applications. Total rules 3488 place count 353 transition count 5601
Iterating global reduction 2 with 925 rules applied. Total rules applied 4413 place count 353 transition count 5601
Ensure Unique test removed 4464 transitions
Reduce isomorphic transitions removed 4464 transitions.
Iterating post reduction 2 with 4464 rules applied. Total rules applied 8877 place count 353 transition count 1137
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 8943 place count 287 transition count 1071
Iterating global reduction 3 with 66 rules applied. Total rules applied 9009 place count 287 transition count 1071
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 9171 place count 287 transition count 909
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9179 place count 279 transition count 901
Iterating global reduction 4 with 8 rules applied. Total rules applied 9187 place count 279 transition count 901
Applied a total of 9187 rules in 339 ms. Remains 279 /2385 variables (removed 2106) and now considering 901/11934 (removed 11033) transitions.
// Phase 1: matrix 901 rows 279 cols
[2024-05-27 08:56:38] [INFO ] Computed 3 invariants in 31 ms
[2024-05-27 08:56:38] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-27 08:56:38] [INFO ] Invariant cache hit.
[2024-05-27 08:56:39] [INFO ] State equation strengthened by 649 read => feed constraints.
[2024-05-27 08:56:40] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 900 sub problems to find dead transitions.
[2024-05-27 08:56:40] [INFO ] Invariant cache hit.
[2024-05-27 08:56:40] [INFO ] State equation strengthened by 649 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 900 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
At refinement iteration 4 (OVERLAPS) 901/1180 variables, 279/282 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1180 variables, 649/931 constraints. Problems are: Problem set: 24 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 931 constraints, problems are : Problem set: 24 solved, 876 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, ReadFeed: 649/649 constraints, PredecessorRefiner: 900/900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 876 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 17/271 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 3 (OVERLAPS) 8/279 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 5 (OVERLAPS) 901/1180 variables, 279/282 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1180 variables, 649/931 constraints. Problems are: Problem set: 24 solved, 876 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1180 variables, 876/1807 constraints. Problems are: Problem set: 24 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 1807 constraints, problems are : Problem set: 24 solved, 876 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, ReadFeed: 649/649 constraints, PredecessorRefiner: 876/900 constraints, Known Traps: 0/0 constraints]
After SMT, in 63424ms problems are : Problem set: 24 solved, 876 unsolved
Search for dead transitions found 24 dead transitions in 63445ms
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 : 279/2385 places, 877/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 255 transition count 865
Applied a total of 36 rules in 6 ms. Remains 255 /279 variables (removed 24) and now considering 865/877 (removed 12) transitions.
// Phase 1: matrix 865 rows 255 cols
[2024-05-27 08:57:43] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:57:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-27 08:57:43] [INFO ] Invariant cache hit.
[2024-05-27 08:57:44] [INFO ] State equation strengthened by 645 read => feed constraints.
[2024-05-27 08:57:44] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 255/2385 places, 865/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66829 ms. Remains : 255/2385 places, 865/11934 transitions.
Support contains 22 out of 255 places after structural reductions.
[2024-05-27 08:57:45] [INFO ] Flatten gal took : 102 ms
[2024-05-27 08:57:45] [INFO ] Flatten gal took : 64 ms
[2024-05-27 08:57:45] [INFO ] Input system was already deterministic with 865 transitions.
RANDOM walk for 40000 steps (6887 resets) in 2157 ms. (18 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (948 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (881 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2024-05-27 08:57:46] [INFO ] Invariant cache hit.
[2024-05-27 08:57:46] [INFO ] State equation strengthened by 645 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 65/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/439 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 142/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 1120/1120 variables, and 399 constraints, problems are : Problem set: 2 solved, 0 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 255/255 constraints, ReadFeed: 142/645 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 55 stabilizing places and 367 stable transitions
Graph (complete) has 1378 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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 U (F(!p1) U p2))&&G((p3||X(G(p2)))))))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 241 transition count 505
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 241 transition count 505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 241 transition count 502
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 228 transition count 489
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 228 transition count 489
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 228 transition count 486
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 108 place count 180 transition count 438
Iterating global reduction 2 with 48 rules applied. Total rules applied 156 place count 180 transition count 438
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 244 place count 180 transition count 350
Applied a total of 244 rules in 59 ms. Remains 180 /255 variables (removed 75) and now considering 350/865 (removed 515) transitions.
// Phase 1: matrix 350 rows 180 cols
[2024-05-27 08:57:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:57:47] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-27 08:57:47] [INFO ] Invariant cache hit.
[2024-05-27 08:57:47] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-27 08:57:47] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-27 08:57:47] [INFO ] Redundant transitions in 23 ms returned []
Running 349 sub problems to find dead transitions.
[2024-05-27 08:57:47] [INFO ] Invariant cache hit.
[2024-05-27 08:57:47] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 350/530 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 193/375 constraints. Problems are: Problem set: 0 solved, 349 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 375 constraints, problems are : Problem set: 0 solved, 349 unsolved in 12896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 350/530 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 193/375 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 349/724 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-05-27 08:58:09] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 7 ms to minimize.
[2024-05-27 08:58:10] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-27 08:58:10] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
[2024-05-27 08:58:14] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
[2024-05-27 08:58:14] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-27 08:58:15] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 6/730 constraints. Problems are: Problem set: 22 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/730 constraints. Problems are: Problem set: 22 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 730 constraints, problems are : Problem set: 22 solved, 327 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 6/6 constraints]
After SMT, in 43570ms problems are : Problem set: 22 solved, 327 unsolved
Search for dead transitions found 22 dead transitions in 43574ms
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 : 180/255 places, 328/865 transitions.
Graph (complete) has 671 edges and 180 vertex of which 162 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 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 162 transition count 322
Applied a total of 7 rules in 25 ms. Remains 162 /180 variables (removed 18) and now considering 322/328 (removed 6) transitions.
// Phase 1: matrix 322 rows 162 cols
[2024-05-27 08:58:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:58:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 08:58:31] [INFO ] Invariant cache hit.
[2024-05-27 08:58:31] [INFO ] State equation strengthened by 189 read => feed constraints.
[2024-05-27 08:58:32] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/255 places, 322/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45080 ms. Remains : 162/255 places, 322/865 transitions.
Stuttering acceptance computed with spot in 876 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 finished in 46032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 239 transition count 443
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 239 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 239 transition count 442
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 48 place count 224 transition count 427
Iterating global reduction 1 with 15 rules applied. Total rules applied 63 place count 224 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 224 transition count 426
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 120 place count 168 transition count 370
Iterating global reduction 2 with 56 rules applied. Total rules applied 176 place count 168 transition count 370
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 264 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 265 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 266 place count 167 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 267 place count 166 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 166 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 272 place count 162 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 162 transition count 264
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 296 place count 162 transition count 244
Applied a total of 296 rules in 36 ms. Remains 162 /255 variables (removed 93) and now considering 244/865 (removed 621) transitions.
// Phase 1: matrix 244 rows 162 cols
[2024-05-27 08:58:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:58:33] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-27 08:58:33] [INFO ] Invariant cache hit.
[2024-05-27 08:58:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:58:33] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-27 08:58:33] [INFO ] Redundant transitions in 4 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-27 08:58:33] [INFO ] Invariant cache hit.
[2024-05-27 08:58:33] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 8074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 243/509 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-27 08:58:47] [INFO ] Deduced a trap composed of 49 places in 36 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 08:58:47] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:58:47] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:58:49] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-27 08:58:49] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-05-27 08:58:49] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 515 constraints, problems are : Problem set: 22 solved, 221 unsolved in 21838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 6/6 constraints]
After SMT, in 30260ms problems are : Problem set: 22 solved, 221 unsolved
Search for dead transitions found 22 dead transitions in 30262ms
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/255 places, 222/865 transitions.
Graph (complete) has 532 edges and 162 vertex of which 144 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 144 transition count 216
Applied a total of 7 rules in 8 ms. Remains 144 /162 variables (removed 18) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:59:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:59:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 08:59:04] [INFO ] Invariant cache hit.
[2024-05-27 08:59:04] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:59:04] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/255 places, 216/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31292 ms. Remains : 144/255 places, 216/865 transitions.
Stuttering acceptance computed with spot in 257 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-01
Product exploration explored 100000 steps with 36396 reset in 307 ms.
Product exploration explored 100000 steps with 36486 reset in 251 ms.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
RANDOM walk for 40000 steps (7271 resets) in 142 ms. (279 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (1325 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-27 08:59:05] [INFO ] Invariant cache hit.
[2024-05-27 08:59:05] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/223 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 38/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 360/360 variables, and 184 constraints, problems are : Problem set: 1 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 38/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Support contains 2 out of 144 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 : 144/144 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:59:06] [INFO ] Invariant cache hit.
[2024-05-27 08:59:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 08:59:06] [INFO ] Invariant cache hit.
[2024-05-27 08:59:06] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:59:06] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-27 08:59:06] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-27 08:59:06] [INFO ] Invariant cache hit.
[2024-05-27 08:59:06] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 244 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 459 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20057ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20395 ms. Remains : 144/144 places, 216/216 transitions.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
RANDOM walk for 1217 steps (236 resets) in 12 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Product exploration explored 100000 steps with 18429 reset in 174 ms.
Product exploration explored 100000 steps with 18561 reset in 222 ms.
Built C files in :
/tmp/ltsmin4625843993410747528
[2024-05-27 08:59:27] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-27 08:59:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:27] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-27 08:59:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:27] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-27 08:59:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:27] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4625843993410747528
Running compilation step : cd /tmp/ltsmin4625843993410747528;'/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 604 ms.
Running link step : cd /tmp/ltsmin4625843993410747528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4625843993410747528;'/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/stateBased16042367356177179317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 142 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 142 transition count 206
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 138 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 138 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 137 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 137 transition count 189
Applied a total of 18 rules in 12 ms. Remains 137 /144 variables (removed 7) and now considering 189/216 (removed 27) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:59:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:59:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 08:59:42] [INFO ] Invariant cache hit.
[2024-05-27 08:59:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:59:42] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-27 08:59:42] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-27 08:59:42] [INFO ] Invariant cache hit.
[2024-05-27 08:59:42] [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
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 5261 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 10327 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 15842ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 15846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/144 places, 189/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16162 ms. Remains : 137/144 places, 189/216 transitions.
Built C files in :
/tmp/ltsmin17867957620943170789
[2024-05-27 08:59:58] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2024-05-27 08:59:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:58] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2024-05-27 08:59:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:58] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2024-05-27 08:59:58] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:59:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17867957620943170789
Running compilation step : cd /tmp/ltsmin17867957620943170789;'/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 445 ms.
Running link step : cd /tmp/ltsmin17867957620943170789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17867957620943170789;'/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/stateBased8214912902727607743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 09:00:13] [INFO ] Flatten gal took : 10 ms
[2024-05-27 09:00:13] [INFO ] Flatten gal took : 9 ms
[2024-05-27 09:00:13] [INFO ] Time to serialize gal into /tmp/LTL5612929974007619540.gal : 2 ms
[2024-05-27 09:00:13] [INFO ] Time to serialize properties into /tmp/LTL9154822464714531566.prop : 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/LTL5612929974007619540.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7282303538424470935.hoa' '-atoms' '/tmp/LTL9154822464714531566.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/LTL9154822464714531566.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7282303538424470935.hoa
Detected timeout of ITS tools.
[2024-05-27 09:00:28] [INFO ] Flatten gal took : 9 ms
[2024-05-27 09:00:28] [INFO ] Flatten gal took : 9 ms
[2024-05-27 09:00:28] [INFO ] Time to serialize gal into /tmp/LTL8570624972450053857.gal : 2 ms
[2024-05-27 09:00:28] [INFO ] Time to serialize properties into /tmp/LTL6201202298199763390.ltl : 2 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/LTL8570624972450053857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6201202298199763390.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F((X((F("((s1<1)||(l3919<1))"))||(G("((s1<1)||(l3917<1))"))))&&("((s1<1)||(l3917<1))")))))
Formula 0 simplified : FG(!"((s1<1)||(l3917<1))" | X(G!"((s1<1)||(l3919<1))" & F!"((s1<1)||(l3917<1))"))
Detected timeout of ITS tools.
[2024-05-27 09:00:44] [INFO ] Flatten gal took : 13 ms
[2024-05-27 09:00:44] [INFO ] Applying decomposition
[2024-05-27 09:00:44] [INFO ] Flatten gal took : 9 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/graph14174426924096928727.txt' '-o' '/tmp/graph14174426924096928727.bin' '-w' '/tmp/graph14174426924096928727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14174426924096928727.bin' '-l' '-1' '-v' '-w' '/tmp/graph14174426924096928727.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:00:44] [INFO ] Decomposing Gal with order
[2024-05-27 09:00:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:00:44] [INFO ] Removed a total of 220 redundant transitions.
[2024-05-27 09:00:44] [INFO ] Flatten gal took : 56 ms
[2024-05-27 09:00:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 11 ms.
[2024-05-27 09:00:44] [INFO ] Time to serialize gal into /tmp/LTL8920355705826645081.gal : 4 ms
[2024-05-27 09:00:44] [INFO ] Time to serialize properties into /tmp/LTL13366124651490916519.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/LTL8920355705826645081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13366124651490916519.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((F("((i6.u2.s1<1)||(i0.u0.l3919<1))"))||(G("((i6.u2.s1<1)||(i0.u0.l3917<1))"))))&&("((i6.u2.s1<1)||(i0.u0.l3917<1))")))))
Formula 0 simplified : FG(!"((i6.u2.s1<1)||(i0.u0.l3917<1))" | X(G!"((i6.u2.s1<1)||(i0.u0.l3919<1))" & F!"((i6.u2.s1<1)||(i0.u0.l3917<1))"))
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 finished in 146159 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)&&(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 240 transition count 446
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 240 transition count 446
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 225 transition count 431
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 225 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 225 transition count 429
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 118 place count 169 transition count 373
Iterating global reduction 1 with 56 rules applied. Total rules applied 174 place count 169 transition count 373
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 262 place count 169 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 168 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 168 transition count 272
Applied a total of 264 rules in 27 ms. Remains 168 /255 variables (removed 87) and now considering 272/865 (removed 593) transitions.
// Phase 1: matrix 272 rows 168 cols
[2024-05-27 09:00:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 09:00:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 09:00:59] [INFO ] Invariant cache hit.
[2024-05-27 09:00:59] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 09:00:59] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-27 09:00:59] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-27 09:00:59] [INFO ] Invariant cache hit.
[2024-05-27 09:00:59] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/440 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 124/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 294 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/440 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 124/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 271/565 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-27 09:01:15] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 7 ms to minimize.
[2024-05-27 09:01:15] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-27 09:01:16] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 4 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
[2024-05-27 09:01:18] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
[2024-05-27 09:01:18] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 5/570 constraints. Problems are: Problem set: 22 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/570 constraints. Problems are: Problem set: 22 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/570 constraints. Problems are: Problem set: 22 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 570 constraints, problems are : Problem set: 22 solved, 249 unsolved in 26002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints]
After SMT, in 36097ms problems are : Problem set: 22 solved, 249 unsolved
Search for dead transitions found 22 dead transitions in 36099ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/255 places, 250/865 transitions.
Graph (complete) has 573 edges and 168 vertex of which 150 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 150 transition count 244
Applied a total of 7 rules in 8 ms. Remains 150 /168 variables (removed 18) and now considering 244/250 (removed 6) transitions.
// Phase 1: matrix 244 rows 150 cols
[2024-05-27 09:01:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 09:01:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 09:01:36] [INFO ] Invariant cache hit.
[2024-05-27 09:01:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 09:01:36] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/255 places, 244/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37182 ms. Remains : 150/255 places, 244/865 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 finished in 37332 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(((G(p0) U X(p1))&&F(p2))))'
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 240 transition count 474
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 240 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 240 transition count 472
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 226 transition count 458
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 226 transition count 458
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 226 transition count 456
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 114 place count 174 transition count 404
Iterating global reduction 2 with 52 rules applied. Total rules applied 166 place count 174 transition count 404
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 250 place count 174 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 173 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 173 transition count 307
Applied a total of 252 rules in 17 ms. Remains 173 /255 variables (removed 82) and now considering 307/865 (removed 558) transitions.
// Phase 1: matrix 307 rows 173 cols
[2024-05-27 09:01:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 09:01:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 09:01:36] [INFO ] Invariant cache hit.
[2024-05-27 09:01:36] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-27 09:01:37] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-27 09:01:37] [INFO ] Invariant cache hit.
[2024-05-27 09:01:37] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 330 constraints, problems are : Problem set: 0 solved, 306 unsolved in 10466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 306/636 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-27 09:01:55] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 09:01:55] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
[2024-05-27 09:01:58] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 3 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
[2024-05-27 09:01:58] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-27 09:01:58] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 5/641 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/641 constraints. Problems are: Problem set: 22 solved, 284 unsolved
[2024-05-27 09:02:08] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-05-27 09:02:13] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/480 variables, 2/643 constraints. Problems are: Problem set: 22 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 643 constraints, problems are : Problem set: 22 solved, 284 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints]
After SMT, in 40945ms problems are : Problem set: 22 solved, 284 unsolved
Search for dead transitions found 22 dead transitions in 40953ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/255 places, 285/865 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 279
Applied a total of 24 rules in 3 ms. Remains 155 /173 variables (removed 18) and now considering 279/285 (removed 6) transitions.
// Phase 1: matrix 279 rows 155 cols
[2024-05-27 09:02:18] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 09:02:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 09:02:18] [INFO ] Invariant cache hit.
[2024-05-27 09:02:18] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-05-27 09:02:18] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/255 places, 279/865 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42093 ms. Remains : 155/255 places, 279/865 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 finished in 42297 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((X(F(p1))||p0))))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 240 transition count 446
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 240 transition count 446
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 240 transition count 444
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 226 transition count 430
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 226 transition count 430
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 116 place count 170 transition count 374
Iterating global reduction 1 with 56 rules applied. Total rules applied 172 place count 170 transition count 374
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 256 place count 170 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 169 transition count 277
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 169 transition count 277
Applied a total of 258 rules in 23 ms. Remains 169 /255 variables (removed 86) and now considering 277/865 (removed 588) transitions.
// Phase 1: matrix 277 rows 169 cols
[2024-05-27 09:02:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 09:02:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 09:02:18] [INFO ] Invariant cache hit.
[2024-05-27 09:02:19] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-27 09:02:19] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 09:02:19] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-05-27 09:02:19] [INFO ] Invariant cache hit.
[2024-05-27 09:02:19] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/446 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 128/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 299 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/446 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 128/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 276/575 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-27 09:02:34] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-05-27 09:02:35] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
[2024-05-27 09:02:38] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
[2024-05-27 09:02:38] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
[2024-05-27 09:02:38] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-27 09:02:38] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 6/581 constraints. Problems are: Problem set: 22 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/581 constraints. Problems are: Problem set: 22 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/581 constraints. Problems are: Problem set: 22 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 581 constraints, problems are : Problem set: 22 solved, 254 unsolved in 26762 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 6/6 constraints]
After SMT, in 36510ms problems are : Problem set: 22 solved, 254 unsolved
Search for dead transitions found 22 dead transitions in 36514ms
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 : 169/255 places, 255/865 transitions.
Graph (complete) has 580 edges and 169 vertex of which 151 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 151 transition count 249
Applied a total of 7 rules in 13 ms. Remains 151 /169 variables (removed 18) and now considering 249/255 (removed 6) transitions.
// Phase 1: matrix 249 rows 151 cols
[2024-05-27 09:02:55] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 09:02:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 09:02:56] [INFO ] Invariant cache hit.
[2024-05-27 09:02:56] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 09:02:56] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/255 places, 249/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37424 ms. Remains : 151/255 places, 249/865 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-08
Product exploration explored 100000 steps with 18021 reset in 238 ms.
Product exploration explored 100000 steps with 17952 reset in 248 ms.
Computed a total of 12 stabilizing places and 66 stable transitions
Graph (complete) has 560 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7256 resets) in 275 ms. (144 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1160 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2024-05-27 09:02:57] [INFO ] Invariant cache hit.
[2024-05-27 09:02:57] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/244 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 51/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 400/400 variables, and 204 constraints, problems are : Problem set: 1 solved, 0 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 51/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 151 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 : 151/151 places, 249/249 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-27 09:02:57] [INFO ] Invariant cache hit.
[2024-05-27 09:02:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 09:02:57] [INFO ] Invariant cache hit.
[2024-05-27 09:02:57] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 09:02:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-27 09:02:58] [INFO ] Redundant transitions in 0 ms returned []
Running 248 sub problems to find dead transitions.
[2024-05-27 09:02:58] [INFO ] Invariant cache hit.
[2024-05-27 09:02:58] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/400 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 124/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 277 constraints, problems are : Problem set: 0 solved, 248 unsolved in 7809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 124/124 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/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/400 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 124/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 248/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 525 constraints, problems are : Problem set: 0 solved, 248 unsolved in 16500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 24625ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 24628ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24984 ms. Remains : 151/151 places, 249/249 transitions.
Computed a total of 12 stabilizing places and 66 stable transitions
Graph (complete) has 560 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 66 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 16169 steps (2976 resets) in 47 ms. (336 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18135 reset in 192 ms.
Product exploration explored 100000 steps with 18196 reset in 213 ms.
Built C files in :
/tmp/ltsmin6718141501813444080
[2024-05-27 09:03:23] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2024-05-27 09:03:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:23] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2024-05-27 09:03:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:23] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2024-05-27 09:03:23] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:23] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6718141501813444080
Running compilation step : cd /tmp/ltsmin6718141501813444080;'/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 595 ms.
Running link step : cd /tmp/ltsmin6718141501813444080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6718141501813444080;'/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/stateBased344376541907822239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 249/249 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 149 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 149 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 147 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 147 transition count 216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 16 place count 139 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 139 transition count 208
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 139 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 138 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 137 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 137 transition count 185
Applied a total of 37 rules in 22 ms. Remains 137 /151 variables (removed 14) and now considering 185/249 (removed 64) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 09:03:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 09:03:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 09:03:38] [INFO ] Invariant cache hit.
[2024-05-27 09:03:38] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 09:03:39] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-27 09:03:39] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 09:03:39] [INFO ] Invariant cache hit.
[2024-05-27 09:03:39] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 394 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 15295ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 15297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/151 places, 185/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15604 ms. Remains : 137/151 places, 185/249 transitions.
Built C files in :
/tmp/ltsmin1010517242955408577
[2024-05-27 09:03:54] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-27 09:03:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:54] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-27 09:03:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:54] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-27 09:03:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:03:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1010517242955408577
Running compilation step : cd /tmp/ltsmin1010517242955408577;'/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 431 ms.
Running link step : cd /tmp/ltsmin1010517242955408577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1010517242955408577;'/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/stateBased3315880582180753456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 09:04:09] [INFO ] Flatten gal took : 8 ms
[2024-05-27 09:04:09] [INFO ] Flatten gal took : 7 ms
[2024-05-27 09:04:09] [INFO ] Time to serialize gal into /tmp/LTL17183577402076773097.gal : 2 ms
[2024-05-27 09:04:09] [INFO ] Time to serialize properties into /tmp/LTL5294018947271544546.prop : 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/LTL17183577402076773097.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3004366826795145506.hoa' '-atoms' '/tmp/LTL5294018947271544546.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...318
Loading property file /tmp/LTL5294018947271544546.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3004366826795145506.hoa
Detected timeout of ITS tools.
[2024-05-27 09:04:24] [INFO ] Flatten gal took : 14 ms
[2024-05-27 09:04:24] [INFO ] Flatten gal took : 9 ms
[2024-05-27 09:04:24] [INFO ] Time to serialize gal into /tmp/LTL11349803715802698047.gal : 1 ms
[2024-05-27 09:04:24] [INFO ] Time to serialize properties into /tmp/LTL6824024870738142950.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/LTL11349803715802698047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6824024870738142950.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(((X(F("((p876<1)||(l0<1))")))||("((s1>=1)&&(l3913>=1))"))||("((s1>=1)&&(l3912>=1))")))))
Formula 0 simplified : G(F(!"((s1>=1)&&(l3912>=1))" & !"((s1>=1)&&(l3913>=1))") & FG!"((p876<1)||(l0<1))")
Detected timeout of ITS tools.
[2024-05-27 09:04:39] [INFO ] Flatten gal took : 14 ms
[2024-05-27 09:04:39] [INFO ] Applying decomposition
[2024-05-27 09:04:39] [INFO ] Flatten gal took : 9 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/graph1351459079421726077.txt' '-o' '/tmp/graph1351459079421726077.bin' '-w' '/tmp/graph1351459079421726077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1351459079421726077.bin' '-l' '-1' '-v' '-w' '/tmp/graph1351459079421726077.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:04:39] [INFO ] Decomposing Gal with order
[2024-05-27 09:04:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:04:39] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-27 09:04:39] [INFO ] Flatten gal took : 21 ms
[2024-05-27 09:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 7 ms.
[2024-05-27 09:04:39] [INFO ] Time to serialize gal into /tmp/LTL3374163461986075549.gal : 3 ms
[2024-05-27 09:04:39] [INFO ] Time to serialize properties into /tmp/LTL4208477689769124436.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/LTL3374163461986075549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4208477689769124436.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(((X(F("((i6.u0.p876<1)||(i6.u0.l0<1))")))||("((i6.u0.s1>=1)&&(i6.u9.l3913>=1))"))||("((i6.u0.s1>=1)&&(i6.u0.l3912>=1))")))))
Formula 0 simplified : G(F(!"((i6.u0.s1>=1)&&(i6.u0.l3912>=1))" & !"((i6.u0.s1>=1)&&(i6.u9.l3913>=1))") & FG!"((i6.u0.p876<1)||(i6.u0.l0<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-08 finished in 155934 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 X(G(!p1))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 239 transition count 445
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 239 transition count 445
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 239 transition count 443
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 224 transition count 428
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 224 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 224 transition count 426
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 122 place count 168 transition count 370
Iterating global reduction 2 with 56 rules applied. Total rules applied 178 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 262 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 167 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 167 transition count 273
Applied a total of 264 rules in 12 ms. Remains 167 /255 variables (removed 88) and now considering 273/865 (removed 592) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 09:04:54] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 09:04:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 09:04:54] [INFO ] Invariant cache hit.
[2024-05-27 09:04:55] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 09:04:55] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-27 09:04:55] [INFO ] Invariant cache hit.
[2024-05-27 09:04:55] [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 9041 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 09:05:10] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 09:05:11] [INFO ] Deduced a trap composed of 61 places in 44 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 09:05:11] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-05-27 09:05:13] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 3 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 09:05:14] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-27 09:05:14] [INFO ] Deduced a trap composed of 59 places in 48 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
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 573 constraints, problems are : Problem set: 22 solved, 250 unsolved in 25994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 6/6 constraints]
After SMT, in 35425ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 35428ms
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/255 places, 251/865 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 245
Applied a total of 24 rules in 1 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 09:05:30] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 09:05:30] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 09:05:30] [INFO ] Invariant cache hit.
[2024-05-27 09:05:30] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 09:05:31] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/255 places, 245/865 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36337 ms. Remains : 149/255 places, 245/865 transitions.
Stuttering acceptance computed with spot in 95 ms :[p1, p1, true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-09
Entered a terminal (fully accepting) state of product in 76 steps with 10 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-09 finished in 36450 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(p0) U (((!p1 U p2) U p0)&&G(!p3))))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 241 transition count 507
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 241 transition count 507
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 241 transition count 503
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 228 transition count 490
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 228 transition count 490
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 228 transition count 486
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 110 place count 180 transition count 438
Iterating global reduction 2 with 48 rules applied. Total rules applied 158 place count 180 transition count 438
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 266 place count 180 transition count 330
Applied a total of 266 rules in 29 ms. Remains 180 /255 variables (removed 75) and now considering 330/865 (removed 535) transitions.
// Phase 1: matrix 330 rows 180 cols
[2024-05-27 09:05:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 09:05:31] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 09:05:31] [INFO ] Invariant cache hit.
[2024-05-27 09:05:31] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-27 09:05:32] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-27 09:05:32] [INFO ] Redundant transitions in 3 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-27 09:05:32] [INFO ] Invariant cache hit.
[2024-05-27 09:05:32] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/510 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 173/355 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-27 09:05:38] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-27 09:05:38] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-27 09:05:38] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 3/358 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/358 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/510 variables, 0/358 constraints. Problems are: Problem set: 20 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 358 constraints, problems are : Problem set: 20 solved, 309 unsolved in 17130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 20 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 8/172 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 330/502 variables, 172/174 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 173/347 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 41/388 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/388 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 8/510 variables, 8/396 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 268/664 constraints. Problems are: Problem set: 20 solved, 309 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 3/667 constraints. Problems are: Problem set: 20 solved, 309 unsolved
[2024-05-27 09:06:09] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
[2024-05-27 09:06:13] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-27 09:06:13] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 09:06:14] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 4/671 constraints. Problems are: Problem set: 22 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 671 constraints, problems are : Problem set: 22 solved, 307 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 309/329 constraints, Known Traps: 7/7 constraints]
After SMT, in 47677ms problems are : Problem set: 22 solved, 307 unsolved
Search for dead transitions found 22 dead transitions in 47682ms
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 : 180/255 places, 308/865 transitions.
Graph (complete) has 651 edges and 180 vertex of which 162 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 162 transition count 302
Applied a total of 7 rules in 9 ms. Remains 162 /180 variables (removed 18) and now considering 302/308 (removed 6) transitions.
// Phase 1: matrix 302 rows 162 cols
[2024-05-27 09:06:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 09:06:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 09:06:19] [INFO ] Invariant cache hit.
[2024-05-27 09:06:19] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-27 09:06:20] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/255 places, 302/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49246 ms. Remains : 162/255 places, 302/865 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) p3), true, (NOT p0), (NOT p2), (NOT p0), p3, p3]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 finished in 49538 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))'
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 238 transition count 416
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 238 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 238 transition count 414
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 222 transition count 398
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 222 transition count 398
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 222 transition count 396
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 130 place count 162 transition count 336
Iterating global reduction 2 with 60 rules applied. Total rules applied 190 place count 162 transition count 336
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 262 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 264 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 267 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 159 transition count 236
Applied a total of 269 rules in 20 ms. Remains 159 /255 variables (removed 96) and now considering 236/865 (removed 629) transitions.
// Phase 1: matrix 236 rows 159 cols
[2024-05-27 09:06:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 09:06:20] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 09:06:20] [INFO ] Invariant cache hit.
[2024-05-27 09:06:20] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 09:06:21] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-27 09:06:21] [INFO ] Redundant transitions in 1 ms returned []
Running 235 sub problems to find dead transitions.
[2024-05-27 09:06:21] [INFO ] Invariant cache hit.
[2024-05-27 09:06:21] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 256 constraints, problems are : Problem set: 0 solved, 235 unsolved in 6783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 235/491 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-27 09:06:32] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 09:06:33] [INFO ] Deduced a trap composed of 60 places in 35 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
[2024-05-27 09:06:35] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
[2024-05-27 09:06:35] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
[2024-05-27 09:06:35] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
[2024-05-27 09:06:35] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 6/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 497 constraints, problems are : Problem set: 22 solved, 213 unsolved in 19426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 6/6 constraints]
After SMT, in 26517ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 26520ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/255 places, 214/865 transitions.
Graph (complete) has 521 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 208
Applied a total of 7 rules in 8 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 09:06:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 09:06:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 09:06:47] [INFO ] Invariant cache hit.
[2024-05-27 09:06:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 09:06:48] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/255 places, 208/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27402 ms. Remains : 141/255 places, 208/865 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-11 finished in 27441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 865/865 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 237 transition count 385
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 237 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 237 transition count 384
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 220 transition count 367
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 220 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 220 transition count 366
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 136 place count 156 transition count 302
Iterating global reduction 2 with 64 rules applied. Total rules applied 200 place count 156 transition count 302
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 264 place count 156 transition count 238
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 267 place count 153 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 270 place count 153 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 272 place count 151 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 151 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 151 transition count 196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 279 place count 147 transition count 192
Iterating global reduction 4 with 4 rules applied. Total rules applied 283 place count 147 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 287 place count 147 transition count 188
Applied a total of 287 rules in 25 ms. Remains 147 /255 variables (removed 108) and now considering 188/865 (removed 677) transitions.
// Phase 1: matrix 188 rows 147 cols
[2024-05-27 09:06:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 09:06:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 09:06:48] [INFO ] Invariant cache hit.
[2024-05-27 09:06:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 09:06:48] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-27 09:06:48] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-27 09:06:48] [INFO ] Invariant cache hit.
[2024-05-27 09:06:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/335 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 57/206 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 206 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/335 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 57/206 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 187/393 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-27 09:06:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-27 09:06:56] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-27 09:06:56] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
[2024-05-27 09:06:57] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
[2024-05-27 09:06:58] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-05-27 09:06:58] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 6/399 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/399 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/399 constraints. Problems are: Problem set: 22 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 399 constraints, problems are : Problem set: 22 solved, 165 unsolved in 12180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 6/6 constraints]
After SMT, in 17137ms problems are : Problem set: 22 solved, 165 unsolved
Search for dead transitions found 22 dead transitions in 17141ms
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 : 147/255 places, 166/865 transitions.
Graph (complete) has 451 edges and 147 vertex of which 129 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 129 transition count 160
Applied a total of 7 rules in 11 ms. Remains 129 /147 variables (removed 18) and now considering 160/166 (removed 6) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 09:07:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 09:07:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-27 09:07:05] [INFO ] Invariant cache hit.
[2024-05-27 09:07:05] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 09:07:06] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/255 places, 160/865 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17770 ms. Remains : 129/255 places, 160/865 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-14
Product exploration explored 100000 steps with 37290 reset in 153 ms.
Product exploration explored 100000 steps with 37276 reset in 157 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Graph (complete) has 431 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
RANDOM walk for 36048 steps (7532 resets) in 105 ms. (340 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 176 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-27 09:07:07] [INFO ] Invariant cache hit.
[2024-05-27 09:07:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 09:07:07] [INFO ] Invariant cache hit.
[2024-05-27 09:07:07] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 09:07:07] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-27 09:07:07] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2024-05-27 09:07:07] [INFO ] Invariant cache hit.
[2024-05-27 09:07:07] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 7426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11830ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12121 ms. Remains : 129/129 places, 160/160 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Graph (complete) has 431 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 91 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
RANDOM walk for 19141 steps (4048 resets) in 180 ms. (105 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 11 factoid took 271 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Product exploration explored 100000 steps with 37333 reset in 153 ms.
Product exploration explored 100000 steps with 37256 reset in 156 ms.
Built C files in :
/tmp/ltsmin5325390180521793393
[2024-05-27 09:07:21] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-27 09:07:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:21] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-27 09:07:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:21] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-27 09:07:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5325390180521793393
Running compilation step : cd /tmp/ltsmin5325390180521793393;'/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 376 ms.
Running link step : cd /tmp/ltsmin5325390180521793393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5325390180521793393;'/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/stateBased2893213852883884398.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-27 09:07:36] [INFO ] Invariant cache hit.
[2024-05-27 09:07:36] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 09:07:36] [INFO ] Invariant cache hit.
[2024-05-27 09:07:36] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 09:07:36] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-27 09:07:36] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2024-05-27 09:07:36] [INFO ] Invariant cache hit.
[2024-05-27 09:07:36] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4384 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 7393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11927ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12238 ms. Remains : 129/129 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin9750935204144200174
[2024-05-27 09:07:48] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-27 09:07:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:48] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-27 09:07:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:48] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-27 09:07:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:07:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9750935204144200174
Running compilation step : cd /tmp/ltsmin9750935204144200174;'/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 377 ms.
Running link step : cd /tmp/ltsmin9750935204144200174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9750935204144200174;'/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/stateBased10259091169268859928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 09:08:03] [INFO ] Flatten gal took : 6 ms
[2024-05-27 09:08:03] [INFO ] Flatten gal took : 5 ms
[2024-05-27 09:08:03] [INFO ] Time to serialize gal into /tmp/LTL7074021390032135160.gal : 2 ms
[2024-05-27 09:08:03] [INFO ] Time to serialize properties into /tmp/LTL14148599412380916948.prop : 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/LTL7074021390032135160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10710987306553540567.hoa' '-atoms' '/tmp/LTL14148599412380916948.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...319
Loading property file /tmp/LTL14148599412380916948.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10710987306553540567.hoa
Detected timeout of ITS tools.
[2024-05-27 09:08:18] [INFO ] Flatten gal took : 5 ms
[2024-05-27 09:08:18] [INFO ] Flatten gal took : 5 ms
[2024-05-27 09:08:18] [INFO ] Time to serialize gal into /tmp/LTL8459696161215603330.gal : 2 ms
[2024-05-27 09:08:18] [INFO ] Time to serialize properties into /tmp/LTL13322534926159697282.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/LTL8459696161215603330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13322534926159697282.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 : !((G(F((X((F("((s1<1)||(l3806<1))"))||(G("((s1<1)||(l160<1))"))))&&("((s1<1)||(l160<1))")))))
Formula 0 simplified : FG(!"((s1<1)||(l160<1))" | X(G!"((s1<1)||(l3806<1))" & F!"((s1<1)||(l160<1))"))
Detected timeout of ITS tools.
[2024-05-27 09:08:33] [INFO ] Flatten gal took : 10 ms
[2024-05-27 09:08:33] [INFO ] Applying decomposition
[2024-05-27 09:08:33] [INFO ] Flatten gal took : 7 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/graph11001498374048648626.txt' '-o' '/tmp/graph11001498374048648626.bin' '-w' '/tmp/graph11001498374048648626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11001498374048648626.bin' '-l' '-1' '-v' '-w' '/tmp/graph11001498374048648626.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:08:33] [INFO ] Decomposing Gal with order
[2024-05-27 09:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:08:33] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-27 09:08:33] [INFO ] Flatten gal took : 14 ms
[2024-05-27 09:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 5 ms.
[2024-05-27 09:08:33] [INFO ] Time to serialize gal into /tmp/LTL5348929646117898169.gal : 2 ms
[2024-05-27 09:08:33] [INFO ] Time to serialize properties into /tmp/LTL4135163806874910223.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/LTL5348929646117898169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4135163806874910223.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((F("((i4.u0.s1<1)||(i5.u19.l3806<1))"))||(G("((i4.u0.s1<1)||(i0.u4.l160<1))"))))&&("((i4.u0.s1<1)||(i0.u4.l160<1))")))))
Formula 0 simplified : FG(!"((i4.u0.s1<1)||(i0.u4.l160<1))" | X(G!"((i4.u0.s1<1)||(i5.u19.l3806<1))" & F!"((i4.u0.s1<1)||(i0.u4.l160<1))"))
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-14 finished in 120562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
[2024-05-27 09:08:49] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15089377513860415562
[2024-05-27 09:08:49] [INFO ] Computing symmetric may disable matrix : 865 transitions.
[2024-05-27 09:08:49] [INFO ] Applying decomposition
[2024-05-27 09:08:49] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:08:49] [INFO ] Computing symmetric may enable matrix : 865 transitions.
[2024-05-27 09:08:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:08:49] [INFO ] Flatten gal took : 22 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/graph201136909707700367.txt' '-o' '/tmp/graph201136909707700367.bin' '-w' '/tmp/graph201136909707700367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph201136909707700367.bin' '-l' '-1' '-v' '-w' '/tmp/graph201136909707700367.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:08:49] [INFO ] Decomposing Gal with order
[2024-05-27 09:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:08:49] [INFO ] Computing Do-Not-Accords matrix : 865 transitions.
[2024-05-27 09:08:49] [INFO ] Removed a total of 871 redundant transitions.
[2024-05-27 09:08:49] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 09:08:49] [INFO ] Flatten gal took : 75 ms
[2024-05-27 09:08:49] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15089377513860415562
Running compilation step : cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
[2024-05-27 09:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 15 ms.
[2024-05-27 09:08:49] [INFO ] Time to serialize gal into /tmp/LTLFireability13974327931021659914.gal : 5 ms
[2024-05-27 09:08:49] [INFO ] Time to serialize properties into /tmp/LTLFireability666240797767079205.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/LTLFireability13974327931021659914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability666240797767079205.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...276
Read 3 LTL properties
Checking formula 0 : !((G(F((!("((u0.s1>=1)&&(u7.l3917>=1))"))&&(X((F(!("((u0.s1>=1)&&(u7.l3919>=1))")))||(G(!("((u0.s1>=1)&&(u7.l3917>=1))")))))))))
Formula 0 simplified : FG("((u0.s1>=1)&&(u7.l3917>=1))" | X(G"((u0.s1>=1)&&(u7.l3919>=1))" & F"((u0.s1>=1)&&(u7.l3917>=1))"))
Compilation finished in 3132 ms.
Running link step : cd /tmp/ltsmin15089377513860415562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp4==true)&&X((<>(!(LTLAPp5==true))||[](!(LTLAPp4==true)))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 09:26:54] [INFO ] Flatten gal took : 47 ms
[2024-05-27 09:26:54] [INFO ] Time to serialize gal into /tmp/LTLFireability15156866036145147851.gal : 7 ms
[2024-05-27 09:26:54] [INFO ] Time to serialize properties into /tmp/LTLFireability12959076636198712407.ltl : 13 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/LTLFireability15156866036145147851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12959076636198712407.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...299
Read 3 LTL properties
Checking formula 0 : !((G(F((!("((s1>=1)&&(l3917>=1))"))&&(X((F(!("((s1>=1)&&(l3919>=1))")))||(G(!("((s1>=1)&&(l3917>=1))")))))))))
Formula 0 simplified : FG("((s1>=1)&&(l3917>=1))" | X(G"((s1>=1)&&(l3919>=1))" & F"((s1>=1)&&(l3917>=1))"))
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp4==true)&&X((<>(!(LTLAPp5==true))||[](!(LTLAPp4==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 09:50:59] [INFO ] Flatten gal took : 75 ms
[2024-05-27 09:50:59] [INFO ] Input system was already deterministic with 865 transitions.
[2024-05-27 09:50:59] [INFO ] Transformed 255 places.
[2024-05-27 09:50:59] [INFO ] Transformed 865 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 09:51:00] [INFO ] Time to serialize gal into /tmp/LTLFireability3244905705204825930.gal : 4 ms
[2024-05-27 09:51:00] [INFO ] Time to serialize properties into /tmp/LTLFireability2256388082504569068.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/LTLFireability3244905705204825930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2256388082504569068.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((!("((s1>=1)&&(l3917>=1))"))&&(X((F(!("((s1>=1)&&(l3919>=1))")))||(G(!("((s1>=1)&&(l3917>=1))")))))))))
Formula 0 simplified : FG("((s1>=1)&&(l3917>=1))" | X(G"((s1>=1)&&(l3919>=1))" & F"((s1>=1)&&(l3917>=1))"))
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.288: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.288: LTL layer: formula: [](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 7/ 8), 0.288: "[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.288: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.428: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.430: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.438: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.439: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.449: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.460: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.569: There are 872 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.569: State length is 256, there are 876 groups
pins2lts-mc-linux64( 0/ 8), 0.569: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.569: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.569: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.569: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.633: [Blue] ~18 levels ~960 states ~2528 transitions
pins2lts-mc-linux64( 6/ 8), 0.709: [Blue] ~29 levels ~1920 states ~5136 transitions
pins2lts-mc-linux64( 5/ 8), 0.792: [Blue] ~44 levels ~3840 states ~9328 transitions
pins2lts-mc-linux64( 5/ 8), 0.938: [Blue] ~62 levels ~7680 states ~16896 transitions
pins2lts-mc-linux64( 6/ 8), 2.065: [Blue] ~111 levels ~15360 states ~47088 transitions
pins2lts-mc-linux64( 7/ 8), 2.943: [Blue] ~69 levels ~30720 states ~67104 transitions
pins2lts-mc-linux64( 7/ 8), 4.623: [Blue] ~69 levels ~61440 states ~129984 transitions
pins2lts-mc-linux64( 7/ 8), 8.447: [Blue] ~69 levels ~122880 states ~252576 transitions
pins2lts-mc-linux64( 7/ 8), 12.330: [Blue] ~69 levels ~245760 states ~510288 transitions
pins2lts-mc-linux64( 7/ 8), 16.870: [Blue] ~69 levels ~491520 states ~1030288 transitions
pins2lts-mc-linux64( 7/ 8), 25.550: [Blue] ~69 levels ~983040 states ~2130208 transitions
pins2lts-mc-linux64( 7/ 8), 42.799: [Blue] ~117 levels ~1966080 states ~4158592 transitions
pins2lts-mc-linux64( 7/ 8), 82.529: [Blue] ~207 levels ~3932160 states ~8195440 transitions
pins2lts-mc-linux64( 7/ 8), 156.379: [Blue] ~387 levels ~7864320 states ~16270384 transitions
pins2lts-mc-linux64( 7/ 8), 291.400: [Blue] ~762 levels ~15728640 states ~32412016 transitions
pins2lts-mc-linux64( 7/ 8), 566.653: [Blue] ~102861 levels ~31457280 states ~76757712 transitions
pins2lts-mc-linux64( 7/ 8), 1121.350: [Blue] ~280336 levels ~62914560 states ~163928032 transitions
pins2lts-mc-linux64( 1/ 8), 1644.808: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1645.207:
pins2lts-mc-linux64( 0/ 8), 1645.208: Explored 89720505 states 238742874 transitions, fanout: 2.661
pins2lts-mc-linux64( 0/ 8), 1645.208: Total exploration time 1644.600 sec (1644.250 sec minimum, 1644.390 sec on average)
pins2lts-mc-linux64( 0/ 8), 1645.210: States per second: 54555, Transitions per second: 145168
pins2lts-mc-linux64( 0/ 8), 1645.210:
pins2lts-mc-linux64( 0/ 8), 1645.210: State space has 134217377 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1645.210: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1645.210: blue states: 89720505 (66.85%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1645.210: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1645.210: all-red states: 44860205 (33.42%), bogus 16 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1645.210:
pins2lts-mc-linux64( 0/ 8), 1645.210: Total memory used for local state coloring: 49.9MB
pins2lts-mc-linux64( 0/ 8), 1645.210:
pins2lts-mc-linux64( 0/ 8), 1645.210: Queue width: 8B, total height: 3270214, memory: 24.95MB
pins2lts-mc-linux64( 0/ 8), 1645.210: Tree memory: 1238.3MB, 9.7 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1645.210: Tree fill ratio (roots/leafs): 99.0%/83.0%
pins2lts-mc-linux64( 0/ 8), 1645.210: Stored 883 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1645.210: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1645.210: Est. total memory use: 1263.3MB (~1048.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15089377513860415562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((<>(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

--------------------
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-d1m160"
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-d1m160, 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-171679079600100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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