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-171679079500076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716796067148

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-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 07:47:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 07:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:47:48] [INFO ] Load time of PNML (sax parser for PT used): 476 ms
[2024-05-27 07:47:48] [INFO ] Transformed 6690 places.
[2024-05-27 07:47:48] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:47:48] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4305 places in 41 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1088 places :
Symmetric choice reduction at 1 with 1088 rule applications. Total rules 1207 place count 1280 transition count 7064
Iterating global reduction 1 with 1088 rules applied. Total rules applied 2295 place count 1280 transition count 7064
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 2571 place count 1280 transition count 6788
Discarding 924 places :
Symmetric choice reduction at 2 with 924 rule applications. Total rules 3495 place count 356 transition count 5864
Iterating global reduction 2 with 924 rules applied. Total rules applied 4419 place count 356 transition count 5864
Ensure Unique test removed 4693 transitions
Reduce isomorphic transitions removed 4693 transitions.
Iterating post reduction 2 with 4693 rules applied. Total rules applied 9112 place count 356 transition count 1171
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 9173 place count 295 transition count 1110
Iterating global reduction 3 with 61 rules applied. Total rules applied 9234 place count 295 transition count 1110
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 3 with 205 rules applied. Total rules applied 9439 place count 295 transition count 905
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9447 place count 287 transition count 897
Iterating global reduction 4 with 8 rules applied. Total rules applied 9455 place count 287 transition count 897
Applied a total of 9455 rules in 370 ms. Remains 287 /2385 variables (removed 2098) and now considering 897/11934 (removed 11037) transitions.
// Phase 1: matrix 897 rows 287 cols
[2024-05-27 07:47:49] [INFO ] Computed 3 invariants in 28 ms
[2024-05-27 07:47:50] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-27 07:47:50] [INFO ] Invariant cache hit.
[2024-05-27 07:47:50] [INFO ] State equation strengthened by 638 read => feed constraints.
[2024-05-27 07:47:51] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2024-05-27 07:47:51] [INFO ] Invariant cache hit.
[2024-05-27 07:47:51] [INFO ] State equation strengthened by 638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
At refinement iteration 4 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 928 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 1 (OVERLAPS) 17/279 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 3 (OVERLAPS) 8/287 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 872/1800 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1800 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 872/896 constraints, Known Traps: 0/0 constraints]
After SMT, in 63654ms problems are : Problem set: 24 solved, 872 unsolved
Search for dead transitions found 24 dead transitions in 63677ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 287/2385 places, 873/11934 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 264 transition count 862
Applied a total of 34 rules in 6 ms. Remains 264 /287 variables (removed 23) and now considering 862/873 (removed 11) transitions.
// Phase 1: matrix 862 rows 264 cols
[2024-05-27 07:48:55] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:48:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 07:48:55] [INFO ] Invariant cache hit.
[2024-05-27 07:48:55] [INFO ] State equation strengthened by 634 read => feed constraints.
[2024-05-27 07:48:56] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/2385 places, 862/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67075 ms. Remains : 264/2385 places, 862/11934 transitions.
Support contains 25 out of 264 places after structural reductions.
[2024-05-27 07:48:56] [INFO ] Flatten gal took : 87 ms
[2024-05-27 07:48:56] [INFO ] Flatten gal took : 47 ms
[2024-05-27 07:48:56] [INFO ] Input system was already deterministic with 862 transitions.
RANDOM walk for 40000 steps (6465 resets) in 2540 ms. (15 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (848 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-05-27 07:48:57] [INFO ] Invariant cache hit.
[2024-05-27 07:48:57] [INFO ] State equation strengthened by 634 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 319/396 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 91/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 1126/1126 variables, and 357 constraints, problems are : Problem set: 1 solved, 0 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 264/264 constraints, ReadFeed: 91/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 70 stabilizing places and 424 stable transitions
Graph (complete) has 1391 edges and 264 vertex of which 262 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 37 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:48:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:48:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:48:58] [INFO ] Invariant cache hit.
[2024-05-27 07:48:58] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:48:58] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-27 07:48:58] [INFO ] Invariant cache hit.
[2024-05-27 07:48:58] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 9010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-27 07:49:15] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 8 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:49:15] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:49:15] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 2 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 07:49:18] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:49:19] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-27 07:49:19] [INFO ] Deduced a trap composed of 59 places in 52 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 29609 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 39082ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 39088ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/264 places, 251/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 245
Applied a total of 24 rules in 9 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:49:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:49:38] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-27 07:49:38] [INFO ] Invariant cache hit.
[2024-05-27 07:49:38] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:49:38] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40233 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 29 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 finished in 41444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 290 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 294 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 306 place count 155 transition count 217
Applied a total of 306 rules in 15 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:49:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:49:40] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-27 07:49:40] [INFO ] Invariant cache hit.
[2024-05-27 07:49:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:49:40] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 07:49:40] [INFO ] Invariant cache hit.
[2024-05-27 07:49:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:49:51] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:49:52] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:49:52] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 07:49:53] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 07:49:54] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 9 ms to minimize.
[2024-05-27 07:49:54] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 19226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25986ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25988ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 1 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:50:06] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:50:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:50:06] [INFO ] Invariant cache hit.
[2024-05-27 07:50:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:50:06] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26972 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 finished in 27100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(G((X(p1) U !p0)))||p2))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 272 place count 174 transition count 320
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 173 transition count 307
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 173 transition count 307
Applied a total of 274 rules in 20 ms. Remains 173 /264 variables (removed 91) and now considering 307/862 (removed 555) transitions.
// Phase 1: matrix 307 rows 173 cols
[2024-05-27 07:50:06] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 07:50:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 07:50:06] [INFO ] Invariant cache hit.
[2024-05-27 07:50:07] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-27 07:50:07] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-27 07:50:07] [INFO ] Invariant cache hit.
[2024-05-27 07:50:07] [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 10342 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 07:50:24] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 2 ms to minimize.
[2024-05-27 07:50:25] [INFO ] Deduced a trap composed of 49 places in 41 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 07:50:26] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 07:50:26] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-27 07:50:29] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:50:29] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 6/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 642 constraints, problems are : Problem set: 22 solved, 284 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints]
After SMT, in 40910ms problems are : Problem set: 22 solved, 284 unsolved
Search for dead transitions found 22 dead transitions in 40913ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 285/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 279
Applied a total of 24 rules in 2 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 07:50:48] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:50:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 07:50:48] [INFO ] Invariant cache hit.
[2024-05-27 07:50:48] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-05-27 07:50:48] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 279/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42127 ms. Remains : 155/264 places, 279/862 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p0)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 finished in 42329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (X(!p3)&&p2)))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 495
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 494
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 478
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 230 transition count 476
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 127 place count 174 transition count 420
Iterating global reduction 3 with 56 rules applied. Total rules applied 183 place count 174 transition count 420
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 275 place count 174 transition count 328
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 276 place count 173 transition count 315
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 173 transition count 315
Applied a total of 277 rules in 25 ms. Remains 173 /264 variables (removed 91) and now considering 315/862 (removed 547) transitions.
// Phase 1: matrix 315 rows 173 cols
[2024-05-27 07:50:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:50:49] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 07:50:49] [INFO ] Invariant cache hit.
[2024-05-27 07:50:49] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-27 07:50:49] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-27 07:50:49] [INFO ] Invariant cache hit.
[2024-05-27 07:50:49] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 338 constraints, problems are : Problem set: 0 solved, 314 unsolved in 10933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 314/652 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-27 07:51:09] [INFO ] Deduced a trap composed of 49 places in 57 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 07:51:09] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-05-27 07:51:12] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
[2024-05-27 07:51:12] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
[2024-05-27 07:51:13] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:51:13] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
[2024-05-27 07:51:20] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-05-27 07:51:20] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 2/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 660 constraints, problems are : Problem set: 22 solved, 292 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints]
After SMT, in 41540ms problems are : Problem set: 22 solved, 292 unsolved
Search for dead transitions found 22 dead transitions in 41544ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 293/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 287
Applied a total of 24 rules in 5 ms. Remains 155 /173 variables (removed 18) and now considering 287/293 (removed 6) transitions.
// Phase 1: matrix 287 rows 155 cols
[2024-05-27 07:51:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:51:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-27 07:51:31] [INFO ] Invariant cache hit.
[2024-05-27 07:51:31] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-27 07:51:31] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 287/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42633 ms. Remains : 155/264 places, 287/862 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) p3), true, p3, (NOT p1), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3)), p3]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 finished in 42914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 429
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 428
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 410
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 226 transition count 408
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 143 place count 162 transition count 344
Iterating global reduction 3 with 64 rules applied. Total rules applied 207 place count 162 transition count 344
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 291 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 293 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 295 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 296 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 301 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 305 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 317 place count 155 transition count 217
Applied a total of 317 rules in 25 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:51:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:51:32] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:51:32] [INFO ] Invariant cache hit.
[2024-05-27 07:51:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:51:32] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 07:51:32] [INFO ] Invariant cache hit.
[2024-05-27 07:51:32] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:51:43] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:51:43] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:51:43] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 07:51:45] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 07:51:45] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:51:45] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 19265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25895ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25898ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 7 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:51:58] [INFO ] Computed 2 invariants in 7 ms
[2024-05-27 07:51:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:51:58] [INFO ] Invariant cache hit.
[2024-05-27 07:51:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:51:58] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26662 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 finished in 26759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 245 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 245 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 245 transition count 418
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 227 transition count 400
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 227 transition count 400
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 227 transition count 397
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 142 place count 163 transition count 333
Iterating global reduction 2 with 64 rules applied. Total rules applied 206 place count 163 transition count 333
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 278 place count 163 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 162 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 162 transition count 248
Applied a total of 280 rules in 16 ms. Remains 162 /264 variables (removed 102) and now considering 248/862 (removed 614) transitions.
// Phase 1: matrix 248 rows 162 cols
[2024-05-27 07:51:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:51:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 07:51:58] [INFO ] Invariant cache hit.
[2024-05-27 07:51:59] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-27 07:51:59] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-27 07:51:59] [INFO ] Invariant cache hit.
[2024-05-27 07:51:59] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 269 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 49/317 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-27 07:52:14] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:52:14] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 07:52:14] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-27 07:52:16] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
[2024-05-27 07:52:16] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:52:16] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 6/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/324 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 186/510 constraints. Problems are: Problem set: 22 solved, 225 unsolved
[2024-05-27 07:52:28] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 511 constraints, problems are : Problem set: 22 solved, 225 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 235/247 constraints, Known Traps: 7/7 constraints]
After SMT, in 42039ms problems are : Problem set: 22 solved, 225 unsolved
Search for dead transitions found 22 dead transitions in 42043ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/264 places, 226/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 220
Applied a total of 24 rules in 5 ms. Remains 144 /162 variables (removed 18) and now considering 220/226 (removed 6) transitions.
// Phase 1: matrix 220 rows 144 cols
[2024-05-27 07:52:41] [INFO ] Computed 2 invariants in 10 ms
[2024-05-27 07:52:41] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:52:41] [INFO ] Invariant cache hit.
[2024-05-27 07:52:41] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-27 07:52:41] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/264 places, 220/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42890 ms. Remains : 144/264 places, 220/862 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 finished in 43159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !(!p0 U p1)))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 288 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 289 place count 173 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 290 place count 173 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 172 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 172 transition count 290
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 168 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 168 transition count 286
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 324 place count 168 transition count 262
Applied a total of 324 rules in 70 ms. Remains 168 /264 variables (removed 96) and now considering 262/862 (removed 600) transitions.
// Phase 1: matrix 262 rows 168 cols
[2024-05-27 07:52:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:52:42] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 07:52:42] [INFO ] Invariant cache hit.
[2024-05-27 07:52:42] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 07:52:42] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-27 07:52:42] [INFO ] Redundant transitions in 14 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-27 07:52:42] [INFO ] Invariant cache hit.
[2024-05-27 07:52:42] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 285 constraints, problems are : Problem set: 0 solved, 261 unsolved in 9232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 261/546 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-27 07:52:58] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:52:58] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-05-27 07:53:00] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-27 07:53:00] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-27 07:53:01] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:53:01] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 552 constraints, problems are : Problem set: 22 solved, 239 unsolved in 26057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 35714ms problems are : Problem set: 22 solved, 239 unsolved
Search for dead transitions found 22 dead transitions in 35720ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/264 places, 240/862 transitions.
Graph (complete) has 561 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 234
Applied a total of 7 rules in 16 ms. Remains 150 /168 variables (removed 18) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 150 cols
[2024-05-27 07:53:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:53:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:53:18] [INFO ] Invariant cache hit.
[2024-05-27 07:53:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:53:18] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/264 places, 234/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36813 ms. Remains : 150/264 places, 234/862 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
Product exploration explored 100000 steps with 18544 reset in 302 ms.
Product exploration explored 100000 steps with 18629 reset in 271 ms.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[p1, p1, p1]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (7267 resets) in 179 ms. (222 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (1194 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
[2024-05-27 07:53:19] [INFO ] Invariant cache hit.
[2024-05-27 07:53:19] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/238 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 384/384 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 47/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 382 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p1, p1]
Stuttering acceptance computed with spot in 76 ms :[p1, p1]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-27 07:53:20] [INFO ] Invariant cache hit.
[2024-05-27 07:53:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:53:20] [INFO ] Invariant cache hit.
[2024-05-27 07:53:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:53:21] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-27 07:53:21] [INFO ] Redundant transitions in 5 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-27 07:53:21] [INFO ] Invariant cache hit.
[2024-05-27 07:53:21] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24192ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24638 ms. Remains : 150/150 places, 234/234 transitions.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
RANDOM walk for 1675 steps (308 resets) in 29 ms. (55 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p1, p1]
Stuttering acceptance computed with spot in 94 ms :[p1, p1]
Stuttering acceptance computed with spot in 102 ms :[p1, p1]
Product exploration explored 100000 steps with 18571 reset in 212 ms.
Product exploration explored 100000 steps with 18581 reset in 218 ms.
Built C files in :
/tmp/ltsmin13012451882740710777
[2024-05-27 07:53:46] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2024-05-27 07:53:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:53:46] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2024-05-27 07:53:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:53:46] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2024-05-27 07:53:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:53:46] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13012451882740710777
Running compilation step : cd /tmp/ltsmin13012451882740710777;'/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 764 ms.
Running link step : cd /tmp/ltsmin13012451882740710777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13012451882740710777;'/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/stateBased11236674676826583357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-27 07:54:01] [INFO ] Invariant cache hit.
[2024-05-27 07:54:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:54:01] [INFO ] Invariant cache hit.
[2024-05-27 07:54:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:54:01] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-27 07:54:01] [INFO ] Redundant transitions in 3 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-27 07:54:01] [INFO ] Invariant cache hit.
[2024-05-27 07:54:01] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24556ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24559ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24982 ms. Remains : 150/150 places, 234/234 transitions.
Built C files in :
/tmp/ltsmin15349824756658328215
[2024-05-27 07:54:26] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2024-05-27 07:54:26] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:54:26] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2024-05-27 07:54:26] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:54:26] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2024-05-27 07:54:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:54:26] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15349824756658328215
Running compilation step : cd /tmp/ltsmin15349824756658328215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 577 ms.
Running link step : cd /tmp/ltsmin15349824756658328215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15349824756658328215;'/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/stateBased1911120282453406850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 07:54:41] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:54:41] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:54:41] [INFO ] Time to serialize gal into /tmp/LTL205094483187342296.gal : 3 ms
[2024-05-27 07:54:41] [INFO ] Time to serialize properties into /tmp/LTL13986369224839861325.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL205094483187342296.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4887441633719367583.hoa' '-atoms' '/tmp/LTL13986369224839861325.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/LTL13986369224839861325.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4887441633719367583.hoa
Detected timeout of ITS tools.
[2024-05-27 07:54:56] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:54:56] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:54:56] [INFO ] Time to serialize gal into /tmp/LTL15283522985710936788.gal : 2 ms
[2024-05-27 07:54:56] [INFO ] Time to serialize properties into /tmp/LTL1298652317136484079.ltl : 4 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/LTL15283522985710936788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1298652317136484079.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s1>=1)&&(l3931>=1))")U(!((!("((s1>=1)&&(l3931>=1))"))U("(((s1>=1)&&(l3925>=1))||((s1>=1)&&(l3913>=1)))")))))))
Formula 0 simplified : GF(!"((s1>=1)&&(l3931>=1))" R (!"((s1>=1)&&(l3931>=1))" U "(((s1>=1)&&(l3925>=1))||((s1>=1)&&(l3913>=1)))"))
Detected timeout of ITS tools.
[2024-05-27 07:55:11] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:55:11] [INFO ] Applying decomposition
[2024-05-27 07:55:11] [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/graph5683481002815541244.txt' '-o' '/tmp/graph5683481002815541244.bin' '-w' '/tmp/graph5683481002815541244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5683481002815541244.bin' '-l' '-1' '-v' '-w' '/tmp/graph5683481002815541244.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:55:11] [INFO ] Decomposing Gal with order
[2024-05-27 07:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:55:11] [INFO ] Removed a total of 248 redundant transitions.
[2024-05-27 07:55:12] [INFO ] Flatten gal took : 56 ms
[2024-05-27 07:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 10 ms.
[2024-05-27 07:55:12] [INFO ] Time to serialize gal into /tmp/LTL12009064676291584347.gal : 4 ms
[2024-05-27 07:55:12] [INFO ] Time to serialize properties into /tmp/LTL9214729848183303324.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/LTL12009064676291584347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9214729848183303324.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 : !((F(G(("((i3.u2.s1>=1)&&(u0.l3931>=1))")U(!((!("((i3.u2.s1>=1)&&(u0.l3931>=1))"))U("(((i3.u2.s1>=1)&&(u0.l3925>=1))||((i3.u2.s1>=1)&&...178
Formula 0 simplified : GF(!"((i3.u2.s1>=1)&&(u0.l3931>=1))" R (!"((i3.u2.s1>=1)&&(u0.l3931>=1))" U "(((i3.u2.s1>=1)&&(u0.l3925>=1))||((i3.u2.s1>=1)&&(u0.l3...167
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 finished in 165107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 441
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 440
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 424
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 230 transition count 423
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 130 place count 170 transition count 363
Iterating global reduction 3 with 60 rules applied. Total rules applied 190 place count 170 transition count 363
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 266 place count 170 transition count 287
Applied a total of 266 rules in 40 ms. Remains 170 /264 variables (removed 94) and now considering 287/862 (removed 575) transitions.
// Phase 1: matrix 287 rows 170 cols
[2024-05-27 07:55:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:55:27] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-27 07:55:27] [INFO ] Invariant cache hit.
[2024-05-27 07:55:27] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-27 07:55:27] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-27 07:55:27] [INFO ] Redundant transitions in 1 ms returned []
Running 286 sub problems to find dead transitions.
[2024-05-27 07:55:27] [INFO ] Invariant cache hit.
[2024-05-27 07:55:27] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 310 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 286/596 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-27 07:55:45] [INFO ] Deduced a trap composed of 49 places in 45 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 07:55:45] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-27 07:55:45] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-05-27 07:55:48] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 9 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-05-27 07:55:49] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:55:49] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 6/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 602 constraints, problems are : Problem set: 22 solved, 264 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints]
After SMT, in 40674ms problems are : Problem set: 22 solved, 264 unsolved
Search for dead transitions found 22 dead transitions in 40677ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 170/264 places, 265/862 transitions.
Graph (complete) has 590 edges and 170 vertex of which 152 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 152 transition count 259
Applied a total of 7 rules in 15 ms. Remains 152 /170 variables (removed 18) and now considering 259/265 (removed 6) transitions.
// Phase 1: matrix 259 rows 152 cols
[2024-05-27 07:56:08] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:56:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:56:08] [INFO ] Invariant cache hit.
[2024-05-27 07:56:08] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:56:08] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 152/264 places, 259/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41662 ms. Remains : 152/264 places, 259/862 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Product exploration explored 100000 steps with 17879 reset in 183 ms.
Product exploration explored 100000 steps with 18102 reset in 213 ms.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 823 steps (126 resets) in 11 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-27 07:56:09] [INFO ] Invariant cache hit.
[2024-05-27 07:56:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 07:56:09] [INFO ] Invariant cache hit.
[2024-05-27 07:56:09] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:56:10] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-27 07:56:10] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-27 07:56:10] [INFO ] Invariant cache hit.
[2024-05-27 07:56:10] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8370 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 19331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 28087ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 28091ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28500 ms. Remains : 152/152 places, 259/259 transitions.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 668 steps (125 resets) in 9 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18080 reset in 192 ms.
Product exploration explored 100000 steps with 18128 reset in 196 ms.
Built C files in :
/tmp/ltsmin7943900943643898035
[2024-05-27 07:56:39] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-27 07:56:39] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:56:39] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-27 07:56:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:56:39] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-27 07:56:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:56:39] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7943900943643898035
Running compilation step : cd /tmp/ltsmin7943900943643898035;'/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 659 ms.
Running link step : cd /tmp/ltsmin7943900943643898035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7943900943643898035;'/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/stateBased16565034629693606640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 15 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-27 07:56:54] [INFO ] Invariant cache hit.
[2024-05-27 07:56:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 07:56:54] [INFO ] Invariant cache hit.
[2024-05-27 07:56:54] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:56:54] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-27 07:56:54] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-27 07:56:54] [INFO ] Invariant cache hit.
[2024-05-27 07:56:54] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 27912ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 27916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28350 ms. Remains : 152/152 places, 259/259 transitions.
Built C files in :
/tmp/ltsmin7267940299292184782
[2024-05-27 07:57:22] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-27 07:57:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:57:22] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-27 07:57:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:57:22] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-27 07:57:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:57:22] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7267940299292184782
Running compilation step : cd /tmp/ltsmin7267940299292184782;'/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 665 ms.
Running link step : cd /tmp/ltsmin7267940299292184782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7267940299292184782;'/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/stateBased8839454875481792432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 07:57:37] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:57:37] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:57:37] [INFO ] Time to serialize gal into /tmp/LTL272891371810742078.gal : 2 ms
[2024-05-27 07:57:37] [INFO ] Time to serialize properties into /tmp/LTL1586344043805703565.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL272891371810742078.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5903778105268245756.hoa' '-atoms' '/tmp/LTL1586344043805703565.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...316
Loading property file /tmp/LTL1586344043805703565.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5903778105268245756.hoa
Detected timeout of ITS tools.
[2024-05-27 07:57:52] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:57:52] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:57:52] [INFO ] Time to serialize gal into /tmp/LTL4039508988269617953.gal : 2 ms
[2024-05-27 07:57:52] [INFO ] Time to serialize properties into /tmp/LTL14491016058973426483.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/LTL4039508988269617953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14491016058973426483.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("(((s1<1)||(l3917<1))||(((s1>=1)&&(l3927>=1))||((p575>=1)&&(l0>=1))))"))))
Formula 0 simplified : FG!"(((s1<1)||(l3917<1))||(((s1>=1)&&(l3927>=1))||((p575>=1)&&(l0>=1))))"
Detected timeout of ITS tools.
[2024-05-27 07:58:07] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:58:07] [INFO ] Applying decomposition
[2024-05-27 07:58:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14356590327970233660.txt' '-o' '/tmp/graph14356590327970233660.bin' '-w' '/tmp/graph14356590327970233660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14356590327970233660.bin' '-l' '-1' '-v' '-w' '/tmp/graph14356590327970233660.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:58:07] [INFO ] Decomposing Gal with order
[2024-05-27 07:58:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:58:07] [INFO ] Removed a total of 227 redundant transitions.
[2024-05-27 07:58:07] [INFO ] Flatten gal took : 19 ms
[2024-05-27 07:58:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 6 ms.
[2024-05-27 07:58:08] [INFO ] Time to serialize gal into /tmp/LTL5711163041857238459.gal : 3 ms
[2024-05-27 07:58:08] [INFO ] Time to serialize properties into /tmp/LTL17007604383230461613.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/LTL5711163041857238459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17007604383230461613.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("(((i0.u0.s1<1)||(i0.u0.l3917<1))||(((i0.u0.s1>=1)&&(i0.u0.l3927>=1))||((i0.u0.p575>=1)&&(i4.u2.l0>=1))))"))))
Formula 0 simplified : FG!"(((i0.u0.s1<1)||(i0.u0.l3917<1))||(((i0.u0.s1>=1)&&(i0.u0.l3927>=1))||((i0.u0.p575>=1)&&(i4.u2.l0>=1))))"
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 175957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p1||F(p2))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 431
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 431
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 229 transition count 414
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 229 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 229 transition count 413
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 135 place count 165 transition count 349
Iterating global reduction 2 with 64 rules applied. Total rules applied 199 place count 165 transition count 349
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 279 place count 165 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 164 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 164 transition count 256
Applied a total of 281 rules in 28 ms. Remains 164 /264 variables (removed 100) and now considering 256/862 (removed 606) transitions.
// Phase 1: matrix 256 rows 164 cols
[2024-05-27 07:58:23] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:58:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:58:23] [INFO ] Invariant cache hit.
[2024-05-27 07:58:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:58:23] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-27 07:58:23] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-27 07:58:23] [INFO ] Invariant cache hit.
[2024-05-27 07:58:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 255 unsolved in 7919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 255/532 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-27 07:58:36] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-27 07:58:37] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-27 07:58:37] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2024-05-27 07:58:39] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-05-27 07:58:40] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:58:40] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 6/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 538 constraints, problems are : Problem set: 22 solved, 233 unsolved in 24070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
After SMT, in 32397ms problems are : Problem set: 22 solved, 233 unsolved
Search for dead transitions found 22 dead transitions in 32401ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 164/264 places, 234/862 transitions.
Graph (complete) has 550 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.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 146 transition count 228
Applied a total of 7 rules in 17 ms. Remains 146 /164 variables (removed 18) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 146 cols
[2024-05-27 07:58:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:58:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:58:56] [INFO ] Invariant cache hit.
[2024-05-27 07:58:56] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-27 07:58:56] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/264 places, 228/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33243 ms. Remains : 146/264 places, 228/862 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 finished in 33369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 31 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:58:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:58:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 07:58:56] [INFO ] Invariant cache hit.
[2024-05-27 07:58:56] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:58:56] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-27 07:58:57] [INFO ] Redundant transitions in 2 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-27 07:58:57] [INFO ] Invariant cache hit.
[2024-05-27 07:58:57] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 9117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-27 07:59:13] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:59:13] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:59:13] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-05-27 07:59:15] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:59:16] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:59:16] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
[2024-05-27 07:59:29] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:59:29] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:59:30] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:59:30] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/440 variables, 4/577 constraints. Problems are: Problem set: 22 solved, 250 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 577 constraints, problems are : Problem set: 22 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 10/10 constraints]
After SMT, in 39626ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 39629ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/264 places, 251/862 transitions.
Graph (complete) has 572 edges and 167 vertex of which 149 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 149 transition count 245
Applied a total of 7 rules in 7 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:59:36] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:59:36] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 07:59:36] [INFO ] Invariant cache hit.
[2024-05-27 07:59:36] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:59:37] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40635 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
Product exploration explored 100000 steps with 18033 reset in 224 ms.
Product exploration explored 100000 steps with 17971 reset in 230 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (7147 resets) in 254 ms. (156 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1237 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-27 07:59:37] [INFO ] Invariant cache hit.
[2024-05-27 07:59:37] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/240 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 394/394 variables, and 201 constraints, problems are : Problem set: 1 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 50/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 362 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Applied a total of 0 rules in 12 ms. Remains 149 /149 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-27 07:59:38] [INFO ] Invariant cache hit.
[2024-05-27 07:59:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:59:38] [INFO ] Invariant cache hit.
[2024-05-27 07:59:38] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:59:38] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-27 07:59:38] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-27 07:59:38] [INFO ] Invariant cache hit.
[2024-05-27 07:59:38] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 273 constraints, problems are : Problem set: 0 solved, 244 unsolved in 8139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 244/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 517 constraints, problems are : Problem set: 0 solved, 244 unsolved in 16511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 25022ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 25026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25501 ms. Remains : 149/149 places, 245/245 transitions.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
RANDOM walk for 3006 steps (544 resets) in 13 ms. (214 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 53 ms :[p0]
Product exploration explored 100000 steps with 18016 reset in 196 ms.
Product exploration explored 100000 steps with 18023 reset in 193 ms.
Built C files in :
/tmp/ltsmin16982387213891501876
[2024-05-27 08:00:04] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2024-05-27 08:00:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:04] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2024-05-27 08:00:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:04] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2024-05-27 08:00:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:04] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16982387213891501876
Running compilation step : cd /tmp/ltsmin16982387213891501876;'/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 609 ms.
Running link step : cd /tmp/ltsmin16982387213891501876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16982387213891501876;'/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/stateBased9303915431819123181.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 148 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 147 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 147 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 143 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 143 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 143 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 141 transition count 208
Applied a total of 21 rules in 22 ms. Remains 141 /149 variables (removed 8) and now considering 208/245 (removed 37) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 08:00:19] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 08:00:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 08:00:20] [INFO ] Invariant cache hit.
[2024-05-27 08:00:20] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 08:00:20] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-27 08:00:20] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-27 08:00:20] [INFO ] Invariant cache hit.
[2024-05-27 08:00:20] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 234 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5779 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 207/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 441 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11916 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 18001ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 18004ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/149 places, 208/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18432 ms. Remains : 141/149 places, 208/245 transitions.
Built C files in :
/tmp/ltsmin2840399014382531352
[2024-05-27 08:00:38] [INFO ] Computing symmetric may disable matrix : 208 transitions.
[2024-05-27 08:00:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:38] [INFO ] Computing symmetric may enable matrix : 208 transitions.
[2024-05-27 08:00:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:38] [INFO ] Computing Do-Not-Accords matrix : 208 transitions.
[2024-05-27 08:00:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:00:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2840399014382531352
Running compilation step : cd /tmp/ltsmin2840399014382531352;'/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 532 ms.
Running link step : cd /tmp/ltsmin2840399014382531352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2840399014382531352;'/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/stateBased2838895412632185828.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 08:00:53] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:00:53] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:00:53] [INFO ] Time to serialize gal into /tmp/LTL17037644096625931278.gal : 1 ms
[2024-05-27 08:00:53] [INFO ] Time to serialize properties into /tmp/LTL10239305336013097580.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/LTL17037644096625931278.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1681497681721144854.hoa' '-atoms' '/tmp/LTL10239305336013097580.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/LTL10239305336013097580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1681497681721144854.hoa
Detected timeout of ITS tools.
[2024-05-27 08:01:08] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:01:08] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:01:08] [INFO ] Time to serialize gal into /tmp/LTL12214162454368244298.gal : 2 ms
[2024-05-27 08:01:08] [INFO ] Time to serialize properties into /tmp/LTL7253767788451080666.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/LTL12214162454368244298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7253767788451080666.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((s1<1)||(l3932<1))"))||(G("((s1>=1)&&(l3919>=1))")))))
Formula 0 simplified : G(F!"((s1<1)||(l3932<1))" & F!"((s1>=1)&&(l3919>=1))")
Detected timeout of ITS tools.
[2024-05-27 08:01:23] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:01:23] [INFO ] Applying decomposition
[2024-05-27 08:01:23] [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/graph5457081321200678772.txt' '-o' '/tmp/graph5457081321200678772.bin' '-w' '/tmp/graph5457081321200678772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5457081321200678772.bin' '-l' '-1' '-v' '-w' '/tmp/graph5457081321200678772.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:01:23] [INFO ] Decomposing Gal with order
[2024-05-27 08:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:01:23] [INFO ] Removed a total of 248 redundant transitions.
[2024-05-27 08:01:23] [INFO ] Flatten gal took : 25 ms
[2024-05-27 08:01:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 6 ms.
[2024-05-27 08:01:23] [INFO ] Time to serialize gal into /tmp/LTL2318358160838717517.gal : 2 ms
[2024-05-27 08:01:23] [INFO ] Time to serialize properties into /tmp/LTL3049990715944874085.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/LTL2318358160838717517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3049990715944874085.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("((u0.s1<1)||(i7.u6.l3932<1))"))||(G("((u0.s1>=1)&&(i7.u6.l3919>=1))")))))
Formula 0 simplified : G(F!"((u0.s1<1)||(i7.u6.l3932<1))" & F!"((u0.s1>=1)&&(i7.u6.l3919>=1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 finished in 162326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 159 transition count 232
Applied a total of 287 rules in 23 ms. Remains 159 /264 variables (removed 105) and now considering 232/862 (removed 630) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-05-27 08:01:38] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 08:01:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:01:38] [INFO ] Invariant cache hit.
[2024-05-27 08:01:38] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 08:01:39] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-27 08:01:39] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-27 08:01:39] [INFO ] Invariant cache hit.
[2024-05-27 08:01:39] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 252 constraints, problems are : Problem set: 0 solved, 231 unsolved in 6849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 231/483 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-27 08:01:50] [INFO ] Deduced a trap composed of 48 places in 42 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 08:01:51] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 08:01:51] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-27 08:01:51] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:01:53] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-27 08:01:53] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 6/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 489 constraints, problems are : Problem set: 22 solved, 209 unsolved in 19849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints]
After SMT, in 27054ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 27058ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/264 places, 210/862 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 204
Applied a total of 7 rules in 12 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 08:02:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:02:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 08:02:06] [INFO ] Invariant cache hit.
[2024-05-27 08:02:06] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 08:02:06] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/264 places, 204/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27908 ms. Remains : 141/264 places, 204/862 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 finished in 27974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !(!p0 U p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
[2024-05-27 08:02:07] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2820464274760862700
[2024-05-27 08:02:07] [INFO ] Computing symmetric may disable matrix : 862 transitions.
[2024-05-27 08:02:07] [INFO ] Applying decomposition
[2024-05-27 08:02:07] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:02:07] [INFO ] Flatten gal took : 21 ms
[2024-05-27 08:02:07] [INFO ] Computing symmetric may enable matrix : 862 transitions.
[2024-05-27 08:02:07] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4845750725764423610.txt' '-o' '/tmp/graph4845750725764423610.bin' '-w' '/tmp/graph4845750725764423610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4845750725764423610.bin' '-l' '-1' '-v' '-w' '/tmp/graph4845750725764423610.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:02:07] [INFO ] Decomposing Gal with order
[2024-05-27 08:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:02:07] [INFO ] Removed a total of 464 redundant transitions.
[2024-05-27 08:02:07] [INFO ] Flatten gal took : 48 ms
[2024-05-27 08:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 484 labels/synchronizations in 17 ms.
[2024-05-27 08:02:07] [INFO ] Time to serialize gal into /tmp/LTLFireability5001131922985273959.gal : 6 ms
[2024-05-27 08:02:07] [INFO ] Time to serialize properties into /tmp/LTLFireability2727012687050728424.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/LTLFireability5001131922985273959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2727012687050728424.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
[2024-05-27 08:02:07] [INFO ] Computing Do-Not-Accords matrix : 862 transitions.
[2024-05-27 08:02:07] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((F(G(("((u0.s1>=1)&&(u0.l3931>=1))")U(!((!("((u0.s1>=1)&&(u0.l3931>=1))"))U("(((u0.s1>=1)&&(u0.l3925>=1))||((u0.s1>=1)&&(u0.l3913>=1...166
Formula 0 simplified : GF(!"((u0.s1>=1)&&(u0.l3931>=1))" R (!"((u0.s1>=1)&&(u0.l3931>=1))" U "(((u0.s1>=1)&&(u0.l3925>=1))||((u0.s1>=1)&&(u0.l3913>=1)))"))
[2024-05-27 08:02:07] [INFO ] Built C files in 322ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2820464274760862700
Running compilation step : cd /tmp/ltsmin2820464274760862700;'/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'
Compilation finished in 3292 ms.
Running link step : cd /tmp/ltsmin2820464274760862700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true) U !(!(LTLAPp0==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true) U !(!(LTLAPp0==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](!(LTLAPp3==true))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](!(LTLAPp3==true))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2820464274760862700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true) U !(!(LTLAPp0==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 08:26:54] [INFO ] Flatten gal took : 63 ms
[2024-05-27 08:26:54] [INFO ] Time to serialize gal into /tmp/LTLFireability15744143898513722002.gal : 7 ms
[2024-05-27 08:26:54] [INFO ] Time to serialize properties into /tmp/LTLFireability8141779445600845855.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/LTLFireability15744143898513722002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8141779445600845855.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...298
Read 3 LTL properties
Checking formula 0 : !((F(G(("((s1>=1)&&(l3931>=1))")U(!((!("((s1>=1)&&(l3931>=1))"))U("(((s1>=1)&&(l3925>=1))||((s1>=1)&&(l3913>=1)))")))))))
Formula 0 simplified : GF(!"((s1>=1)&&(l3931>=1))" R (!"((s1>=1)&&(l3931>=1))" U "(((s1>=1)&&(l3925>=1))||((s1>=1)&&(l3913>=1)))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t27, t28, t29, t30, t31, t32, t33, t34, t39, t40, t41, t42, t43, t44, t45, t46, t47, t69,...3664
Computing Next relation with stutter on 2.86757e+11 deadlock states

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-d1m020"
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-d1m020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679079500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;