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.r004-smll-171620117700052.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 ASLink-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 544K 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 ASLink-PT-03b-LTLFireability-00
FORMULA_NAME ASLink-PT-03b-LTLFireability-01
FORMULA_NAME ASLink-PT-03b-LTLFireability-02
FORMULA_NAME ASLink-PT-03b-LTLFireability-03
FORMULA_NAME ASLink-PT-03b-LTLFireability-04
FORMULA_NAME ASLink-PT-03b-LTLFireability-05
FORMULA_NAME ASLink-PT-03b-LTLFireability-06
FORMULA_NAME ASLink-PT-03b-LTLFireability-07
FORMULA_NAME ASLink-PT-03b-LTLFireability-08
FORMULA_NAME ASLink-PT-03b-LTLFireability-09
FORMULA_NAME ASLink-PT-03b-LTLFireability-10
FORMULA_NAME ASLink-PT-03b-LTLFireability-11
FORMULA_NAME ASLink-PT-03b-LTLFireability-12
FORMULA_NAME ASLink-PT-03b-LTLFireability-13
FORMULA_NAME ASLink-PT-03b-LTLFireability-14
FORMULA_NAME ASLink-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716242452958

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 22:00:55] [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-20 22:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:00:56] [INFO ] Load time of PNML (sax parser for PT used): 572 ms
[2024-05-20 22:00:56] [INFO ] Transformed 1638 places.
[2024-05-20 22:00:56] [INFO ] Transformed 2094 transitions.
[2024-05-20 22:00:56] [INFO ] Found NUPN structural information;
[2024-05-20 22:00:56] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 874 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1638 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 1540 transition count 1996
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 1540 transition count 1996
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 197 place count 1540 transition count 1995
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 234 place count 1503 transition count 1940
Iterating global reduction 1 with 37 rules applied. Total rules applied 271 place count 1503 transition count 1940
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 283 place count 1503 transition count 1928
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 289 place count 1497 transition count 1922
Iterating global reduction 2 with 6 rules applied. Total rules applied 295 place count 1497 transition count 1922
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 299 place count 1493 transition count 1911
Iterating global reduction 2 with 4 rules applied. Total rules applied 303 place count 1493 transition count 1911
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 1491 transition count 1909
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 1491 transition count 1909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 309 place count 1489 transition count 1907
Iterating global reduction 2 with 2 rules applied. Total rules applied 311 place count 1489 transition count 1907
Applied a total of 311 rules in 1850 ms. Remains 1489 /1638 variables (removed 149) and now considering 1907/2094 (removed 187) transitions.
// Phase 1: matrix 1907 rows 1489 cols
[2024-05-20 22:00:58] [INFO ] Computed 160 invariants in 139 ms
[2024-05-20 22:01:00] [INFO ] Implicit Places using invariants in 2050 ms returned [1323, 1334, 1345, 1353, 1361, 1369, 1377, 1388, 1396, 1404, 1415]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2106 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1478/1638 places, 1907/2094 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1465 transition count 1894
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1465 transition count 1894
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1455 transition count 1884
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1455 transition count 1884
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1447 transition count 1876
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1447 transition count 1876
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1443 transition count 1872
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1443 transition count 1872
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1441 transition count 1870
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1441 transition count 1870
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1439 transition count 1868
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1439 transition count 1868
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1437 transition count 1866
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1437 transition count 1866
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1435 transition count 1864
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1435 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1434 transition count 1863
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1434 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1433 transition count 1862
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1433 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1432 transition count 1861
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1432 transition count 1861
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1431 transition count 1860
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1431 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1430 transition count 1859
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1430 transition count 1859
Applied a total of 96 rules in 1157 ms. Remains 1430 /1478 variables (removed 48) and now considering 1859/1907 (removed 48) transitions.
// Phase 1: matrix 1859 rows 1430 cols
[2024-05-20 22:01:02] [INFO ] Computed 149 invariants in 61 ms
[2024-05-20 22:01:03] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-20 22:01:03] [INFO ] Invariant cache hit.
[2024-05-20 22:01:09] [INFO ] Implicit Places using invariants and state equation in 6630 ms returned []
Implicit Place search using SMT with State Equation took 7694 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1430/1638 places, 1859/2094 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12838 ms. Remains : 1430/1638 places, 1859/2094 transitions.
Support contains 46 out of 1430 places after structural reductions.
[2024-05-20 22:01:10] [INFO ] Flatten gal took : 345 ms
[2024-05-20 22:01:10] [INFO ] Flatten gal took : 165 ms
[2024-05-20 22:01:11] [INFO ] Input system was already deterministic with 1859 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (111 resets) in 3461 ms. (11 steps per ms) remains 19/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
[2024-05-20 22:01:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 603/639 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 281/920 variables, 35/55 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 494/1414 variables, 93/148 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-20 22:01:14] [INFO ] Deduced a trap composed of 22 places in 753 ms of which 89 ms to minimize.
[2024-05-20 22:01:15] [INFO ] Deduced a trap composed of 49 places in 663 ms of which 17 ms to minimize.
[2024-05-20 22:01:15] [INFO ] Deduced a trap composed of 60 places in 377 ms of which 9 ms to minimize.
[2024-05-20 22:01:16] [INFO ] Deduced a trap composed of 88 places in 428 ms of which 8 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-20 22:01:17] [INFO ] Deduced a trap composed of 43 places in 481 ms of which 7 ms to minimize.
Problem AtomicPropp21 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1414/3289 variables, and 153 constraints, problems are : Problem set: 3 solved, 16 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 113/114 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 473/501 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 297/798 variables, 35/49 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-20 22:01:18] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 1/51 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 616/1414 variables, 99/150 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 4/154 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-20 22:01:20] [INFO ] Deduced a trap composed of 91 places in 367 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1414 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 16/1430 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/3289 variables, and 156 constraints, problems are : Problem set: 3 solved, 16 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 7/7 constraints]
After SMT, in 10138ms problems are : Problem set: 3 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 0 with 246 rules applied. Total rules applied 246 place count 1430 transition count 1613
Reduce places removed 246 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 249 rules applied. Total rules applied 495 place count 1184 transition count 1610
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 497 place count 1182 transition count 1610
Performed 377 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 377 Pre rules applied. Total rules applied 497 place count 1182 transition count 1233
Deduced a syphon composed of 377 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 1285 place count 771 transition count 1233
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1310 place count 768 transition count 1211
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1332 place count 746 transition count 1211
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1332 place count 746 transition count 1198
Deduced a syphon composed of 13 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1371 place count 720 transition count 1198
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1371 place count 720 transition count 1186
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1395 place count 708 transition count 1186
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1399 place count 704 transition count 1177
Iterating global reduction 5 with 4 rules applied. Total rules applied 1403 place count 704 transition count 1177
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1403 place count 704 transition count 1174
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1409 place count 701 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1411 place count 699 transition count 1165
Iterating global reduction 5 with 2 rules applied. Total rules applied 1413 place count 699 transition count 1165
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1414 place count 698 transition count 1157
Iterating global reduction 5 with 1 rules applied. Total rules applied 1415 place count 698 transition count 1157
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 1643 place count 583 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1647 place count 579 transition count 1040
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1652 place count 578 transition count 1040
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1653 place count 578 transition count 1039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1654 place count 577 transition count 1039
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1654 place count 577 transition count 1038
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1656 place count 576 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1658 place count 574 transition count 1036
Iterating global reduction 7 with 2 rules applied. Total rules applied 1660 place count 574 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1662 place count 574 transition count 1034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1663 place count 573 transition count 1034
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1665 place count 572 transition count 1039
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 1670 place count 572 transition count 1034
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1675 place count 567 transition count 1034
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1677 place count 567 transition count 1032
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1679 place count 565 transition count 1032
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1682 place count 565 transition count 1032
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1683 place count 564 transition count 1031
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 8 rules applied. Total rules applied 1691 place count 558 transition count 1029
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1693 place count 556 transition count 1029
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 9 Pre rules applied. Total rules applied 1693 place count 556 transition count 1020
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 19 rules applied. Total rules applied 1712 place count 546 transition count 1020
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 1716 place count 542 transition count 1020
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1716 place count 542 transition count 1019
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1718 place count 541 transition count 1019
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 1732 place count 534 transition count 1012
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1735 place count 531 transition count 1009
Iterating global reduction 14 with 3 rules applied. Total rules applied 1738 place count 531 transition count 1009
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1741 place count 531 transition count 1006
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1744 place count 528 transition count 1006
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1745 place count 528 transition count 1006
Applied a total of 1745 rules in 796 ms. Remains 528 /1430 variables (removed 902) and now considering 1006/1859 (removed 853) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 528/1430 places, 1006/1859 transitions.
RANDOM walk for 40000 steps (519 resets) in 749 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (14 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (13 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 214077 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 16
Probabilistic random walk after 214077 steps, saw 46082 distinct states, run finished after 3006 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1006 rows 528 cols
[2024-05-20 22:01:26] [INFO ] Computed 85 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 35/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 252/318 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 60/378 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/379 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 128/507 variables, 33/74 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-20 22:01:27] [INFO ] Deduced a trap composed of 45 places in 339 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 6/513 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 15/528 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1006/1534 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1534 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/1534 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1534/1534 variables, and 614 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4082 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 35/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 252/318 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 60/378 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-20 22:01:31] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:01:31] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-20 22:01:31] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:01:31] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:01:32] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/379 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 128/507 variables, 33/79 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 6/513 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 15/528 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 19 (OVERLAPS) 1006/1534 variables, 528/619 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1534 variables, 2/621 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1534 variables, 0/621 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1534 variables, 0/621 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1534/1534 variables, and 621 constraints, problems are : Problem set: 14 solved, 2 unsolved in 6859 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 2/16 constraints, Known Traps: 6/6 constraints]
After SMT, in 10998ms problems are : Problem set: 14 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19122 steps, including 1005 resets, run visited all 2 properties in 341 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 365 ms.
Successfully simplified 18 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-03b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 56 stabilizing places and 56 stable transitions
FORMULA ASLink-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))))'
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1426 transition count 1850
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1426 transition count 1850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1423 transition count 1840
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1423 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1422 transition count 1832
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1422 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1421 transition count 1831
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1421 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1420 transition count 1823
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1420 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1419 transition count 1815
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1419 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1418 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1418 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1417 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1417 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1416 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1416 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1415 transition count 1797
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1415 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1414 transition count 1789
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1414 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1413 transition count 1781
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1413 transition count 1781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1412 transition count 1780
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1412 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1411 transition count 1772
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1411 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1410 transition count 1764
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1410 transition count 1764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1409 transition count 1763
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1409 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1408 transition count 1755
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1408 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1407 transition count 1747
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1407 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1406 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1406 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1405 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1405 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1404 transition count 1730
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1404 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1403 transition count 1729
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1403 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1402 transition count 1721
Applied a total of 56 rules in 1659 ms. Remains 1402 /1430 variables (removed 28) and now considering 1721/1859 (removed 138) transitions.
// Phase 1: matrix 1721 rows 1402 cols
[2024-05-20 22:01:40] [INFO ] Computed 149 invariants in 18 ms
[2024-05-20 22:01:41] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2024-05-20 22:01:41] [INFO ] Invariant cache hit.
[2024-05-20 22:01:47] [INFO ] Implicit Places using invariants and state equation in 5959 ms returned []
Implicit Place search using SMT with State Equation took 7340 ms to find 0 implicit places.
Running 1720 sub problems to find dead transitions.
[2024-05-20 22:01:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 84/112 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 84/112 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1720 constraints, Known Traps: 0/0 constraints]
After SMT, in 61078ms problems are : Problem set: 0 solved, 1720 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Starting structural reductions in LTL mode, iteration 1 : 1402/1430 places, 1721/1859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70117 ms. Remains : 1402/1430 places, 1721/1859 transitions.
Stuttering acceptance computed with spot in 589 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-00 finished in 70831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 253 place count 1429 transition count 1605
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 509 place count 1176 transition count 1602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 511 place count 1174 transition count 1602
Performed 383 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 383 Pre rules applied. Total rules applied 511 place count 1174 transition count 1219
Deduced a syphon composed of 383 places in 4 ms
Ensure Unique test removed 34 places
Reduce places removed 417 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1311 place count 757 transition count 1219
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1336 place count 754 transition count 1197
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1358 place count 732 transition count 1197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1358 place count 732 transition count 1184
Deduced a syphon composed of 13 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1397 place count 706 transition count 1184
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1397 place count 706 transition count 1172
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1421 place count 694 transition count 1172
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1424 place count 691 transition count 1164
Iterating global reduction 5 with 3 rules applied. Total rules applied 1427 place count 691 transition count 1164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1427 place count 691 transition count 1162
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1431 place count 689 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1432 place count 688 transition count 1161
Iterating global reduction 5 with 1 rules applied. Total rules applied 1433 place count 688 transition count 1161
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 1661 place count 573 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1665 place count 569 transition count 1044
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1670 place count 568 transition count 1044
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1671 place count 568 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1672 place count 567 transition count 1043
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1672 place count 567 transition count 1042
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1674 place count 566 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1676 place count 564 transition count 1040
Iterating global reduction 7 with 2 rules applied. Total rules applied 1678 place count 564 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1680 place count 564 transition count 1038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1681 place count 563 transition count 1038
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1683 place count 562 transition count 1043
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1685 place count 560 transition count 1041
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 1691 place count 556 transition count 1039
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1693 place count 554 transition count 1039
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1693 place count 554 transition count 1033
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1706 place count 547 transition count 1033
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1711 place count 542 transition count 1033
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1711 place count 542 transition count 1032
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1713 place count 541 transition count 1032
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1727 place count 534 transition count 1025
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1731 place count 530 transition count 1021
Iterating global reduction 12 with 4 rules applied. Total rules applied 1735 place count 530 transition count 1021
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1737 place count 528 transition count 1019
Iterating global reduction 12 with 2 rules applied. Total rules applied 1739 place count 528 transition count 1019
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1741 place count 528 transition count 1017
Applied a total of 1741 rules in 633 ms. Remains 528 /1430 variables (removed 902) and now considering 1017/1859 (removed 842) transitions.
// Phase 1: matrix 1017 rows 528 cols
[2024-05-20 22:02:49] [INFO ] Computed 86 invariants in 29 ms
[2024-05-20 22:02:50] [INFO ] Implicit Places using invariants in 1202 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 273, 290, 308, 395, 406, 407, 410, 411, 445, 466, 467, 468, 469]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1204 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1430 places, 1017/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 497 transition count 960
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 440 transition count 960
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 114 place count 440 transition count 942
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 151 place count 421 transition count 942
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 16 rules applied. Total rules applied 167 place count 415 transition count 932
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 177 place count 405 transition count 932
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 181 place count 401 transition count 928
Iterating global reduction 4 with 4 rules applied. Total rules applied 185 place count 401 transition count 928
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 189 place count 401 transition count 924
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 243 place count 374 transition count 897
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 372 transition count 898
Applied a total of 247 rules in 96 ms. Remains 372 /497 variables (removed 125) and now considering 898/1017 (removed 119) transitions.
// Phase 1: matrix 898 rows 372 cols
[2024-05-20 22:02:51] [INFO ] Computed 48 invariants in 13 ms
[2024-05-20 22:02:51] [INFO ] Implicit Places using invariants in 632 ms returned [88, 94, 99, 174, 180, 185, 251, 287, 369]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 635 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 363/1430 places, 898/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 363 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 362 transition count 897
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 358 transition count 893
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 358 transition count 893
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 354 transition count 889
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 354 transition count 889
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 352 transition count 887
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 352 transition count 887
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 2 with 6 rules applied. Total rules applied 28 place count 349 transition count 884
Applied a total of 28 rules in 77 ms. Remains 349 /363 variables (removed 14) and now considering 884/898 (removed 14) transitions.
// Phase 1: matrix 884 rows 349 cols
[2024-05-20 22:02:51] [INFO ] Computed 39 invariants in 13 ms
[2024-05-20 22:02:52] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-20 22:02:52] [INFO ] Invariant cache hit.
[2024-05-20 22:02:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-20 22:02:54] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 349/1430 places, 884/1859 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4918 ms. Remains : 349/1430 places, 884/1859 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-02
Product exploration explored 100000 steps with 1701 reset in 703 ms.
Product exploration explored 100000 steps with 1675 reset in 452 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/349 stabilizing places and 2/884 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 723 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (657 resets) in 433 ms. (92 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1243 steps (2 resets) in 12 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 1185 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 884/884 transitions.
Applied a total of 0 rules in 22 ms. Remains 349 /349 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2024-05-20 22:02:57] [INFO ] Invariant cache hit.
[2024-05-20 22:02:58] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-20 22:02:58] [INFO ] Invariant cache hit.
[2024-05-20 22:02:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-20 22:03:00] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2328 ms to find 0 implicit places.
[2024-05-20 22:03:00] [INFO ] Redundant transitions in 92 ms returned []
Running 862 sub problems to find dead transitions.
[2024-05-20 22:03:00] [INFO ] Invariant cache hit.
[2024-05-20 22:03:00] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 2/347 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 862 unsolved
SMT process timed out in 30939ms, After SMT, problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 30955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33418 ms. Remains : 349/349 places, 884/884 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/349 stabilizing places and 2/884 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 829 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (690 resets) in 144 ms. (275 steps per ms) remains 1/6 properties
BEST_FIRST walk for 3240 steps (11 resets) in 25 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 1176 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1666 reset in 382 ms.
Product exploration explored 100000 steps with 1681 reset in 653 ms.
Built C files in :
/tmp/ltsmin4279127592610089461
[2024-05-20 22:03:34] [INFO ] Computing symmetric may disable matrix : 884 transitions.
[2024-05-20 22:03:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:03:34] [INFO ] Computing symmetric may enable matrix : 884 transitions.
[2024-05-20 22:03:34] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:03:35] [INFO ] Computing Do-Not-Accords matrix : 884 transitions.
[2024-05-20 22:03:35] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:03:35] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4279127592610089461
Running compilation step : cd /tmp/ltsmin4279127592610089461;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4279127592610089461;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4279127592610089461;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 884/884 transitions.
Applied a total of 0 rules in 20 ms. Remains 349 /349 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2024-05-20 22:03:38] [INFO ] Invariant cache hit.
[2024-05-20 22:03:38] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-20 22:03:38] [INFO ] Invariant cache hit.
[2024-05-20 22:03:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-20 22:03:40] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
[2024-05-20 22:03:40] [INFO ] Redundant transitions in 283 ms returned []
Running 862 sub problems to find dead transitions.
[2024-05-20 22:03:40] [INFO ] Invariant cache hit.
[2024-05-20 22:03:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 2/347 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-05-20 22:04:09] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/1233 variables, and 33 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/349 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 2/347 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-05-20 22:04:30] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s72 1)
(s73 4)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 6)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/1233 variables, and 34 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/349 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 2/2 constraints]
After SMT, in 60783ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63419 ms. Remains : 349/349 places, 884/884 transitions.
Built C files in :
/tmp/ltsmin17689353736629820574
[2024-05-20 22:04:41] [INFO ] Computing symmetric may disable matrix : 884 transitions.
[2024-05-20 22:04:41] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:04:41] [INFO ] Computing symmetric may enable matrix : 884 transitions.
[2024-05-20 22:04:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:04:41] [INFO ] Computing Do-Not-Accords matrix : 884 transitions.
[2024-05-20 22:04:41] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:04:41] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17689353736629820574
Running compilation step : cd /tmp/ltsmin17689353736629820574;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17689353736629820574;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17689353736629820574;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 22:04:45] [INFO ] Flatten gal took : 87 ms
[2024-05-20 22:04:45] [INFO ] Flatten gal took : 84 ms
[2024-05-20 22:04:45] [INFO ] Time to serialize gal into /tmp/LTL1381998874911422933.gal : 29 ms
[2024-05-20 22:04:45] [INFO ] Time to serialize properties into /tmp/LTL9104852865294725275.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1381998874911422933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17392297562018814690.hoa' '-atoms' '/tmp/LTL9104852865294725275.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9104852865294725275.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17392297562018814690.hoa
Detected timeout of ITS tools.
[2024-05-20 22:05:00] [INFO ] Flatten gal took : 70 ms
[2024-05-20 22:05:00] [INFO ] Flatten gal took : 66 ms
[2024-05-20 22:05:00] [INFO ] Time to serialize gal into /tmp/LTL5355407480334170620.gal : 19 ms
[2024-05-20 22:05:00] [INFO ] Time to serialize properties into /tmp/LTL13891079428168967845.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/LTL5355407480334170620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13891079428168967845.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(("(p1255!=1)")U((G("(p1255!=1)"))||(("(p1255!=1)")&&(G("(p1273!=1)")))))))
Formula 0 simplified : G(F!"(p1273!=1)" U !"(p1255!=1)")
Detected timeout of ITS tools.
[2024-05-20 22:05:15] [INFO ] Flatten gal took : 52 ms
[2024-05-20 22:05:15] [INFO ] Applying decomposition
[2024-05-20 22:05:15] [INFO ] Flatten gal took : 39 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/graph6910093055965890618.txt' '-o' '/tmp/graph6910093055965890618.bin' '-w' '/tmp/graph6910093055965890618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6910093055965890618.bin' '-l' '-1' '-v' '-w' '/tmp/graph6910093055965890618.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:05:15] [INFO ] Decomposing Gal with order
[2024-05-20 22:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:05:16] [INFO ] Removed a total of 1838 redundant transitions.
[2024-05-20 22:05:16] [INFO ] Flatten gal took : 160 ms
[2024-05-20 22:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 52 ms.
[2024-05-20 22:05:16] [INFO ] Time to serialize gal into /tmp/LTL4492325072058762457.gal : 17 ms
[2024-05-20 22:05:16] [INFO ] Time to serialize properties into /tmp/LTL3169488120453590417.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/LTL4492325072058762457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3169488120453590417.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(("(i6.u76.p1255!=1)")U((G("(i6.u76.p1255!=1)"))||(("(i6.u76.p1255!=1)")&&(G("(i5.u78.p1273!=1)")))))))
Formula 0 simplified : G(F!"(i5.u78.p1273!=1)" U !"(i6.u76.p1255!=1)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLFireability-02 finished in 162191 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 1430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 253 place count 1429 transition count 1605
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 509 place count 1176 transition count 1602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 511 place count 1174 transition count 1602
Performed 382 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 382 Pre rules applied. Total rules applied 511 place count 1174 transition count 1220
Deduced a syphon composed of 382 places in 3 ms
Ensure Unique test removed 33 places
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 797 rules applied. Total rules applied 1308 place count 759 transition count 1220
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 1333 place count 755 transition count 1199
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 22 rules applied. Total rules applied 1355 place count 734 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1356 place count 733 transition count 1198
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1356 place count 733 transition count 1185
Deduced a syphon composed of 13 places in 4 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1395 place count 707 transition count 1185
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1395 place count 707 transition count 1173
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1419 place count 695 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1422 place count 692 transition count 1165
Iterating global reduction 6 with 3 rules applied. Total rules applied 1425 place count 692 transition count 1165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1425 place count 692 transition count 1163
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1429 place count 690 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1430 place count 689 transition count 1155
Iterating global reduction 6 with 1 rules applied. Total rules applied 1431 place count 689 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1432 place count 688 transition count 1147
Iterating global reduction 6 with 1 rules applied. Total rules applied 1433 place count 688 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1434 place count 687 transition count 1139
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 687 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1436 place count 686 transition count 1131
Iterating global reduction 6 with 1 rules applied. Total rules applied 1437 place count 686 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1438 place count 685 transition count 1123
Iterating global reduction 6 with 1 rules applied. Total rules applied 1439 place count 685 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1440 place count 684 transition count 1115
Iterating global reduction 6 with 1 rules applied. Total rules applied 1441 place count 684 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1442 place count 683 transition count 1107
Iterating global reduction 6 with 1 rules applied. Total rules applied 1443 place count 683 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1444 place count 682 transition count 1099
Iterating global reduction 6 with 1 rules applied. Total rules applied 1445 place count 682 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1446 place count 681 transition count 1091
Iterating global reduction 6 with 1 rules applied. Total rules applied 1447 place count 681 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1448 place count 680 transition count 1083
Iterating global reduction 6 with 1 rules applied. Total rules applied 1449 place count 680 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1450 place count 679 transition count 1075
Iterating global reduction 6 with 1 rules applied. Total rules applied 1451 place count 679 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1452 place count 678 transition count 1067
Iterating global reduction 6 with 1 rules applied. Total rules applied 1453 place count 678 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1454 place count 677 transition count 1059
Iterating global reduction 6 with 1 rules applied. Total rules applied 1455 place count 677 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1456 place count 676 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 1457 place count 676 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1458 place count 675 transition count 1043
Iterating global reduction 6 with 1 rules applied. Total rules applied 1459 place count 675 transition count 1043
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 6 with 231 rules applied. Total rules applied 1690 place count 559 transition count 928
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1694 place count 555 transition count 924
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1699 place count 554 transition count 924
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1700 place count 554 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1701 place count 553 transition count 923
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1703 place count 551 transition count 921
Iterating global reduction 8 with 2 rules applied. Total rules applied 1705 place count 551 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1707 place count 551 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1708 place count 550 transition count 919
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1710 place count 549 transition count 924
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1712 place count 547 transition count 922
Reduce places removed 6 places and 0 transitions.
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 10 with 9 rules applied. Total rules applied 1721 place count 541 transition count 919
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1724 place count 538 transition count 919
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 9 Pre rules applied. Total rules applied 1724 place count 538 transition count 910
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 19 rules applied. Total rules applied 1743 place count 528 transition count 910
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 12 with 7 rules applied. Total rules applied 1750 place count 521 transition count 910
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1750 place count 521 transition count 909
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1752 place count 520 transition count 909
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 17 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1772 place count 510 transition count 899
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1778 place count 504 transition count 893
Iterating global reduction 13 with 6 rules applied. Total rules applied 1784 place count 504 transition count 893
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1787 place count 501 transition count 890
Iterating global reduction 13 with 3 rules applied. Total rules applied 1790 place count 501 transition count 890
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1793 place count 501 transition count 887
Applied a total of 1793 rules in 809 ms. Remains 501 /1430 variables (removed 929) and now considering 887/1859 (removed 972) transitions.
// Phase 1: matrix 887 rows 501 cols
[2024-05-20 22:05:32] [INFO ] Computed 83 invariants in 9 ms
[2024-05-20 22:05:32] [INFO ] Implicit Places using invariants in 586 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 382, 393, 395, 396, 414, 415, 436, 437, 438, 439]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 590 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/1430 places, 887/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 467 transition count 830
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 410 transition count 830
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 114 place count 410 transition count 811
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 153 place count 390 transition count 811
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 165 place count 386 transition count 803
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 173 place count 378 transition count 803
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 375 transition count 800
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 375 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 182 place count 375 transition count 797
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 236 place count 348 transition count 770
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 240 place count 346 transition count 771
Applied a total of 240 rules in 52 ms. Remains 346 /467 variables (removed 121) and now considering 771/887 (removed 116) transitions.
// Phase 1: matrix 771 rows 346 cols
[2024-05-20 22:05:32] [INFO ] Computed 44 invariants in 7 ms
[2024-05-20 22:05:33] [INFO ] Implicit Places using invariants in 402 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 343]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 405 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 336/1430 places, 771/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 336 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 335 transition count 770
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 329 transition count 764
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 329 transition count 764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 323 transition count 758
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 323 transition count 758
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 320 transition count 755
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 320 transition count 755
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 2 with 6 rules applied. Total rules applied 38 place count 317 transition count 752
Applied a total of 38 rules in 56 ms. Remains 317 /336 variables (removed 19) and now considering 752/771 (removed 19) transitions.
// Phase 1: matrix 752 rows 317 cols
[2024-05-20 22:05:33] [INFO ] Computed 34 invariants in 9 ms
[2024-05-20 22:05:33] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-20 22:05:33] [INFO ] Invariant cache hit.
[2024-05-20 22:05:35] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 317/1430 places, 752/1859 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3870 ms. Remains : 317/1430 places, 752/1859 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-03
Product exploration explored 100000 steps with 1872 reset in 576 ms.
Product exploration explored 100000 steps with 1902 reset in 350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
RANDOM walk for 40000 steps (739 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37860 steps (221 resets) in 137 ms. (274 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 752/752 transitions.
Applied a total of 0 rules in 15 ms. Remains 317 /317 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2024-05-20 22:05:36] [INFO ] Invariant cache hit.
[2024-05-20 22:05:37] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-20 22:05:37] [INFO ] Invariant cache hit.
[2024-05-20 22:05:38] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-20 22:05:38] [INFO ] Redundant transitions in 6 ms returned []
Running 725 sub problems to find dead transitions.
[2024-05-20 22:05:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:05:58] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 4 ms to minimize.
[2024-05-20 22:05:59] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:06:09] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/1069 variables, and 30 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/25 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:06:26] [INFO ] Deduced a trap composed of 93 places in 319 ms of which 3 ms to minimize.
[2024-05-20 22:06:27] [INFO ] Deduced a trap composed of 124 places in 254 ms of which 4 ms to minimize.
[2024-05-20 22:06:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:06:36] [INFO ] Deduced a trap composed of 86 places in 251 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/1069 variables, and 41 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/725 constraints, Known Traps: 7/7 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62475 ms. Remains : 317/317 places, 752/752 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 30629 steps (597 resets) in 67 ms. (450 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1908 reset in 197 ms.
Product exploration explored 100000 steps with 1870 reset in 220 ms.
Built C files in :
/tmp/ltsmin13441624779307042191
[2024-05-20 22:06:40] [INFO ] Computing symmetric may disable matrix : 752 transitions.
[2024-05-20 22:06:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:06:40] [INFO ] Computing symmetric may enable matrix : 752 transitions.
[2024-05-20 22:06:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:06:40] [INFO ] Computing Do-Not-Accords matrix : 752 transitions.
[2024-05-20 22:06:40] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:06:40] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13441624779307042191
Running compilation step : cd /tmp/ltsmin13441624779307042191;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13441624779307042191;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13441624779307042191;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 752/752 transitions.
Applied a total of 0 rules in 10 ms. Remains 317 /317 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2024-05-20 22:06:43] [INFO ] Invariant cache hit.
[2024-05-20 22:06:43] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-20 22:06:43] [INFO ] Invariant cache hit.
[2024-05-20 22:06:44] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
[2024-05-20 22:06:44] [INFO ] Redundant transitions in 6 ms returned []
Running 725 sub problems to find dead transitions.
[2024-05-20 22:06:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:07:00] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-20 22:07:01] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:07:11] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/1069 variables, and 30 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/25 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:07:31] [INFO ] Deduced a trap composed of 93 places in 257 ms of which 4 ms to minimize.
[2024-05-20 22:07:32] [INFO ] Deduced a trap composed of 124 places in 252 ms of which 3 ms to minimize.
[2024-05-20 22:07:35] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-20 22:07:41] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/1069 variables, and 41 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/725 constraints, Known Traps: 7/7 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61760 ms. Remains : 317/317 places, 752/752 transitions.
Built C files in :
/tmp/ltsmin12361568603705949417
[2024-05-20 22:07:45] [INFO ] Computing symmetric may disable matrix : 752 transitions.
[2024-05-20 22:07:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:07:45] [INFO ] Computing symmetric may enable matrix : 752 transitions.
[2024-05-20 22:07:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:07:45] [INFO ] Computing Do-Not-Accords matrix : 752 transitions.
[2024-05-20 22:07:45] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:07:45] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12361568603705949417
Running compilation step : cd /tmp/ltsmin12361568603705949417;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12361568603705949417;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12361568603705949417;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 22:07:48] [INFO ] Flatten gal took : 29 ms
[2024-05-20 22:07:48] [INFO ] Flatten gal took : 30 ms
[2024-05-20 22:07:48] [INFO ] Time to serialize gal into /tmp/LTL11494724821605110239.gal : 5 ms
[2024-05-20 22:07:48] [INFO ] Time to serialize properties into /tmp/LTL8742057046103034667.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11494724821605110239.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10643293840544861871.hoa' '-atoms' '/tmp/LTL8742057046103034667.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/LTL8742057046103034667.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10643293840544861871.hoa
Detected timeout of ITS tools.
[2024-05-20 22:08:03] [INFO ] Flatten gal took : 26 ms
[2024-05-20 22:08:03] [INFO ] Flatten gal took : 25 ms
[2024-05-20 22:08:03] [INFO ] Time to serialize gal into /tmp/LTL18020934343988251525.gal : 5 ms
[2024-05-20 22:08:03] [INFO ] Time to serialize properties into /tmp/LTL17820731054420769005.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/LTL18020934343988251525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17820731054420769005.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1512==0)||(p1258!=1))"))))
Formula 0 simplified : GF!"((p1512==0)||(p1258!=1))"
Detected timeout of ITS tools.
[2024-05-20 22:08:18] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:08:18] [INFO ] Applying decomposition
[2024-05-20 22:08:18] [INFO ] Flatten gal took : 24 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/graph15534744181319243548.txt' '-o' '/tmp/graph15534744181319243548.bin' '-w' '/tmp/graph15534744181319243548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15534744181319243548.bin' '-l' '-1' '-v' '-w' '/tmp/graph15534744181319243548.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:08:18] [INFO ] Decomposing Gal with order
[2024-05-20 22:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:08:18] [INFO ] Removed a total of 1477 redundant transitions.
[2024-05-20 22:08:18] [INFO ] Flatten gal took : 51 ms
[2024-05-20 22:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 19 ms.
[2024-05-20 22:08:18] [INFO ] Time to serialize gal into /tmp/LTL7857565324116346884.gal : 6 ms
[2024-05-20 22:08:18] [INFO ] Time to serialize properties into /tmp/LTL6086852856671532431.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/LTL7857565324116346884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6086852856671532431.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((u72.p1512==0)||(i6.u63.p1258!=1))"))))
Formula 0 simplified : GF!"((u72.p1512==0)||(i6.u63.p1258!=1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLFireability-03 finished in 182438 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(G(p0))||G(p1))))'
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1426 transition count 1850
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1426 transition count 1850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1423 transition count 1840
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1423 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1422 transition count 1832
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1422 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1421 transition count 1831
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1421 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1420 transition count 1823
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1420 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1419 transition count 1815
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1419 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1418 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1418 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1417 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1417 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1416 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1416 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1415 transition count 1797
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1415 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1414 transition count 1789
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1414 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1413 transition count 1781
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1413 transition count 1781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1412 transition count 1780
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1412 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1411 transition count 1772
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1411 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1410 transition count 1764
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1410 transition count 1764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1409 transition count 1763
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1409 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1408 transition count 1755
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1408 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1407 transition count 1747
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1407 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1406 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1406 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1405 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1405 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1404 transition count 1730
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1404 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1403 transition count 1729
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1403 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1402 transition count 1721
Applied a total of 56 rules in 1352 ms. Remains 1402 /1430 variables (removed 28) and now considering 1721/1859 (removed 138) transitions.
// Phase 1: matrix 1721 rows 1402 cols
[2024-05-20 22:08:35] [INFO ] Computed 149 invariants in 37 ms
[2024-05-20 22:08:36] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2024-05-20 22:08:36] [INFO ] Invariant cache hit.
[2024-05-20 22:08:42] [INFO ] Implicit Places using invariants and state equation in 6508 ms returned []
Implicit Place search using SMT with State Equation took 7666 ms to find 0 implicit places.
Running 1720 sub problems to find dead transitions.
[2024-05-20 22:08:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 84/113 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 84/113 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1720 constraints, Known Traps: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 1720 unsolved
Search for dead transitions found 0 dead transitions in 60728ms
Starting structural reductions in LTL mode, iteration 1 : 1402/1430 places, 1721/1859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69749 ms. Remains : 1402/1430 places, 1721/1859 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 304 reset in 253 ms.
Product exploration explored 100000 steps with 295 reset in 299 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 39866 steps (111 resets) in 144 ms. (274 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1721/1721 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1401 transition count 1469
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 505 place count 1150 transition count 1466
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 507 place count 1148 transition count 1466
Performed 379 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 379 Pre rules applied. Total rules applied 507 place count 1148 transition count 1087
Deduced a syphon composed of 379 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1299 place count 735 transition count 1087
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1324 place count 732 transition count 1065
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1346 place count 710 transition count 1065
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1346 place count 710 transition count 1052
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1385 place count 684 transition count 1052
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1385 place count 684 transition count 1040
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1409 place count 672 transition count 1040
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 1637 place count 557 transition count 927
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1641 place count 553 transition count 923
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1646 place count 552 transition count 923
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1647 place count 552 transition count 922
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1648 place count 551 transition count 922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1648 place count 551 transition count 921
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1650 place count 550 transition count 921
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1652 place count 548 transition count 919
Iterating global reduction 7 with 2 rules applied. Total rules applied 1654 place count 548 transition count 919
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1656 place count 548 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1657 place count 547 transition count 917
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1659 place count 546 transition count 922
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1661 place count 544 transition count 920
Reduce places removed 6 places and 0 transitions.
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 9 with 9 rules applied. Total rules applied 1670 place count 538 transition count 917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1673 place count 535 transition count 917
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 9 Pre rules applied. Total rules applied 1673 place count 535 transition count 908
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 19 rules applied. Total rules applied 1692 place count 525 transition count 908
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 1699 place count 518 transition count 908
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1699 place count 518 transition count 907
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1701 place count 517 transition count 907
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1721 place count 507 transition count 897
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1727 place count 501 transition count 891
Iterating global reduction 12 with 6 rules applied. Total rules applied 1733 place count 501 transition count 891
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1736 place count 498 transition count 888
Iterating global reduction 12 with 3 rules applied. Total rules applied 1739 place count 498 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1742 place count 498 transition count 885
Applied a total of 1742 rules in 250 ms. Remains 498 /1402 variables (removed 904) and now considering 885/1721 (removed 836) transitions.
// Phase 1: matrix 885 rows 498 cols
[2024-05-20 22:09:44] [INFO ] Computed 82 invariants in 8 ms
[2024-05-20 22:09:45] [INFO ] Implicit Places using invariants in 566 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 380, 381, 384, 395, 396, 397, 415, 436, 437, 438, 439]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 572 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/1402 places, 885/1721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 465 transition count 827
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 407 transition count 827
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 116 place count 407 transition count 808
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 155 place count 387 transition count 808
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 167 place count 383 transition count 800
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 375 transition count 800
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 178 place count 372 transition count 797
Iterating global reduction 4 with 3 rules applied. Total rules applied 181 place count 372 transition count 797
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 184 place count 372 transition count 794
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 238 place count 345 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 242 place count 343 transition count 768
Applied a total of 242 rules in 43 ms. Remains 343 /465 variables (removed 122) and now considering 768/885 (removed 117) transitions.
// Phase 1: matrix 768 rows 343 cols
[2024-05-20 22:09:45] [INFO ] Computed 44 invariants in 6 ms
[2024-05-20 22:09:46] [INFO ] Implicit Places using invariants in 560 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 275, 340]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 562 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 333/1402 places, 768/1721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 333 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 332 transition count 767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 326 transition count 761
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 326 transition count 761
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 321 transition count 756
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 321 transition count 756
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 318 transition count 753
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 318 transition count 753
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 2 with 6 rules applied. Total rules applied 36 place count 315 transition count 750
Applied a total of 36 rules in 35 ms. Remains 315 /333 variables (removed 18) and now considering 750/768 (removed 18) transitions.
// Phase 1: matrix 750 rows 315 cols
[2024-05-20 22:09:46] [INFO ] Computed 34 invariants in 5 ms
[2024-05-20 22:09:46] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-20 22:09:46] [INFO ] Invariant cache hit.
[2024-05-20 22:09:47] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 315/1402 places, 750/1721 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2691 ms. Remains : 315/1402 places, 750/1721 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 15154 steps (294 resets) in 35 ms. (420 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1881 reset in 182 ms.
Product exploration explored 100000 steps with 1881 reset in 200 ms.
Built C files in :
/tmp/ltsmin10399849891666412717
[2024-05-20 22:09:48] [INFO ] Computing symmetric may disable matrix : 750 transitions.
[2024-05-20 22:09:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:09:48] [INFO ] Computing symmetric may enable matrix : 750 transitions.
[2024-05-20 22:09:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:09:48] [INFO ] Computing Do-Not-Accords matrix : 750 transitions.
[2024-05-20 22:09:48] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:09:48] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10399849891666412717
Running compilation step : cd /tmp/ltsmin10399849891666412717;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10399849891666412717;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10399849891666412717;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 750/750 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-20 22:09:51] [INFO ] Invariant cache hit.
[2024-05-20 22:09:51] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-20 22:09:51] [INFO ] Invariant cache hit.
[2024-05-20 22:09:52] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2024-05-20 22:09:52] [INFO ] Redundant transitions in 6 ms returned []
Running 723 sub problems to find dead transitions.
[2024-05-20 22:09:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-20 22:10:12] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
SMT process timed out in 30490ms, After SMT, problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 30499ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31813 ms. Remains : 315/315 places, 750/750 transitions.
Built C files in :
/tmp/ltsmin9121719435492740318
[2024-05-20 22:10:23] [INFO ] Computing symmetric may disable matrix : 750 transitions.
[2024-05-20 22:10:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:10:23] [INFO ] Computing symmetric may enable matrix : 750 transitions.
[2024-05-20 22:10:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:10:23] [INFO ] Computing Do-Not-Accords matrix : 750 transitions.
[2024-05-20 22:10:23] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:10:23] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9121719435492740318
Running compilation step : cd /tmp/ltsmin9121719435492740318;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9121719435492740318;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9121719435492740318;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 22:10:26] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:10:26] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:10:26] [INFO ] Time to serialize gal into /tmp/LTL16204291460171755444.gal : 4 ms
[2024-05-20 22:10:26] [INFO ] Time to serialize properties into /tmp/LTL1693084455043719790.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16204291460171755444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1874321807412170265.hoa' '-atoms' '/tmp/LTL1693084455043719790.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1693084455043719790.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1874321807412170265.hoa
Detected timeout of ITS tools.
[2024-05-20 22:10:41] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:10:41] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:10:41] [INFO ] Time to serialize gal into /tmp/LTL11329185009301314673.gal : 8 ms
[2024-05-20 22:10:41] [INFO ] Time to serialize properties into /tmp/LTL12825977352011551084.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/LTL11329185009301314673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12825977352011551084.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...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p1144==0)")))||(G("(p1144==1)")))))
Formula 0 simplified : X(GF!"(p1144==0)" & F!"(p1144==1)")
Detected timeout of ITS tools.
[2024-05-20 22:10:56] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:10:56] [INFO ] Applying decomposition
[2024-05-20 22:10:56] [INFO ] Flatten gal took : 23 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/graph3676222210476562114.txt' '-o' '/tmp/graph3676222210476562114.bin' '-w' '/tmp/graph3676222210476562114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3676222210476562114.bin' '-l' '-1' '-v' '-w' '/tmp/graph3676222210476562114.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:10:56] [INFO ] Decomposing Gal with order
[2024-05-20 22:10:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:10:56] [INFO ] Removed a total of 1509 redundant transitions.
[2024-05-20 22:10:56] [INFO ] Flatten gal took : 65 ms
[2024-05-20 22:10:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 16 ms.
[2024-05-20 22:10:56] [INFO ] Time to serialize gal into /tmp/LTL2703216392376482224.gal : 7 ms
[2024-05-20 22:10:56] [INFO ] Time to serialize properties into /tmp/LTL15974561059662335459.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/LTL2703216392376482224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15974561059662335459.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 : !((X((F(G("(i5.u64.p1144==0)")))||(G("(i5.u64.p1144==1)")))))
Formula 0 simplified : X(GF!"(i5.u64.p1144==0)" & F!"(i5.u64.p1144==1)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLFireability-10 finished in 158081 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))||(X(p0)&&G(p1))))'
Support contains 3 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1425 transition count 1849
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1425 transition count 1849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1422 transition count 1839
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1422 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1421 transition count 1831
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1421 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1420 transition count 1830
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1420 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1419 transition count 1822
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1419 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1418 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1418 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1417 transition count 1813
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1417 transition count 1813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1416 transition count 1805
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1416 transition count 1805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1415 transition count 1797
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1415 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1414 transition count 1796
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1414 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1413 transition count 1788
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1413 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1412 transition count 1780
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1412 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1411 transition count 1779
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1411 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1410 transition count 1771
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1410 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1409 transition count 1763
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1409 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1408 transition count 1762
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1408 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1407 transition count 1754
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1407 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1406 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1406 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1405 transition count 1745
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1405 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1404 transition count 1737
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1404 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1403 transition count 1729
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1403 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1402 transition count 1728
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1402 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1401 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1401 transition count 1720
Applied a total of 58 rules in 1377 ms. Remains 1401 /1430 variables (removed 29) and now considering 1720/1859 (removed 139) transitions.
// Phase 1: matrix 1720 rows 1401 cols
[2024-05-20 22:11:13] [INFO ] Computed 149 invariants in 17 ms
[2024-05-20 22:11:14] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-20 22:11:14] [INFO ] Invariant cache hit.
[2024-05-20 22:11:21] [INFO ] Implicit Places using invariants and state equation in 7275 ms returned []
Implicit Place search using SMT with State Equation took 8328 ms to find 0 implicit places.
Running 1719 sub problems to find dead transitions.
[2024-05-20 22:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1400 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1400/3121 variables, and 84 constraints, problems are : Problem set: 0 solved, 1719 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 84/111 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 1719/1719 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1400 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 13)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 3)
(s47 6)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 14)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 1)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 16)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 10)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 7)
(s346 1)
(s347 1)
(s348 0)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 4)
(s360 1)
(s361 0)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 9)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 9)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 6)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 4)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 28)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 0)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 1)
(s465 1)
(s466 0)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 0)
(s475 1)
(s476 1)
(s477 0)
(s478 0)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 5)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 1)
(s616 1)
(s617 0)
(s618 0)
(s619 0)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 0)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 0)
(s639 1)
(s640 1)
(s641 1)
(s642 0)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 1)
(s666 0)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 0)
(s677 1)
(s678 0)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 0)
(s687 1)
(s688 1)
(s689 1)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 0)
(s697 1)
(s698 1)
(s699 0)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 0)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 0)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 4)
(s719 1)
(s720 1)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 23)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 5)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 5)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 2)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 4)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 93)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 0)
(s812 0)
(s813 1)
(s814 1)
(s815 0)
(s816 1)
(s817 1)
(s818 1)
(s819 0)
(s820 0)
(s821 0)
(s822 1)
(s823 0)
(s824 1)
(s825 0)
(s826 1)
(s827 0)
(s828 0)
(s829 0)
(s830 1)
(s831 1)
(s832 0)
(s833 0)
(s834 1)
(s835 0)
(s836 0)
(s837 0)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/3121 variables, and 84 constraints, problems are : Problem set: 0 solved, 1719 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 84/111 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 0/1719 constraints, Known Traps: 0/0 constraints]
After SMT, in 60676ms problems are : Problem set: 0 solved, 1719 unsolved
Search for dead transitions found 0 dead transitions in 60694ms
Starting structural reductions in LTL mode, iteration 1 : 1401/1430 places, 1720/1859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70404 ms. Remains : 1401/1430 places, 1720/1859 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-15
Product exploration explored 100000 steps with 287 reset in 255 ms.
Product exploration explored 100000 steps with 288 reset in 293 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 120 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (117 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37291 steps (15 resets) in 44 ms. (828 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-03b-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03b-LTLFireability-15 finished in 71633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : ASLink-PT-03b-LTLFireability-10
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1430/1430 places, 1859/1859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1429 transition count 1607
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 505 place count 1178 transition count 1604
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 507 place count 1176 transition count 1604
Performed 384 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 384 Pre rules applied. Total rules applied 507 place count 1176 transition count 1220
Deduced a syphon composed of 384 places in 3 ms
Ensure Unique test removed 34 places
Reduce places removed 418 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 1309 place count 758 transition count 1220
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1334 place count 755 transition count 1198
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1356 place count 733 transition count 1198
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1356 place count 733 transition count 1185
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1395 place count 707 transition count 1185
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1395 place count 707 transition count 1173
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1419 place count 695 transition count 1173
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1423 place count 691 transition count 1164
Iterating global reduction 5 with 4 rules applied. Total rules applied 1427 place count 691 transition count 1164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1427 place count 691 transition count 1161
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1433 place count 688 transition count 1161
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1435 place count 686 transition count 1152
Iterating global reduction 5 with 2 rules applied. Total rules applied 1437 place count 686 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1438 place count 685 transition count 1144
Iterating global reduction 5 with 1 rules applied. Total rules applied 1439 place count 685 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1440 place count 684 transition count 1136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1441 place count 684 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1442 place count 683 transition count 1128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1443 place count 683 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1444 place count 682 transition count 1120
Iterating global reduction 5 with 1 rules applied. Total rules applied 1445 place count 682 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1446 place count 681 transition count 1112
Iterating global reduction 5 with 1 rules applied. Total rules applied 1447 place count 681 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1448 place count 680 transition count 1104
Iterating global reduction 5 with 1 rules applied. Total rules applied 1449 place count 680 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1450 place count 679 transition count 1096
Iterating global reduction 5 with 1 rules applied. Total rules applied 1451 place count 679 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1452 place count 678 transition count 1088
Iterating global reduction 5 with 1 rules applied. Total rules applied 1453 place count 678 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1454 place count 677 transition count 1080
Iterating global reduction 5 with 1 rules applied. Total rules applied 1455 place count 677 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1456 place count 676 transition count 1072
Iterating global reduction 5 with 1 rules applied. Total rules applied 1457 place count 676 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1458 place count 675 transition count 1064
Iterating global reduction 5 with 1 rules applied. Total rules applied 1459 place count 675 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1460 place count 674 transition count 1056
Iterating global reduction 5 with 1 rules applied. Total rules applied 1461 place count 674 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 673 transition count 1048
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 673 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1464 place count 672 transition count 1040
Iterating global reduction 5 with 1 rules applied. Total rules applied 1465 place count 672 transition count 1040
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 1693 place count 557 transition count 927
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1697 place count 553 transition count 923
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1702 place count 552 transition count 923
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1703 place count 552 transition count 922
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1704 place count 551 transition count 922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1704 place count 551 transition count 921
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1706 place count 550 transition count 921
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1708 place count 548 transition count 919
Iterating global reduction 7 with 2 rules applied. Total rules applied 1710 place count 548 transition count 919
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1712 place count 548 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1713 place count 547 transition count 917
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1715 place count 546 transition count 922
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1717 place count 544 transition count 920
Reduce places removed 6 places and 0 transitions.
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 9 with 9 rules applied. Total rules applied 1726 place count 538 transition count 917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1729 place count 535 transition count 917
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 9 Pre rules applied. Total rules applied 1729 place count 535 transition count 908
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 19 rules applied. Total rules applied 1748 place count 525 transition count 908
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 1755 place count 518 transition count 908
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1755 place count 518 transition count 907
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1757 place count 517 transition count 907
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1777 place count 507 transition count 897
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1783 place count 501 transition count 891
Iterating global reduction 12 with 6 rules applied. Total rules applied 1789 place count 501 transition count 891
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1792 place count 498 transition count 888
Iterating global reduction 12 with 3 rules applied. Total rules applied 1795 place count 498 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1798 place count 498 transition count 885
Applied a total of 1798 rules in 541 ms. Remains 498 /1430 variables (removed 932) and now considering 885/1859 (removed 974) transitions.
// Phase 1: matrix 885 rows 498 cols
[2024-05-20 22:12:24] [INFO ] Computed 82 invariants in 9 ms
[2024-05-20 22:12:25] [INFO ] Implicit Places using invariants in 773 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 380, 381, 384, 395, 396, 397, 415, 436, 437, 438, 439]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 775 ms to find 33 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 465/1430 places, 885/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 465 transition count 827
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 407 transition count 827
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 116 place count 407 transition count 808
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 155 place count 387 transition count 808
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 167 place count 383 transition count 800
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 375 transition count 800
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 178 place count 372 transition count 797
Iterating global reduction 4 with 3 rules applied. Total rules applied 181 place count 372 transition count 797
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 184 place count 372 transition count 794
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 238 place count 345 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 242 place count 343 transition count 768
Applied a total of 242 rules in 63 ms. Remains 343 /465 variables (removed 122) and now considering 768/885 (removed 117) transitions.
// Phase 1: matrix 768 rows 343 cols
[2024-05-20 22:12:25] [INFO ] Computed 44 invariants in 6 ms
[2024-05-20 22:12:26] [INFO ] Implicit Places using invariants in 480 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 275, 340]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 483 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 333/1430 places, 768/1859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 333 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 332 transition count 767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 326 transition count 761
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 326 transition count 761
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 321 transition count 756
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 321 transition count 756
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 318 transition count 753
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 318 transition count 753
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 315 transition count 750
Applied a total of 36 rules in 35 ms. Remains 315 /333 variables (removed 18) and now considering 750/768 (removed 18) transitions.
// Phase 1: matrix 750 rows 315 cols
[2024-05-20 22:12:26] [INFO ] Computed 34 invariants in 6 ms
[2024-05-20 22:12:26] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-20 22:12:26] [INFO ] Invariant cache hit.
[2024-05-20 22:12:27] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 315/1430 places, 750/1859 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3254 ms. Remains : 315/1430 places, 750/1859 transitions.
Running random walk in product with property : ASLink-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 1969 reset in 180 ms.
Product exploration explored 100000 steps with 1957 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 16044 steps (289 resets) in 41 ms. (382 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 750/750 transitions.
Applied a total of 0 rules in 8 ms. Remains 315 /315 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-20 22:12:28] [INFO ] Invariant cache hit.
[2024-05-20 22:12:28] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-20 22:12:28] [INFO ] Invariant cache hit.
[2024-05-20 22:12:29] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-20 22:12:29] [INFO ] Redundant transitions in 7 ms returned []
Running 723 sub problems to find dead transitions.
[2024-05-20 22:12:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-20 22:12:49] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
SMT process timed out in 30412ms, After SMT, problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 30419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31728 ms. Remains : 315/315 places, 750/750 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 21852 steps (473 resets) in 59 ms. (364 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1957 reset in 181 ms.
Product exploration explored 100000 steps with 1923 reset in 196 ms.
Built C files in :
/tmp/ltsmin1707775999685409043
[2024-05-20 22:13:00] [INFO ] Computing symmetric may disable matrix : 750 transitions.
[2024-05-20 22:13:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:00] [INFO ] Computing symmetric may enable matrix : 750 transitions.
[2024-05-20 22:13:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:00] [INFO ] Computing Do-Not-Accords matrix : 750 transitions.
[2024-05-20 22:13:00] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:00] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1707775999685409043
Running compilation step : cd /tmp/ltsmin1707775999685409043;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1707775999685409043;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1707775999685409043;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 750/750 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-20 22:13:03] [INFO ] Invariant cache hit.
[2024-05-20 22:13:04] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-20 22:13:04] [INFO ] Invariant cache hit.
[2024-05-20 22:13:05] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2024-05-20 22:13:05] [INFO ] Redundant transitions in 6 ms returned []
Running 723 sub problems to find dead transitions.
[2024-05-20 22:13:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-20 22:13:25] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 723 unsolved
SMT process timed out in 30408ms, After SMT, problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 30416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31714 ms. Remains : 315/315 places, 750/750 transitions.
Built C files in :
/tmp/ltsmin8489324963155881876
[2024-05-20 22:13:35] [INFO ] Computing symmetric may disable matrix : 750 transitions.
[2024-05-20 22:13:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:35] [INFO ] Computing symmetric may enable matrix : 750 transitions.
[2024-05-20 22:13:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:35] [INFO ] Computing Do-Not-Accords matrix : 750 transitions.
[2024-05-20 22:13:35] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:13:35] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8489324963155881876
Running compilation step : cd /tmp/ltsmin8489324963155881876;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8489324963155881876;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8489324963155881876;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 22:13:38] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:13:38] [INFO ] Flatten gal took : 22 ms
[2024-05-20 22:13:38] [INFO ] Time to serialize gal into /tmp/LTL15782767871667046323.gal : 5 ms
[2024-05-20 22:13:38] [INFO ] Time to serialize properties into /tmp/LTL8827760666653742178.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15782767871667046323.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9077683775379883109.hoa' '-atoms' '/tmp/LTL8827760666653742178.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8827760666653742178.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9077683775379883109.hoa
Detected timeout of ITS tools.
[2024-05-20 22:13:53] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:13:53] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:13:53] [INFO ] Time to serialize gal into /tmp/LTL7072110114428609626.gal : 4 ms
[2024-05-20 22:13:53] [INFO ] Time to serialize properties into /tmp/LTL16981099942161554266.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/LTL7072110114428609626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16981099942161554266.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 : !((X((F(G("(p1144==0)")))||(G("(p1144==1)")))))
Formula 0 simplified : X(GF!"(p1144==0)" & F!"(p1144==1)")
Detected timeout of ITS tools.
[2024-05-20 22:14:09] [INFO ] Flatten gal took : 27 ms
[2024-05-20 22:14:09] [INFO ] Applying decomposition
[2024-05-20 22:14:09] [INFO ] Flatten gal took : 23 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/graph17226950398212577155.txt' '-o' '/tmp/graph17226950398212577155.bin' '-w' '/tmp/graph17226950398212577155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17226950398212577155.bin' '-l' '-1' '-v' '-w' '/tmp/graph17226950398212577155.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:14:09] [INFO ] Decomposing Gal with order
[2024-05-20 22:14:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:14:09] [INFO ] Removed a total of 1501 redundant transitions.
[2024-05-20 22:14:09] [INFO ] Flatten gal took : 47 ms
[2024-05-20 22:14:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 13 ms.
[2024-05-20 22:14:09] [INFO ] Time to serialize gal into /tmp/LTL16177764967948240715.gal : 5 ms
[2024-05-20 22:14:09] [INFO ] Time to serialize properties into /tmp/LTL17218745617291615475.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/LTL16177764967948240715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17218745617291615475.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 : !((X((F(G("(i6.u64.p1144==0)")))||(G("(i6.u64.p1144==1)")))))
Formula 0 simplified : X(GF!"(i6.u64.p1144==0)" & F!"(i6.u64.p1144==1)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLFireability-10 finished in 120363 ms.
[2024-05-20 22:14:24] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9829594845338321756
[2024-05-20 22:14:24] [INFO ] Too many transitions (1859) to apply POR reductions. Disabling POR matrices.
[2024-05-20 22:14:24] [INFO ] Applying decomposition
[2024-05-20 22:14:24] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9829594845338321756
Running compilation step : cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 22:14:24] [INFO ] Flatten gal took : 49 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/graph1396347722976638403.txt' '-o' '/tmp/graph1396347722976638403.bin' '-w' '/tmp/graph1396347722976638403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1396347722976638403.bin' '-l' '-1' '-v' '-w' '/tmp/graph1396347722976638403.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:14:24] [INFO ] Decomposing Gal with order
[2024-05-20 22:14:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:14:24] [INFO ] Removed a total of 1552 redundant transitions.
[2024-05-20 22:14:24] [INFO ] Flatten gal took : 128 ms
[2024-05-20 22:14:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 26 ms.
[2024-05-20 22:14:24] [INFO ] Time to serialize gal into /tmp/LTLFireability8490479583325593386.gal : 17 ms
[2024-05-20 22:14:24] [INFO ] Time to serialize properties into /tmp/LTLFireability10421707428429240276.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/LTLFireability8490479583325593386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10421707428429240276.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 3 LTL properties
Checking formula 0 : !((F(("(i21.i2.i3.u437.p1255!=1)")U((G("(i21.i2.i3.u437.p1255!=1)"))||(("(i21.i2.i3.u437.p1255!=1)")&&(G("(i22.u443.p1273!=1)")))))))
Formula 0 simplified : G(F!"(i22.u443.p1273!=1)" U !"(i21.i2.i3.u437.p1255!=1)")
Compilation finished in 8249 ms.
Running link step : cd /tmp/ltsmin9829594845338321756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp3==true)))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp3==true)))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9829594845338321756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 22:38:54] [INFO ] Applying decomposition
[2024-05-20 22:38:54] [INFO ] Flatten gal took : 156 ms
[2024-05-20 22:38:54] [INFO ] Decomposing Gal with order
[2024-05-20 22:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:38:55] [INFO ] Removed a total of 1433 redundant transitions.
[2024-05-20 22:38:55] [INFO ] Flatten gal took : 333 ms
[2024-05-20 22:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1910 labels/synchronizations in 170 ms.
[2024-05-20 22:38:55] [INFO ] Time to serialize gal into /tmp/LTLFireability3502048710922536645.gal : 28 ms
[2024-05-20 22:38:55] [INFO ] Time to serialize properties into /tmp/LTLFireability15358094811330981105.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/LTLFireability3502048710922536645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15358094811330981105.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 3 LTL properties
Checking formula 0 : !((F(("(i0.i1.u149.p1255!=1)")U((G("(i0.i1.u149.p1255!=1)"))||(("(i0.i1.u149.p1255!=1)")&&(G("(i1.i0.i0.i0.u154.p1273!=1)")))))))
Formula 0 simplified : G(F!"(i1.i0.i0.i0.u154.p1273!=1)" U !"(i0.i1.u149.p1255!=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="ASLink-PT-03b"
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 ASLink-PT-03b, 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 r004-smll-171620117700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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