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.r202-smll-171649587400092.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 HirschbergSinclair-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587400092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 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 HirschbergSinclair-PT-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716599198384

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 01:06:40] [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-25 01:06:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 01:06:41] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2024-05-25 01:06:41] [INFO ] Transformed 600 places.
[2024-05-25 01:06:41] [INFO ] Transformed 545 transitions.
[2024-05-25 01:06:41] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 47 place count 553 transition count 523
Iterating global reduction 1 with 22 rules applied. Total rules applied 69 place count 553 transition count 523
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 87 place count 535 transition count 505
Iterating global reduction 1 with 18 rules applied. Total rules applied 105 place count 535 transition count 505
Applied a total of 105 rules in 513 ms. Remains 535 /600 variables (removed 65) and now considering 505/545 (removed 40) transitions.
// Phase 1: matrix 505 rows 535 cols
[2024-05-25 01:06:42] [INFO ] Computed 30 invariants in 59 ms
[2024-05-25 01:06:43] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-25 01:06:43] [INFO ] Invariant cache hit.
[2024-05-25 01:06:45] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 3210 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-05-25 01:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 25/535 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30476ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30521ms
Starting structural reductions in LTL mode, iteration 1 : 535/600 places, 505/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34293 ms. Remains : 535/600 places, 505/545 transitions.
Support contains 43 out of 535 places after structural reductions.
[2024-05-25 01:07:16] [INFO ] Flatten gal took : 102 ms
[2024-05-25 01:07:16] [INFO ] Flatten gal took : 50 ms
[2024-05-25 01:07:16] [INFO ] Input system was already deterministic with 505 transitions.
Support contains 42 out of 535 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 2396 ms. (16 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
[2024-05-25 01:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/347 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/482 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 505/987 variables, 482/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/1040 variables, 53/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1040 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 565 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1082 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/347 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/482 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 505/987 variables, 482/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 53/1040 variables, 53/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1040 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 579 ms.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 505/505 transitions.
Graph (complete) has 1012 edges and 535 vertex of which 517 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 517 transition count 278
Reduce places removed 209 places and 0 transitions.
Graph (complete) has 536 edges and 308 vertex of which 269 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 210 rules applied. Total rules applied 438 place count 269 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 477 place count 269 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 482 place count 264 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 264 transition count 234
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 491 place count 264 transition count 230
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 446 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 496 place count 254 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 502 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 503 place count 253 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 504 place count 253 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 511 place count 253 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 518 place count 246 transition count 216
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 541 place count 223 transition count 193
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 123 rules applied. Total rules applied 664 place count 205 transition count 88
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 8 with 105 rules applied. Total rules applied 769 place count 100 transition count 88
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 769 place count 100 transition count 74
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 797 place count 86 transition count 74
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 798 place count 85 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 798 place count 85 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 800 place count 84 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 806 place count 81 transition count 70
Applied a total of 806 rules in 135 ms. Remains 81 /535 variables (removed 454) and now considering 70/505 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 81/535 places, 70/505 transitions.
RANDOM walk for 40000 steps (548 resets) in 598 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (234 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (230 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Probably explored full state space saw : 3652 states, properties seen :1
Probabilistic random walk after 13782 steps, saw 3652 distinct states, run finished after 65 ms. (steps per millisecond=212 ) properties seen :1
Explored full state space saw : 3652 states, properties seen :0
Exhaustive walk after 13782 steps, saw 3652 distinct states, run finished after 23 ms. (steps per millisecond=599 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 535 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 535 transition count 505
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(!p1 U (G(!p1)||(G(p3)&&p2)))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 511 transition count 276
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 300 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 300 transition count 270
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 425 place count 300 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 428 place count 297 transition count 267
Applied a total of 428 rules in 97 ms. Remains 297 /535 variables (removed 238) and now considering 267/505 (removed 238) transitions.
// Phase 1: matrix 267 rows 297 cols
[2024-05-25 01:07:21] [INFO ] Computed 30 invariants in 7 ms
[2024-05-25 01:07:21] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-25 01:07:21] [INFO ] Invariant cache hit.
[2024-05-25 01:07:23] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2024-05-25 01:07:23] [INFO ] Redundant transitions in 25 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-25 01:07:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 222/473 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 1/474 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/564 variables, and 282 constraints, problems are : Problem set: 0 solved, 220 unsolved in 22172 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/297 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 222/473 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 220/501 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/564 variables, and 502 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/297 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 52301ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 52308ms
Starting structural reductions in SI_LTL mode, iteration 1 : 297/535 places, 267/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54431 ms. Remains : 297/535 places, 267/505 transitions.
Stuttering acceptance computed with spot in 528 ms :[(NOT p0), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00
Stuttering criterion allowed to conclude after 581 steps with 1 reset in 18 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 55096 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 (p2||X(p0))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 81 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:08:16] [INFO ] Computed 30 invariants in 9 ms
[2024-05-25 01:08:16] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-25 01:08:16] [INFO ] Invariant cache hit.
[2024-05-25 01:08:19] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 2862 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30207ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33158 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-01
Product exploration explored 100000 steps with 354 reset in 658 ms.
Product exploration explored 100000 steps with 355 reset in 483 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
RANDOM walk for 1869 steps (0 resets) in 36 ms. (50 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 492 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-05-25 01:08:52] [INFO ] Invariant cache hit.
[2024-05-25 01:08:53] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 239 ms returned sat
[2024-05-25 01:09:02] [INFO ] [Real]Absence check using state equation in 9309 ms returned sat
[2024-05-25 01:09:02] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 60 ms.
[2024-05-25 01:09:07] [INFO ] Added : 60 causal constraints over 12 iterations in 4726 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-25 01:09:07] [INFO ] Invariant cache hit.
[2024-05-25 01:09:08] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 253 ms returned sat
[2024-05-25 01:09:22] [INFO ] [Real]Absence check using state equation in 14084 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 12 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-05-25 01:09:22] [INFO ] Invariant cache hit.
[2024-05-25 01:09:23] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-25 01:09:23] [INFO ] Invariant cache hit.
[2024-05-25 01:09:25] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3087 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:09:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30236ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Finished structural reductions in LTL mode , in 1 iterations and 33349 ms. Remains : 526/526 places, 496/496 transitions.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
RANDOM walk for 1868 steps (0 resets) in 20 ms. (88 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 471 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-05-25 01:09:57] [INFO ] Invariant cache hit.
[2024-05-25 01:09:58] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 237 ms returned sat
[2024-05-25 01:10:07] [INFO ] [Real]Absence check using state equation in 8827 ms returned sat
[2024-05-25 01:10:07] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 42 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 01:10:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-25 01:10:12] [INFO ] Invariant cache hit.
[2024-05-25 01:10:13] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 244 ms returned sat
[2024-05-25 01:10:27] [INFO ] [Real]Absence check using state equation in 14094 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 524 ms.
Product exploration explored 100000 steps with 354 reset in 587 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 526 transition count 496
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 196 rules in 97 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-05-25 01:10:29] [INFO ] Redundant transitions in 14 ms returned []
Running 471 sub problems to find dead transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:10:29] [INFO ] Computed 30 invariants in 5 ms
[2024-05-25 01:10:29] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 196/752 constraints. Problems are: Problem set: 196 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 752 constraints, problems are : Problem set: 196 solved, 275 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 196 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 221/526 variables, 30/30 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1022 variables, 196/752 constraints. Problems are: Problem set: 196 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 275/1027 constraints. Problems are: Problem set: 196 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 196 solved, 275 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 275/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 196 solved, 275 unsolved
Search for dead transitions found 196 dead transitions in 60186ms
Found 196 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 196 transitions
Dead transitions reduction (with SMT) removed 196 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 526/526 places, 300/496 transitions.
Graph (complete) has 804 edges and 526 vertex of which 330 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.5 ms
Discarding 196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 40 ms. Remains 330 /526 variables (removed 196) and now considering 300/300 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 330/526 places, 300/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60347 ms. Remains : 330/526 places, 300/496 transitions.
Built C files in :
/tmp/ltsmin11046898682661999434
[2024-05-25 01:11:29] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11046898682661999434
Running compilation step : cd /tmp/ltsmin11046898682661999434;'/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 2196 ms.
Running link step : cd /tmp/ltsmin11046898682661999434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11046898682661999434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8685580327646179256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 13 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:11:44] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 01:11:45] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-25 01:11:45] [INFO ] Invariant cache hit.
[2024-05-25 01:11:48] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:11:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in LTL mode , in 1 iterations and 63899 ms. Remains : 526/526 places, 496/496 transitions.
Built C files in :
/tmp/ltsmin1016319196999161192
[2024-05-25 01:12:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1016319196999161192
Running compilation step : cd /tmp/ltsmin1016319196999161192;'/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 1658 ms.
Running link step : cd /tmp/ltsmin1016319196999161192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1016319196999161192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7355884259848049921.hoa' '--buchi-type=spotba'
LTSmin run took 13028 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-01 finished in 287395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 511 transition count 270
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 300 transition count 270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 429 place count 293 transition count 263
Iterating global reduction 2 with 7 rules applied. Total rules applied 436 place count 293 transition count 263
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 440 place count 293 transition count 259
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 444 place count 289 transition count 259
Applied a total of 444 rules in 35 ms. Remains 289 /535 variables (removed 246) and now considering 259/505 (removed 246) transitions.
// Phase 1: matrix 259 rows 289 cols
[2024-05-25 01:13:03] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 01:13:04] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-25 01:13:04] [INFO ] Invariant cache hit.
[2024-05-25 01:13:05] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2024-05-25 01:13:05] [INFO ] Redundant transitions in 6 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-25 01:13:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14051 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15176 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 29271ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 29275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 289/535 places, 259/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30802 ms. Remains : 289/535 places, 259/505 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02
Product exploration explored 100000 steps with 365 reset in 205 ms.
Product exploration explored 100000 steps with 366 reset in 346 ms.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 1138 steps (0 resets) in 12 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-25 01:13:35] [INFO ] Invariant cache hit.
[2024-05-25 01:13:35] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 73 ms returned sat
[2024-05-25 01:13:39] [INFO ] [Real]Absence check using state equation in 3041 ms returned sat
[2024-05-25 01:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:13:39] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 114 ms returned sat
[2024-05-25 01:13:40] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2024-05-25 01:13:40] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-25 01:13:42] [INFO ] Added : 182 causal constraints over 37 iterations in 1731 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 14 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-25 01:13:42] [INFO ] Invariant cache hit.
[2024-05-25 01:13:42] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-25 01:13:42] [INFO ] Invariant cache hit.
[2024-05-25 01:13:43] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2024-05-25 01:13:43] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-25 01:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15769 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17844 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 33645ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 33648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35023 ms. Remains : 289/289 places, 259/259 transitions.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
RANDOM walk for 1122 steps (0 resets) in 7 ms. (140 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-25 01:14:17] [INFO ] Invariant cache hit.
[2024-05-25 01:14:18] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 121 ms returned sat
[2024-05-25 01:14:21] [INFO ] [Real]Absence check using state equation in 2816 ms returned sat
[2024-05-25 01:14:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:14:21] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 142 ms returned sat
[2024-05-25 01:14:22] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2024-05-25 01:14:22] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-25 01:14:25] [INFO ] Added : 182 causal constraints over 37 iterations in 2399 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Product exploration explored 100000 steps with 365 reset in 208 ms.
Product exploration explored 100000 steps with 366 reset in 243 ms.
Built C files in :
/tmp/ltsmin3397416571252128278
[2024-05-25 01:14:25] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-25 01:14:25] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:14:25] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-25 01:14:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:14:25] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-25 01:14:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:14:25] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3397416571252128278
Running compilation step : cd /tmp/ltsmin3397416571252128278;'/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 1297 ms.
Running link step : cd /tmp/ltsmin3397416571252128278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3397416571252128278;'/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/stateBased14690754511530290581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 11 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-25 01:14:40] [INFO ] Invariant cache hit.
[2024-05-25 01:14:41] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-25 01:14:41] [INFO ] Invariant cache hit.
[2024-05-25 01:14:42] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2024-05-25 01:14:42] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-25 01:14:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/548 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13857 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 3/246 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 216/462 variables, 246/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/548 variables, and 489 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15477 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 246/289 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 29358ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 29361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30881 ms. Remains : 289/289 places, 259/259 transitions.
Built C files in :
/tmp/ltsmin3524082056269735159
[2024-05-25 01:15:11] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-25 01:15:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:15:11] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-25 01:15:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:15:11] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-25 01:15:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:15:11] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3524082056269735159
Running compilation step : cd /tmp/ltsmin3524082056269735159;'/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 1240 ms.
Running link step : cd /tmp/ltsmin3524082056269735159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3524082056269735159;'/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/stateBased13275727104222153694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 01:15:26] [INFO ] Flatten gal took : 21 ms
[2024-05-25 01:15:26] [INFO ] Flatten gal took : 25 ms
[2024-05-25 01:15:26] [INFO ] Time to serialize gal into /tmp/LTL399275168035527396.gal : 10 ms
[2024-05-25 01:15:26] [INFO ] Time to serialize properties into /tmp/LTL280425488864027783.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL399275168035527396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5974071694915632207.hoa' '-atoms' '/tmp/LTL280425488864027783.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...315
Loading property file /tmp/LTL280425488864027783.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5974071694915632207.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t60, t61.t62, t63...417
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 01:15:41] [INFO ] Flatten gal took : 27 ms
[2024-05-25 01:15:41] [INFO ] Flatten gal took : 25 ms
[2024-05-25 01:15:41] [INFO ] Time to serialize gal into /tmp/LTL2376178857717046944.gal : 7 ms
[2024-05-25 01:15:41] [INFO ] Time to serialize properties into /tmp/LTL13221628173308281673.ltl : 3 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/LTL2376178857717046944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13221628173308281673.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("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t60, t61.t62, t63...417
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 01:15:57] [INFO ] Flatten gal took : 12 ms
[2024-05-25 01:15:57] [INFO ] Applying decomposition
[2024-05-25 01:15:57] [INFO ] Flatten gal took : 13 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/graph9098398943433648732.txt' '-o' '/tmp/graph9098398943433648732.bin' '-w' '/tmp/graph9098398943433648732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9098398943433648732.bin' '-l' '-1' '-v' '-w' '/tmp/graph9098398943433648732.weights' '-q' '0' '-e' '0.001'
[2024-05-25 01:15:57] [INFO ] Decomposing Gal with order
[2024-05-25 01:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 01:15:57] [INFO ] Removed a total of 165 redundant transitions.
[2024-05-25 01:15:57] [INFO ] Flatten gal took : 79 ms
[2024-05-25 01:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 17 ms.
[2024-05-25 01:15:57] [INFO ] Time to serialize gal into /tmp/LTL17099924504878364639.gal : 11 ms
[2024-05-25 01:15:57] [INFO ] Time to serialize properties into /tmp/LTL10217559426603130522.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/LTL17099924504878364639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10217559426603130522.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("((i4.u0.newmsg10>=1)&&(i5.i11.u111.elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((i4.u0.newmsg10>=1)&&(i5.i11.u111.elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t35_t36, t63_t64, t115_t116, t233_t234, t427_t428, t463_t464, t477_t478, i1.t164_t165, i1.i0....493
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 188792 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((X(X((p0&&X(p1))))||G(p2)))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 54 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 01:16:12] [INFO ] Computed 30 invariants in 6 ms
[2024-05-25 01:16:13] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-25 01:16:13] [INFO ] Invariant cache hit.
[2024-05-25 01:16:15] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-25 01:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62883 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-03
Product exploration explored 100000 steps with 16661 reset in 326 ms.
Product exploration explored 100000 steps with 16651 reset in 511 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (72 resets) in 246 ms. (161 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2024-05-25 01:17:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 458/461 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/478 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/973 variables, 478/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/1020 variables, 47/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1020 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1301 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 458/461 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/478 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/973 variables, 478/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/1020 variables, 47/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1020 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1020 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 628 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 787 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 495/495 transitions.
Graph (complete) has 999 edges and 525 vertex of which 500 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 500 transition count 253
Reduce places removed 217 places and 0 transitions.
Graph (complete) has 491 edges and 283 vertex of which 113 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.0 ms
Discarding 170 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Iterating post reduction 1 with 218 rules applied. Total rules applied 461 place count 113 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 552 place count 113 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 552 place count 113 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 556 place count 111 transition count 90
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 573 place count 94 transition count 73
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 53 rules applied. Total rules applied 626 place count 80 transition count 34
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 665 place count 41 transition count 34
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 665 place count 41 transition count 19
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 695 place count 26 transition count 19
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 697 place count 24 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 697 place count 24 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 701 place count 22 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 703 place count 21 transition count 16
Applied a total of 703 rules in 35 ms. Remains 21 /525 variables (removed 504) and now considering 16/495 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 21/525 places, 16/495 transitions.
RANDOM walk for 40000 steps (2352 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (1213 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
// Phase 1: matrix 16 rows 21 cols
[2024-05-25 01:17:20] [INFO ] Computed 5 invariants in 0 ms
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) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/29 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/33 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/36 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/37 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/37 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/29 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/31 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/33 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/36 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/37 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/37 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/37 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/37 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 21/21 places, 16/16 transitions.
RANDOM walk for 30109 steps (1769 resets) in 46 ms. (640 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p2))))
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 68617 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((F((G(p1)||G(!p1)))&&p0))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 58 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:17:21] [INFO ] Computed 30 invariants in 5 ms
[2024-05-25 01:17:21] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-25 01:17:21] [INFO ] Invariant cache hit.
[2024-05-25 01:17:24] [INFO ] Implicit Places using invariants and state equation in 2437 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63462 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-04
Stuttering criterion allowed to conclude after 1049 steps with 1 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-04 finished in 63650 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 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 34 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 01:18:24] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 01:18:25] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-25 01:18:25] [INFO ] Invariant cache hit.
[2024-05-25 01:18:27] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-25 01:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62549 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05
Product exploration explored 100000 steps with 369 reset in 299 ms.
Product exploration explored 100000 steps with 369 reset in 351 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1090 steps (0 resets) in 10 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 118 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-05-25 01:19:28] [INFO ] Invariant cache hit.
[2024-05-25 01:19:29] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 108 ms returned sat
[2024-05-25 01:19:34] [INFO ] [Real]Absence check using state equation in 5569 ms returned sat
[2024-05-25 01:19:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:19:35] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 209 ms returned sat
[2024-05-25 01:19:40] [INFO ] [Nat]Absence check using state equation in 4771 ms returned sat
[2024-05-25 01:19:40] [INFO ] Computed and/alt/rep : 253/482/253 causal constraints (skipped 217 transitions) in 37 ms.
[2024-05-25 01:19:42] [INFO ] Added : 108 causal constraints over 22 iterations in 2060 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 495/495 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 501 transition count 261
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 291 transition count 261
Applied a total of 420 rules in 19 ms. Remains 291 /525 variables (removed 234) and now considering 261/495 (removed 234) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-05-25 01:19:42] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 01:19:43] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-25 01:19:43] [INFO ] Invariant cache hit.
[2024-05-25 01:19:44] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2024-05-25 01:19:44] [INFO ] Redundant transitions in 0 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-25 01:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13068 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 19434 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 32536ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 32538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/525 places, 261/495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34395 ms. Remains : 291/525 places, 261/495 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 578 steps (0 resets) in 4 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 130 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 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-25 01:20:17] [INFO ] Invariant cache hit.
[2024-05-25 01:20:18] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 81 ms returned sat
[2024-05-25 01:20:19] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-05-25 01:20:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:20:19] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 87 ms returned sat
[2024-05-25 01:20:20] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2024-05-25 01:20:20] [INFO ] Computed and/alt/rep : 205/212/205 causal constraints (skipped 10 transitions) in 24 ms.
[2024-05-25 01:20:20] [INFO ] Added : 60 causal constraints over 12 iterations in 667 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 751 reset in 295 ms.
Product exploration explored 100000 steps with 751 reset in 459 ms.
Built C files in :
/tmp/ltsmin17333089335850273459
[2024-05-25 01:20:21] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 01:20:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:20:21] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 01:20:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:20:21] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 01:20:21] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:20:21] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17333089335850273459
Running compilation step : cd /tmp/ltsmin17333089335850273459;'/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 1057 ms.
Running link step : cd /tmp/ltsmin17333089335850273459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin17333089335850273459;'/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/stateBased173722034169268245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-25 01:20:36] [INFO ] Invariant cache hit.
[2024-05-25 01:20:37] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-25 01:20:37] [INFO ] Invariant cache hit.
[2024-05-25 01:20:38] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2024-05-25 01:20:38] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-25 01:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/552 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15589 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 3/248 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 218/466 variables, 248/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/552 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15503 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 248/291 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 31115ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 31118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32597 ms. Remains : 291/291 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin1966852043216045080
[2024-05-25 01:21:09] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 01:21:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:21:09] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 01:21:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:21:09] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 01:21:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:21:09] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1966852043216045080
Running compilation step : cd /tmp/ltsmin1966852043216045080;'/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 1038 ms.
Running link step : cd /tmp/ltsmin1966852043216045080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1966852043216045080;'/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/stateBased5179374089873687539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 01:21:24] [INFO ] Flatten gal took : 15 ms
[2024-05-25 01:21:24] [INFO ] Flatten gal took : 12 ms
[2024-05-25 01:21:24] [INFO ] Time to serialize gal into /tmp/LTL11112745628539743217.gal : 4 ms
[2024-05-25 01:21:24] [INFO ] Time to serialize properties into /tmp/LTL1506772699155003580.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/LTL11112745628539743217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13077450891299861677.hoa' '-atoms' '/tmp/LTL1506772699155003580.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/LTL1506772699155003580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13077450891299861677.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t59.t60, t63.t64...420
Computing Next relation with stutter on 1.78814e+18 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1480 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.8495,378812,1,0,1055,1.72117e+06,551,671,8182,1.57424e+06,1887
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 195043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 34 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:21:39] [INFO ] Computed 30 invariants in 6 ms
[2024-05-25 01:21:40] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-25 01:21:40] [INFO ] Invariant cache hit.
[2024-05-25 01:21:42] [INFO ] Implicit Places using invariants and state equation in 2348 ms returned []
Implicit Place search using SMT with State Equation took 2763 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
(s140 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 2.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62966 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06
Stuttering criterion allowed to conclude after 545 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 63067 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(G(p0))&&F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 42 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-05-25 01:22:42] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 01:22:43] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-25 01:22:43] [INFO ] Invariant cache hit.
[2024-05-25 01:22:44] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2024-05-25 01:22:44] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-25 01:22:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 221/472 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/558 variables, and 281 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15518 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/294 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 221/472 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 218/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/558 variables, and 499 constraints, problems are : Problem set: 0 solved, 218 unsolved in 22026 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/294 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 37582ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 37586ms
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39337 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07
Product exploration explored 100000 steps with 460 reset in 396 ms.
Product exploration explored 100000 steps with 460 reset in 439 ms.
Computed a total of 294 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 294 transition count 264
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 907 steps (0 resets) in 8 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 40890 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 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 510 transition count 262
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 292 transition count 262
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 443 place count 285 transition count 255
Iterating global reduction 2 with 7 rules applied. Total rules applied 450 place count 285 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 454 place count 285 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 458 place count 281 transition count 251
Applied a total of 458 rules in 32 ms. Remains 281 /535 variables (removed 254) and now considering 251/505 (removed 254) transitions.
// Phase 1: matrix 251 rows 281 cols
[2024-05-25 01:23:23] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 01:23:24] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-25 01:23:24] [INFO ] Invariant cache hit.
[2024-05-25 01:23:25] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2024-05-25 01:23:25] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-25 01:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/532 variables, and 264 constraints, problems are : Problem set: 0 solved, 202 unsolved in 12953 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 202/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/532 variables, and 466 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13497 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 26480ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 26483ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/535 places, 251/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28344 ms. Remains : 281/535 places, 251/505 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09
Stuttering criterion allowed to conclude after 276 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 28423 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&&F(G(p1))))))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 62 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 01:23:52] [INFO ] Computed 30 invariants in 5 ms
[2024-05-25 01:23:52] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-25 01:23:52] [INFO ] Invariant cache hit.
[2024-05-25 01:23:54] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-25 01:23:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62926 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10
Stuttering criterion allowed to conclude after 750 steps with 1 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 63099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 512 transition count 275
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 305 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 420 place count 299 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 299 transition count 269
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 299 transition count 265
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 295 transition count 265
Applied a total of 434 rules in 25 ms. Remains 295 /535 variables (removed 240) and now considering 265/505 (removed 240) transitions.
// Phase 1: matrix 265 rows 295 cols
[2024-05-25 01:24:55] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 01:24:55] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-25 01:24:55] [INFO ] Invariant cache hit.
[2024-05-25 01:24:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 01:24:57] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2024-05-25 01:24:57] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-25 01:24:57] [INFO ] Invariant cache hit.
[2024-05-25 01:24:57] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 4/256 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 228/484 variables, 256/286 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 2/486 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/560 variables, and 295 constraints, problems are : Problem set: 0 solved, 222 unsolved in 26128 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 258/295 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 4/256 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 228/484 variables, 256/286 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 222/515 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 2/486 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 0/486 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/560 variables, and 517 constraints, problems are : Problem set: 0 solved, 222 unsolved in 29180 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 258/295 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 55349ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 55352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 295/535 places, 265/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57406 ms. Remains : 295/535 places, 265/505 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11
Stuttering criterion allowed to conclude after 431 steps with 1 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 57580 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 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 24 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-05-25 01:25:52] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 01:25:53] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-25 01:25:53] [INFO ] Invariant cache hit.
[2024-05-25 01:25:54] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2024-05-25 01:25:54] [INFO ] Redundant transitions in 0 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-25 01:25:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/468 variables, 249/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 2/470 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/558 variables, and 280 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18431 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/294 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/468 variables, 249/279 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 203/482 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 2/470 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 14/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/558 variables, and 497 constraints, problems are : Problem set: 0 solved, 217 unsolved in 29159 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/294 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 47617ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 47619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49371 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-12
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-12 finished in 49456 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(p0)&&X(X(X(F(p1)))))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 528 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 528 transition count 498
Applied a total of 14 rules in 35 ms. Remains 528 /535 variables (removed 7) and now considering 498/505 (removed 7) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-05-25 01:26:42] [INFO ] Computed 30 invariants in 5 ms
[2024-05-25 01:26:42] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-25 01:26:42] [INFO ] Invariant cache hit.
[2024-05-25 01:26:45] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-25 01:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 528/535 places, 498/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62907 ms. Remains : 528/535 places, 498/505 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-13
Product exploration explored 100000 steps with 1293 reset in 464 ms.
Product exploration explored 100000 steps with 1220 reset in 645 ms.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 526 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 440 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 620 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 398 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-25 01:27:49] [INFO ] Invariant cache hit.
[2024-05-25 01:27:49] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 130 ms returned sat
[2024-05-25 01:27:55] [INFO ] [Real]Absence check using state equation in 5785 ms returned sat
[2024-05-25 01:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:27:56] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 150 ms returned sat
[2024-05-25 01:27:59] [INFO ] [Nat]Absence check using state equation in 2969 ms returned sat
[2024-05-25 01:27:59] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 43 ms.
[2024-05-25 01:28:01] [INFO ] Added : 76 causal constraints over 16 iterations in 2014 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Applied a total of 0 rules in 18 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-25 01:28:01] [INFO ] Invariant cache hit.
[2024-05-25 01:28:01] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-25 01:28:01] [INFO ] Invariant cache hit.
[2024-05-25 01:28:04] [INFO ] Implicit Places using invariants and state equation in 2243 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-25 01:28:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in LTL mode , in 1 iterations and 62992 ms. Remains : 528/528 places, 498/498 transitions.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 530 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 565 steps (0 resets) in 8 ms. (62 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 372 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 609 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-25 01:29:06] [INFO ] Invariant cache hit.
[2024-05-25 01:29:07] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 168 ms returned sat
[2024-05-25 01:29:13] [INFO ] [Real]Absence check using state equation in 5964 ms returned sat
[2024-05-25 01:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:29:14] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 126 ms returned sat
[2024-05-25 01:29:17] [INFO ] [Nat]Absence check using state equation in 2977 ms returned sat
[2024-05-25 01:29:17] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 47 ms.
[2024-05-25 01:29:20] [INFO ] Added : 76 causal constraints over 16 iterations in 2994 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 421 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1214 reset in 665 ms.
Product exploration explored 100000 steps with 1238 reset in 467 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 446 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 528 transition count 498
Deduced a syphon composed of 210 places in 2 ms
Applied a total of 210 rules in 33 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-25 01:29:22] [INFO ] Redundant transitions in 2 ms returned []
Running 473 sub problems to find dead transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-05-25 01:29:22] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 01:29:22] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 210/768 constraints. Problems are: Problem set: 210 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 768 constraints, problems are : Problem set: 210 solved, 263 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 210 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 235/528 variables, 30/30 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1026 variables, 210/768 constraints. Problems are: Problem set: 210 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 263/1031 constraints. Problems are: Problem set: 210 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 210 solved, 263 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 263/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 210 solved, 263 unsolved
Search for dead transitions found 210 dead transitions in 60180ms
Found 210 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 210 transitions
Dead transitions reduction (with SMT) removed 210 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 528/528 places, 288/498 transitions.
Graph (complete) has 794 edges and 528 vertex of which 318 are kept as prefixes of interest. Removing 210 places using SCC suffix rule.2 ms
Discarding 210 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 318 /528 variables (removed 210) and now considering 288/288 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 318/528 places, 288/498 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60244 ms. Remains : 318/528 places, 288/498 transitions.
Built C files in :
/tmp/ltsmin2191337223320391209
[2024-05-25 01:30:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2191337223320391209
Running compilation step : cd /tmp/ltsmin2191337223320391209;'/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 1800 ms.
Running link step : cd /tmp/ltsmin2191337223320391209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2191337223320391209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7695858317404754149.hoa' '--buchi-type=spotba'
LTSmin run took 8080 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-13 finished in 230199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U X(p0))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 34 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 01:30:32] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 01:30:32] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-25 01:30:32] [INFO ] Invariant cache hit.
[2024-05-25 01:30:35] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-25 01:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33193 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14
Product exploration explored 100000 steps with 2538 reset in 413 ms.
Product exploration explored 100000 steps with 2677 reset in 745 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 517 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 151 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 9 factoid took 590 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-25 01:31:08] [INFO ] Invariant cache hit.
[2024-05-25 01:31:09] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 167 ms returned sat
[2024-05-25 01:31:23] [INFO ] [Real]Absence check using state equation in 14220 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 526 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 : 526/526 places, 496/496 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 503 transition count 261
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 291 transition count 261
Applied a total of 424 rules in 13 ms. Remains 291 /526 variables (removed 235) and now considering 261/496 (removed 235) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-05-25 01:31:23] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 01:31:24] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 01:31:24] [INFO ] Invariant cache hit.
[2024-05-25 01:31:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 01:31:25] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2024-05-25 01:31:25] [INFO ] Redundant transitions in 2 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-25 01:31:25] [INFO ] Invariant cache hit.
[2024-05-25 01:31:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15395 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 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/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 20920 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 36356ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 36360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/526 places, 261/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37653 ms. Remains : 291/526 places, 261/496 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 128 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 152 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 155 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-05-25 01:32:02] [INFO ] Invariant cache hit.
[2024-05-25 01:32:02] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 60 ms returned sat
[2024-05-25 01:32:04] [INFO ] [Real]Absence check using state equation in 1930 ms returned sat
[2024-05-25 01:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:32:04] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2024-05-25 01:32:07] [INFO ] [Nat]Absence check using state equation in 2642 ms returned sat
[2024-05-25 01:32:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 01:32:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-25 01:32:07] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 17 ms.
[2024-05-25 01:32:10] [INFO ] Added : 156 causal constraints over 32 iterations in 2548 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2436 reset in 781 ms.
Product exploration explored 100000 steps with 2357 reset in 579 ms.
Built C files in :
/tmp/ltsmin10731121194275649978
[2024-05-25 01:32:11] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 01:32:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:32:11] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 01:32:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:32:11] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 01:32:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:32:11] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10731121194275649978
Running compilation step : cd /tmp/ltsmin10731121194275649978;'/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 995 ms.
Running link step : cd /tmp/ltsmin10731121194275649978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10731121194275649978;'/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/stateBased15186715916383542768.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-25 01:32:26] [INFO ] Invariant cache hit.
[2024-05-25 01:32:27] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-25 01:32:27] [INFO ] Invariant cache hit.
[2024-05-25 01:32:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 01:32:28] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2024-05-25 01:32:28] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-25 01:32:28] [INFO ] Invariant cache hit.
[2024-05-25 01:32:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/552 variables, and 288 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17813 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 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/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/250 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/470 variables, 250/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 216/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/552 variables, and 504 constraints, problems are : Problem set: 0 solved, 216 unsolved in 16225 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 250/291 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 34069ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 34071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35438 ms. Remains : 291/291 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin11670029233593687248
[2024-05-25 01:33:02] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 01:33:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:33:02] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 01:33:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:33:02] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 01:33:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:33:02] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11670029233593687248
Running compilation step : cd /tmp/ltsmin11670029233593687248;'/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 1072 ms.
Running link step : cd /tmp/ltsmin11670029233593687248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11670029233593687248;'/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/stateBased2312680659426732.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 01:33:17] [INFO ] Flatten gal took : 13 ms
[2024-05-25 01:33:17] [INFO ] Flatten gal took : 10 ms
[2024-05-25 01:33:17] [INFO ] Time to serialize gal into /tmp/LTL17952085130718602923.gal : 3 ms
[2024-05-25 01:33:17] [INFO ] Time to serialize properties into /tmp/LTL16263666079023609639.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/LTL17952085130718602923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10443946785193870400.hoa' '-atoms' '/tmp/LTL16263666079023609639.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...320
Loading property file /tmp/LTL16263666079023609639.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10443946785193870400.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t59.t60, t61...427
Computing Next relation with stutter on 2.14577e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 01:33:32] [INFO ] Flatten gal took : 10 ms
[2024-05-25 01:33:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 01:33:32] [INFO ] Time to serialize gal into /tmp/LTL14968790386501102743.gal : 7 ms
[2024-05-25 01:33:32] [INFO ] Time to serialize properties into /tmp/LTL1006504063944102582.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/LTL14968790386501102743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1006504063944102582.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 : !(((!("((newmsg11>=1)&&(election_10_0_1_to_right_10>=1))"))U((G("(rcv_left_election_25_4_11_11>=1)"))U(X("((newmsg11>=1)&&(election_10...182
Formula 0 simplified : "((newmsg11>=1)&&(election_10_0_1_to_right_10>=1))" R (F!"(rcv_left_election_25_4_11_11>=1)" R X!"((newmsg11>=1)&&(election_10_0_1_t...172
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t59.t60, t61...427
Computing Next relation with stutter on 2.14577e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 01:33:47] [INFO ] Flatten gal took : 10 ms
[2024-05-25 01:33:47] [INFO ] Applying decomposition
[2024-05-25 01:33:47] [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/graph2377736291687842884.txt' '-o' '/tmp/graph2377736291687842884.bin' '-w' '/tmp/graph2377736291687842884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2377736291687842884.bin' '-l' '-1' '-v' '-w' '/tmp/graph2377736291687842884.weights' '-q' '0' '-e' '0.001'
[2024-05-25 01:33:47] [INFO ] Decomposing Gal with order
[2024-05-25 01:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 01:33:47] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-25 01:33:47] [INFO ] Flatten gal took : 27 ms
[2024-05-25 01:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2024-05-25 01:33:47] [INFO ] Time to serialize gal into /tmp/LTL9927705998701501719.gal : 7 ms
[2024-05-25 01:33:47] [INFO ] Time to serialize properties into /tmp/LTL18012238422331858626.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/LTL9927705998701501719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18012238422331858626.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 : !(((!("((i5.i0.u0.newmsg11>=1)&&(i5.i0.u0.election_10_0_1_to_right_10>=1))"))U((G("(i5.i0.u0.rcv_left_election_25_4_11_11>=1)"))U(X("(...227
Formula 0 simplified : "((i5.i0.u0.newmsg11>=1)&&(i5.i0.u0.election_10_0_1_to_right_10>=1))" R (F!"(i5.i0.u0.rcv_left_election_25_4_11_11>=1)" R X!"((i5.i0...217
Reverse transition relation is NOT exact ! Due to transitions t51_t52, t69_t70, t92_t93, t110_t111, t176_t177, t477_t478, i1.t124_t125, i1.i1.t115_t116, i1...561
Computing Next relation with stutter on 2.14577e+18 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
596 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.01985,189572,1,0,311633,4037,4971,1.26547e+06,400,20718,285353
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 202466 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) U p1)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 33 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 01:33:54] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 01:33:55] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-25 01:33:55] [INFO ] Invariant cache hit.
[2024-05-25 01:33:57] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-25 01:33:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62604 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15
Entered a terminal (fully accepting) state of product in 195 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 62806 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))'
[2024-05-25 01:34:57] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7180910611081649817
[2024-05-25 01:34:57] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-25 01:34:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:34:57] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-25 01:34:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:34:57] [INFO ] Applying decomposition
[2024-05-25 01:34:57] [INFO ] Flatten gal took : 29 ms
[2024-05-25 01:34:57] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-25 01:34:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 01:34:57] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7180910611081649817
Running compilation step : cd /tmp/ltsmin7180910611081649817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph12095714013452930094.txt' '-o' '/tmp/graph12095714013452930094.bin' '-w' '/tmp/graph12095714013452930094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12095714013452930094.bin' '-l' '-1' '-v' '-w' '/tmp/graph12095714013452930094.weights' '-q' '0' '-e' '0.001'
[2024-05-25 01:34:58] [INFO ] Decomposing Gal with order
[2024-05-25 01:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 01:34:58] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-25 01:34:58] [INFO ] Flatten gal took : 66 ms
[2024-05-25 01:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-25 01:34:58] [INFO ] Time to serialize gal into /tmp/LTLFireability11478789895131590332.gal : 13 ms
[2024-05-25 01:34:58] [INFO ] Time to serialize properties into /tmp/LTLFireability5699249280999497052.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/LTLFireability11478789895131590332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5699249280999497052.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...277
Read 1 LTL properties
Checking formula 0 : !((F("((i10.i1.u8.newmsg10>=1)&&(i10.i2.u59.elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((i10.i1.u8.newmsg10>=1)&&(i10.i2.u59.elected_25_to_left_11>=1))"
Compilation finished in 2203 ms.
Running link step : cd /tmp/ltsmin7180910611081649817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7180910611081649817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t9, t10, t11, t12, t14, t16, t17, t18, t19, t20, t22, t54, t77, t103, t114, t...863
Computing Next relation with stutter on 5.44614e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 02:04:23] [INFO ] Flatten gal took : 51 ms
[2024-05-25 02:04:23] [INFO ] Time to serialize gal into /tmp/LTLFireability7534324529478024741.gal : 16 ms
[2024-05-25 02:04:23] [INFO ] Time to serialize properties into /tmp/LTLFireability16834258216432786972.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/LTLFireability7534324529478024741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16834258216432786972.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 1 LTL properties
Checking formula 0 : !((F("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"

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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r202-smll-171649587400092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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