About the Execution of ITS-Tools for CloudDeployment-PT-5b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFFFTFT?FFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CloudDeployment-PT-5b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748558275884
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 22:37:57] [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]
[2025-05-29 22:37:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:37:57] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-05-29 22:37:57] [INFO ] Transformed 1525 places.
[2025-05-29 22:37:57] [INFO ] Transformed 3132 transitions.
[2025-05-29 22:37:57] [INFO ] Found NUPN structural information;
[2025-05-29 22:37:57] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 397 places :
Symmetric choice reduction at 1 with 397 rule applications. Total rules 402 place count 1123 transition count 2735
Iterating global reduction 1 with 397 rules applied. Total rules applied 799 place count 1123 transition count 2735
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 955 place count 967 transition count 2579
Iterating global reduction 1 with 156 rules applied. Total rules applied 1111 place count 967 transition count 2579
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 1131 place count 967 transition count 2559
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1148 place count 950 transition count 2542
Iterating global reduction 2 with 17 rules applied. Total rules applied 1165 place count 950 transition count 2542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1166 place count 949 transition count 2541
Iterating global reduction 2 with 1 rules applied. Total rules applied 1167 place count 949 transition count 2541
Applied a total of 1167 rules in 453 ms. Remains 949 /1525 variables (removed 576) and now considering 2541/3132 (removed 591) transitions.
// Phase 1: matrix 2541 rows 949 cols
[2025-05-29 22:37:58] [INFO ] Computed 16 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:58] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-05-29 22:37:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:59] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
Running 2540 sub problems to find dead transitions.
[2025-05-29 22:37:59] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/948 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/3490 variables, and 16 constraints, problems are : Problem set: 0 solved, 2540 unsolved in 30229 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 2540/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2540 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 948/3490 variables, and 16 constraints, problems are : Problem set: 0 solved, 2540 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 1325/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63986ms problems are : Problem set: 0 solved, 2540 unsolved
Search for dead transitions found 0 dead transitions in 64026ms
Starting structural reductions in LTL mode, iteration 1 : 949/1525 places, 2541/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66346 ms. Remains : 949/1525 places, 2541/3132 transitions.
Support contains 49 out of 949 places after structural reductions.
[2025-05-29 22:39:04] [INFO ] Flatten gal took : 405 ms
[2025-05-29 22:39:04] [INFO ] Flatten gal took : 275 ms
[2025-05-29 22:39:05] [INFO ] Input system was already deterministic with 2541 transitions.
RANDOM walk for 40000 steps (258 resets) in 1356 ms. (29 steps per ms) remains 23/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
[2025-05-29 22:39:05] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 187/228 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1734/1962 variables, 228/244 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1962 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 6 (OVERLAPS) 503/2465 variables, 212/456 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2465 variables, 0/456 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 447/2912 variables, 199/655 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 0/655 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 394/3306 variables, 185/840 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3306 variables, 0/840 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 148/3454 variables, 102/942 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3454 variables, 0/942 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 31/3485 variables, 18/960 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3485 variables, 0/960 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 5/3490 variables, 5/965 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3490 variables, 0/965 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/3490 variables, 0/965 constraints. Problems are: Problem set: 10 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3490/3490 variables, and 965 constraints, problems are : Problem set: 10 solved, 13 unsolved in 4640 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 949/949 constraints, PredecessorRefiner: 23/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 189/228 variables, 15/16 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1734/1962 variables, 228/244 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1962 variables, 1/245 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1962 variables, 0/245 constraints. Problems are: Problem set: 10 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (OVERLAPS) 503/2465 variables, 212/457 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2465 variables, 8/465 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2465 variables, 0/465 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 447/2912 variables, 199/664 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2912 variables, 0/664 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 394/3306 variables, 185/849 constraints. Problems are: Problem set: 13 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(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)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 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)
(s83 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s100 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s117 0)
(s118 0)
(s119 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s138 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 5)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s261 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s278 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s295 0)
(s296 0)
(s297 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s316 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s436 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s453 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s491 0)
(s492 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s504 0)
(s505 0)
(s506 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 1)
(s568 0)
(s569 1)
(s570 0)
(s572 0)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 1)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s615 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s632 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s649 0)
(s650 0)
(s651 0)
(s655 0)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s670 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 1)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s791 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s808 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s825 0)
(s826 0)
(s827 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3306/3490 variables, and 849 constraints, problems are : Problem set: 13 solved, 10 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 824/949 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9723ms problems are : Problem set: 13 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Graph (trivial) has 952 edges and 949 vertex of which 319 / 949 are part of one of the 35 SCC in 5 ms
Free SCC test removed 284 places
Drop transitions (Empty/Sink Transition effects.) removed 1387 transitions
Reduce isomorphic transitions removed 1387 transitions.
Graph (complete) has 2450 edges and 665 vertex of which 637 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 280 rules applied. Total rules applied 282 place count 637 transition count 874
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 269 rules applied. Total rules applied 551 place count 374 transition count 868
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 555 place count 370 transition count 868
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 555 place count 370 transition count 812
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 667 place count 314 transition count 812
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 672 place count 309 transition count 807
Iterating global reduction 3 with 5 rules applied. Total rules applied 677 place count 309 transition count 807
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 677 place count 309 transition count 802
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 687 place count 304 transition count 802
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 861 place count 217 transition count 715
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 931 place count 182 transition count 929
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 960 place count 182 transition count 900
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 4 with 104 rules applied. Total rules applied 1064 place count 182 transition count 796
Free-agglomeration rule applied 46 times with reduction of 10 identical transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1110 place count 182 transition count 740
Reduce places removed 46 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 4 with 134 rules applied. Total rules applied 1244 place count 136 transition count 652
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1247 place count 133 transition count 633
Iterating global reduction 5 with 3 rules applied. Total rules applied 1250 place count 133 transition count 633
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 5 with 64 rules applied. Total rules applied 1314 place count 133 transition count 569
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1315 place count 133 transition count 569
Applied a total of 1315 rules in 252 ms. Remains 133 /949 variables (removed 816) and now considering 569/2541 (removed 1972) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 133/949 places, 569/2541 transitions.
RANDOM walk for 40000 steps (522 resets) in 1316 ms. (30 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (58 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
[2025-05-29 22:39:16] [INFO ] Flow matrix only has 344 transitions (discarded 225 similar events)
// Phase 1: matrix 344 rows 133 cols
[2025-05-29 22:39:16] [INFO ] Computed 17 invariants in 2 ms
[2025-05-29 22:39:16] [INFO ] State equation strengthened by 195 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/122 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 329/451 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 159/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 26/477 variables, 11/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 36/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/477 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 133/133 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/122 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 329/451 variables, 122/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 159/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 26/477 variables, 11/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 36/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/477 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 349 constraints, problems are : Problem set: 0 solved, 3 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 133/133 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 345 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=172 )
Parikh walk visited 3 properties in 100 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 148 stabilizing places and 1500 stable transitions
Graph (complete) has 2914 edges and 949 vertex of which 921 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.28 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 948 transition count 2541
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 931 transition count 1511
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 930 transition count 1510
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 930 transition count 1510
Applied a total of 37 rules in 510 ms. Remains 930 /949 variables (removed 19) and now considering 1510/2541 (removed 1031) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2025-05-29 22:39:18] [INFO ] Computed 15 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:18] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-29 22:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:20] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
[2025-05-29 22:39:20] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/949 places, 1510/2541 transitions.
Applied a total of 0 rules in 23 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1877 ms. Remains : 929/949 places, 1510/2541 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-02
Stuttering criterion allowed to conclude after 130 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-02 finished in 2163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Graph (trivial) has 978 edges and 949 vertex of which 355 / 949 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2489 edges and 634 vertex of which 606 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 605 transition count 903
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 506 place count 353 transition count 903
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 506 place count 353 transition count 853
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 606 place count 303 transition count 853
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 607 place count 302 transition count 852
Iterating global reduction 2 with 1 rules applied. Total rules applied 608 place count 302 transition count 852
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 802 place count 205 transition count 755
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 852 place count 180 transition count 830
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 892 place count 180 transition count 790
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 902 place count 175 transition count 875
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 982 place count 175 transition count 795
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 983 place count 174 transition count 794
Applied a total of 983 rules in 225 ms. Remains 174 /949 variables (removed 775) and now considering 794/2541 (removed 1747) transitions.
[2025-05-29 22:39:20] [INFO ] Flow matrix only has 610 transitions (discarded 184 similar events)
// Phase 1: matrix 610 rows 174 cols
[2025-05-29 22:39:20] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:20] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 22:39:20] [INFO ] Flow matrix only has 610 transitions (discarded 184 similar events)
[2025-05-29 22:39:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 22:39:20] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:39:21] [INFO ] Redundant transitions in 492 ms returned []
Running 753 sub problems to find dead transitions.
[2025-05-29 22:39:21] [INFO ] Flow matrix only has 610 transitions (discarded 184 similar events)
[2025-05-29 22:39:21] [INFO ] Invariant cache hit.
[2025-05-29 22:39:21] [INFO ] State equation strengthened by 30 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (OVERLAPS) 609/778 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/778 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 5 (OVERLAPS) 5/783 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 753 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/784 variables, and 209 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 753/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 753 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (OVERLAPS) 609/778 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/778 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 26/230 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 6 (OVERLAPS) 5/783 variables, 5/235 constraints. Problems are: Problem set: 0 solved, 753 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/784 variables, and 636 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30100 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 753/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61025ms problems are : Problem set: 0 solved, 753 unsolved
Search for dead transitions found 0 dead transitions in 61028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/949 places, 794/2541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62180 ms. Remains : 174/949 places, 794/2541 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04
Product exploration explored 100000 steps with 3062 reset in 525 ms.
Product exploration explored 100000 steps with 3061 reset in 371 ms.
Computed a total of 54 stabilizing places and 509 stable transitions
Computed a total of 54 stabilizing places and 509 stable transitions
Detected a total of 54/174 stabilizing places and 509/794 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1308 resets) in 439 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1041706 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1041706 steps, saw 131069 distinct states, run finished after 3007 ms. (steps per millisecond=346 ) properties seen :0
[2025-05-29 22:40:26] [INFO ] Flow matrix only has 610 transitions (discarded 184 similar events)
[2025-05-29 22:40:26] [INFO ] Invariant cache hit.
[2025-05-29 22:40:26] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/311 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/335 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 404/739 variables, 128/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/739 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/739 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/783 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/783 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/783 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/784 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 291/311 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/335 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 404/739 variables, 128/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/739 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/783 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/783 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/783 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 783/784 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 794/794 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 734
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 814
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 804
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 719
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 649
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 877 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 191 rules applied. Total rules applied 416 place count 113 transition count 509
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 113 transition count 508
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 421 place count 109 transition count 484
Iterating global reduction 4 with 4 rules applied. Total rules applied 425 place count 109 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 500 place count 109 transition count 409
Applied a total of 500 rules in 56 ms. Remains 109 /174 variables (removed 65) and now considering 409/794 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 109/174 places, 409/794 transitions.
RANDOM walk for 2137 steps (42 resets) in 10 ms. (194 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 67078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Graph (trivial) has 976 edges and 949 vertex of which 346 / 949 are part of one of the 39 SCC in 2 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2505 edges and 642 vertex of which 614 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 613 transition count 909
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 257 rules applied. Total rules applied 514 place count 358 transition count 907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 515 place count 357 transition count 907
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 515 place count 357 transition count 856
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 617 place count 306 transition count 856
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 618 place count 305 transition count 855
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 305 transition count 855
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 819 place count 205 transition count 755
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 869 place count 180 transition count 830
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 909 place count 180 transition count 790
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 919 place count 175 transition count 875
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 984 place count 175 transition count 810
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 985 place count 174 transition count 809
Applied a total of 985 rules in 114 ms. Remains 174 /949 variables (removed 775) and now considering 809/2541 (removed 1732) transitions.
[2025-05-29 22:40:27] [INFO ] Flow matrix only has 621 transitions (discarded 188 similar events)
// Phase 1: matrix 621 rows 174 cols
[2025-05-29 22:40:27] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:40:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 22:40:27] [INFO ] Flow matrix only has 621 transitions (discarded 188 similar events)
[2025-05-29 22:40:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:40:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 22:40:27] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:40:28] [INFO ] Redundant transitions in 571 ms returned []
Running 772 sub problems to find dead transitions.
[2025-05-29 22:40:28] [INFO ] Flow matrix only has 621 transitions (discarded 188 similar events)
[2025-05-29 22:40:28] [INFO ] Invariant cache hit.
[2025-05-29 22:40:28] [INFO ] State equation strengthened by 30 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (OVERLAPS) 620/788 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/788 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 5 (OVERLAPS) 6/794 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 772 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 Real declared 794/795 variables, and 209 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 772/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 772 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (OVERLAPS) 620/788 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/788 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 26/229 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 6 (OVERLAPS) 6/794 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/795 variables, and 640 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30105 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 772/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61011ms problems are : Problem set: 0 solved, 772 unsolved
Search for dead transitions found 0 dead transitions in 61013ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/949 places, 809/2541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62137 ms. Remains : 174/949 places, 809/2541 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-06
Stuttering criterion allowed to conclude after 34037 steps with 991 reset in 116 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-06 finished in 62343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Graph (trivial) has 978 edges and 949 vertex of which 355 / 949 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2489 edges and 634 vertex of which 606 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 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 253 place count 605 transition count 904
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 504 place count 354 transition count 904
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 504 place count 354 transition count 854
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 604 place count 304 transition count 854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 605 place count 303 transition count 853
Iterating global reduction 2 with 1 rules applied. Total rules applied 606 place count 303 transition count 853
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 802 place count 205 transition count 755
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 852 place count 180 transition count 830
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 892 place count 180 transition count 790
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 902 place count 175 transition count 875
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 982 place count 175 transition count 795
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 983 place count 174 transition count 794
Applied a total of 983 rules in 117 ms. Remains 174 /949 variables (removed 775) and now considering 794/2541 (removed 1747) transitions.
[2025-05-29 22:41:29] [INFO ] Flow matrix only has 605 transitions (discarded 189 similar events)
// Phase 1: matrix 605 rows 174 cols
[2025-05-29 22:41:29] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-29 22:41:29] [INFO ] Flow matrix only has 605 transitions (discarded 189 similar events)
[2025-05-29 22:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 22:41:30] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:41:30] [INFO ] Redundant transitions in 430 ms returned []
Running 753 sub problems to find dead transitions.
[2025-05-29 22:41:30] [INFO ] Flow matrix only has 605 transitions (discarded 189 similar events)
[2025-05-29 22:41:30] [INFO ] Invariant cache hit.
[2025-05-29 22:41:30] [INFO ] State equation strengthened by 30 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (OVERLAPS) 604/773 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/773 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/773 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 5 (OVERLAPS) 5/778 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 753 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 Real declared 778/779 variables, and 209 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 753/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 753 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (OVERLAPS) 604/773 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/773 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/773 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 6 (OVERLAPS) 5/778 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 753 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/779 variables, and 636 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 753/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60850ms problems are : Problem set: 0 solved, 753 unsolved
Search for dead transitions found 0 dead transitions in 60852ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/949 places, 794/2541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61790 ms. Remains : 174/949 places, 794/2541 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-09
Stuttering criterion allowed to conclude after 2957 steps with 82 reset in 16 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-09 finished in 61907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Graph (trivial) has 969 edges and 949 vertex of which 342 / 949 are part of one of the 38 SCC in 1 ms
Free SCC test removed 304 places
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 2508 edges and 645 vertex of which 617 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 617 transition count 913
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 258 rules applied. Total rules applied 515 place count 362 transition count 910
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 360 transition count 910
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 517 place count 360 transition count 860
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 617 place count 310 transition count 860
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 618 place count 309 transition count 859
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 309 transition count 859
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 823 place count 207 transition count 757
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 873 place count 182 transition count 832
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 913 place count 182 transition count 792
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 923 place count 177 transition count 877
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 988 place count 177 transition count 812
Applied a total of 988 rules in 105 ms. Remains 177 /949 variables (removed 772) and now considering 812/2541 (removed 1729) transitions.
[2025-05-29 22:42:31] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
// Phase 1: matrix 630 rows 177 cols
[2025-05-29 22:42:31] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:31] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-29 22:42:31] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:31] [INFO ] State equation strengthened by 187 read => feed constraints.
[2025-05-29 22:42:32] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:42:32] [INFO ] Redundant transitions in 529 ms returned []
Running 811 sub problems to find dead transitions.
[2025-05-29 22:42:32] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:42:32] [INFO ] Invariant cache hit.
[2025-05-29 22:42:32] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 5 (OVERLAPS) 1/806 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/807 variables, and 368 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 470/837 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/807 variables, and 837 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/949 places, 812/2541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62196 ms. Remains : 177/949 places, 812/2541 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-11
Product exploration explored 100000 steps with 2882 reset in 417 ms.
Product exploration explored 100000 steps with 2865 reset in 414 ms.
Computed a total of 54 stabilizing places and 504 stable transitions
Computed a total of 54 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1217 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (62 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045099 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045099 steps, saw 140261 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2025-05-29 22:43:37] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:43:37] [INFO ] Invariant cache hit.
[2025-05-29 22:43:37] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/394 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 370/764 variables, 116/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/806 variables, 25/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/807 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/394 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 370/764 variables, 116/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/806 variables, 25/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/807 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/807 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2774 steps, including 84 resets, run visited all 1 properties in 18 ms. (steps per millisecond=154 )
Parikh walk visited 1 properties in 32 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 812/812 transitions.
Applied a total of 0 rules in 19 ms. Remains 177 /177 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2025-05-29 22:43:38] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-29 22:43:38] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:39] [INFO ] State equation strengthened by 187 read => feed constraints.
[2025-05-29 22:43:39] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:43:40] [INFO ] Redundant transitions in 480 ms returned []
Running 811 sub problems to find dead transitions.
[2025-05-29 22:43:40] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:43:40] [INFO ] Invariant cache hit.
[2025-05-29 22:43:40] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 5 (OVERLAPS) 1/806 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/807 variables, and 368 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 470/837 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/807 variables, and 837 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62090 ms. Remains : 177/177 places, 812/812 transitions.
Computed a total of 54 stabilizing places and 504 stable transitions
Computed a total of 54 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1194 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (61 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1016204 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1016204 steps, saw 135940 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2025-05-29 22:44:44] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:44:44] [INFO ] Invariant cache hit.
[2025-05-29 22:44:44] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/394 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 370/764 variables, 116/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/806 variables, 25/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/807 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/394 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 370/764 variables, 116/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/806 variables, 25/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/807 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/807 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/807 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 812/812 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 177 transition count 756
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 76 place count 167 transition count 836
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 167 transition count 828
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 154 place count 167 transition count 758
Free-agglomeration rule applied 45 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 199 place count 167 transition count 701
Reduce places removed 45 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 163 rules applied. Total rules applied 362 place count 122 transition count 583
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 369 place count 115 transition count 536
Iterating global reduction 3 with 7 rules applied. Total rules applied 376 place count 115 transition count 536
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 378 place count 115 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 439 place count 115 transition count 473
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 440 place count 115 transition count 473
Applied a total of 440 rules in 70 ms. Remains 115 /177 variables (removed 62) and now considering 473/812 (removed 339) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 115/177 places, 473/812 transitions.
RANDOM walk for 40000 steps (817 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1315188 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1315188 steps, saw 173831 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
[2025-05-29 22:44:47] [INFO ] Flow matrix only has 273 transitions (discarded 200 similar events)
// Phase 1: matrix 273 rows 115 cols
[2025-05-29 22:44:47] [INFO ] Computed 13 invariants in 4 ms
[2025-05-29 22:44:47] [INFO ] State equation strengthened by 161 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 181/225 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 90/315 variables, 34/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 59/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 65/380 variables, 29/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 29/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/388 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/388 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 115/115 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 181/225 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 90/315 variables, 34/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 59/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 65/380 variables, 29/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 29/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/388 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 115/115 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 728 steps, including 29 resets, run visited all 1 properties in 7 ms. (steps per millisecond=104 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2859 reset in 401 ms.
Product exploration explored 100000 steps with 2842 reset in 383 ms.
Built C files in :
/tmp/ltsmin15829597947386245740
[2025-05-29 22:44:49] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2025-05-29 22:44:49] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:44:49] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2025-05-29 22:44:49] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:44:49] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2025-05-29 22:44:49] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:44:49] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15829597947386245740
Running compilation step : cd /tmp/ltsmin15829597947386245740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2966 ms.
Running link step : cd /tmp/ltsmin15829597947386245740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin15829597947386245740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2290770482029495902.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 812/812 transitions.
Applied a total of 0 rules in 21 ms. Remains 177 /177 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2025-05-29 22:45:04] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
// Phase 1: matrix 630 rows 177 cols
[2025-05-29 22:45:04] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:45:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-29 22:45:04] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:45:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:45:04] [INFO ] State equation strengthened by 187 read => feed constraints.
[2025-05-29 22:45:05] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:45:05] [INFO ] Redundant transitions in 547 ms returned []
Running 811 sub problems to find dead transitions.
[2025-05-29 22:45:05] [INFO ] Flow matrix only has 630 transitions (discarded 182 similar events)
[2025-05-29 22:45:05] [INFO ] Invariant cache hit.
[2025-05-29 22:45:05] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 5 (OVERLAPS) 1/806 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/807 variables, and 368 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (OVERLAPS) 629/805 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 186/367 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 470/837 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/807 variables, and 837 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/177 constraints, ReadFeed: 186/187 constraints, PredecessorRefiner: 811/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60953ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 60955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62163 ms. Remains : 177/177 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin12714863164724891104
[2025-05-29 22:46:06] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2025-05-29 22:46:06] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:46:06] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2025-05-29 22:46:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:46:06] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2025-05-29 22:46:06] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:46:06] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12714863164724891104
Running compilation step : cd /tmp/ltsmin12714863164724891104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2725 ms.
Running link step : cd /tmp/ltsmin12714863164724891104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12714863164724891104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased110683978404129038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 22:46:22] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:46:22] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:46:22] [INFO ] Time to serialize gal into /tmp/LTL16636908937550318908.gal : 11 ms
[2025-05-29 22:46:22] [INFO ] Time to serialize properties into /tmp/LTL7718774793852277100.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16636908937550318908.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9445409951486904000.hoa' '-atoms' '/tmp/LTL7718774793852277100.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7718774793852277100.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9445409951486904000.hoa
Detected timeout of ITS tools.
[2025-05-29 22:46:37] [INFO ] Flatten gal took : 31 ms
[2025-05-29 22:46:37] [INFO ] Flatten gal took : 31 ms
[2025-05-29 22:46:37] [INFO ] Time to serialize gal into /tmp/LTL3396499275682619602.gal : 7 ms
[2025-05-29 22:46:37] [INFO ] Time to serialize properties into /tmp/LTL1919898981718223607.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3396499275682619602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1919898981718223607.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p339==0)||(p377==0))||((p486==0)||(p1503==0)))||(p1521==0))"))))
Formula 0 simplified : GF!"((((p339==0)||(p377==0))||((p486==0)||(p1503==0)))||(p1521==0))"
Detected timeout of ITS tools.
[2025-05-29 22:46:52] [INFO ] Flatten gal took : 29 ms
[2025-05-29 22:46:52] [INFO ] Applying decomposition
[2025-05-29 22:46:52] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5172895315416215902.txt' '-o' '/tmp/graph5172895315416215902.bin' '-w' '/tmp/graph5172895315416215902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5172895315416215902.bin' '-l' '-1' '-v' '-w' '/tmp/graph5172895315416215902.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:46:52] [INFO ] Decomposing Gal with order
[2025-05-29 22:46:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:46:52] [INFO ] Removed a total of 1734 redundant transitions.
[2025-05-29 22:46:52] [INFO ] Flatten gal took : 152 ms
[2025-05-29 22:46:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 43 ms.
[2025-05-29 22:46:52] [INFO ] Time to serialize gal into /tmp/LTL17153170390887817512.gal : 7 ms
[2025-05-29 22:46:52] [INFO ] Time to serialize properties into /tmp/LTL9254105123040780397.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17153170390887817512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9254105123040780397.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i1.u8.p339==0)||(i1.u9.p377==0))||((i1.u13.p486==0)||(u45.p1503==0)))||(u45.p1521==0))"))))
Formula 0 simplified : GF!"((((i1.u8.p339==0)||(i1.u9.p377==0))||((i1.u13.p486==0)||(u45.p1503==0)))||(u45.p1521==0))"
Reverse transition relation is NOT exact ! Due to transitions t2486_t975, t2477_t785, t2001_t935_t746_t748_t556_t365_t175, t2144_t785_t617_t2, u45.t3, i0.t...2132
Computing Next relation with stutter on 1.31058e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-11 finished in 276449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 948 transition count 2541
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 931 transition count 1511
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 931 transition count 1511
Applied a total of 35 rules in 52 ms. Remains 931 /949 variables (removed 18) and now considering 1511/2541 (removed 1030) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2025-05-29 22:47:08] [INFO ] Computed 15 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:08] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-29 22:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:09] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 714]
[2025-05-29 22:47:09] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/949 places, 1511/2541 transitions.
Applied a total of 0 rules in 19 ms. Remains 930 /930 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1350 ms. Remains : 930/949 places, 1511/2541 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2117 steps with 12 reset in 7 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-12 finished in 1487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 2541/2541 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 948 transition count 2541
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 931 transition count 1511
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 930 transition count 1510
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 930 transition count 1510
Applied a total of 37 rules in 67 ms. Remains 930 /949 variables (removed 19) and now considering 1510/2541 (removed 1031) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2025-05-29 22:47:09] [INFO ] Computed 15 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-29 22:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:10] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
[2025-05-29 22:47:10] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/949 places, 1510/2541 transitions.
Applied a total of 0 rules in 32 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1443 ms. Remains : 929/949 places, 1510/2541 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-14
Product exploration explored 100000 steps with 629 reset in 230 ms.
Product exploration explored 100000 steps with 618 reset in 266 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2861 edges and 929 vertex of which 913 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 78 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (243 resets) in 157 ms. (253 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (33 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 929 cols
[2025-05-29 22:47:12] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 182/602 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 683/1285 variables, 325/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1285 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 434/1719 variables, 205/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 412/2131 variables, 172/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2131 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2377 variables, 153/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2377 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 42/2419 variables, 29/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2419 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2435 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2435 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2439 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1436 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 182/602 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 683/1285 variables, 325/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1285 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 434/1719 variables, 205/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 412/2131 variables, 172/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2131 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2377 variables, 153/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2377 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/2419 variables, 29/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2419 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2435 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2435 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2439 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 945 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1551 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3000ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 166 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 929/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 22 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2025-05-29 22:47:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:15] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-05-29 22:47:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:17] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned [18, 184, 192, 357, 365, 530, 538, 704, 712]
[2025-05-29 22:47:17] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 22 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1370 ms. Remains : 928/929 places, 1510/1510 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2844 edges and 928 vertex of which 913 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (260 resets) in 193 ms. (206 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (33 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 928 cols
[2025-05-29 22:47:17] [INFO ] Computed 13 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/582 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 679/1261 variables, 311/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 451/1712 variables, 214/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 416/2128 variables, 175/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2128 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2374 variables, 153/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2374 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 44/2418 variables, 30/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2418 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2434 variables, 8/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2434 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2438 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2438/2438 variables, and 941 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1656 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 162/582 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 679/1261 variables, 311/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1261 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 451/1712 variables, 214/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 416/2128 variables, 175/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2128 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2374 variables, 153/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2374 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 44/2418 variables, 30/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2418 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2434 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2434 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2438 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2438/2438 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1509 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3175ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 2 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1510/1510 transitions.
Graph (trivial) has 965 edges and 928 vertex of which 340 / 928 are part of one of the 39 SCC in 0 ms
Free SCC test removed 301 places
Drop transitions (Empty/Sink Transition effects.) removed 386 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 2313 edges and 627 vertex of which 612 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 277 rules applied. Total rules applied 279 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 538 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 538 place count 353 transition count 789
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 652 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 657 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 662 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 662 place count 291 transition count 779
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 672 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 836 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 908 place count 168 transition count 910
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 940 place count 168 transition count 878
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1095 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1097 place count 167 transition count 734
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1098 place count 167 transition count 733
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1108 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1109 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1110 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1160 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 191 rules applied. Total rules applied 1351 place count 115 transition count 506
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1352 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1356 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1360 place count 111 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1442 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1443 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1444 place count 110 transition count 398
Applied a total of 1444 rules in 104 ms. Remains 110 /928 variables (removed 818) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 110/928 places, 398/1510 transitions.
RANDOM walk for 418 steps (3 resets) in 5 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 638 reset in 221 ms.
Product exploration explored 100000 steps with 632 reset in 239 ms.
Built C files in :
/tmp/ltsmin15566332493794278577
[2025-05-29 22:47:22] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15566332493794278577
Running compilation step : cd /tmp/ltsmin15566332493794278577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin15566332493794278577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15566332493794278577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7913682479266268476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 33 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2025-05-29 22:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:37] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 22:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:39] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned [183, 191, 356, 364, 529, 537, 703, 711]
[2025-05-29 22:47:39] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 927/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 45 ms. Remains 927 /927 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1424 ms. Remains : 927/928 places, 1510/1510 transitions.
Built C files in :
/tmp/ltsmin10521914933584286557
[2025-05-29 22:47:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10521914933584286557
Running compilation step : cd /tmp/ltsmin10521914933584286557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2816 ms.
Running link step : cd /tmp/ltsmin10521914933584286557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10521914933584286557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17992853745679185933.hoa' '--buchi-type=spotba'
LTSmin run took 7538 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5b-LTLFireability-14 finished in 39963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-05-29 22:47:49] [INFO ] Flatten gal took : 195 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14900643166653964842
[2025-05-29 22:47:49] [INFO ] Too many transitions (2541) to apply POR reductions. Disabling POR matrices.
[2025-05-29 22:47:49] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14900643166653964842
Running compilation step : cd /tmp/ltsmin14900643166653964842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-29 22:47:50] [INFO ] Applying decomposition
[2025-05-29 22:47:50] [INFO ] Flatten gal took : 182 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13496216158261736491.txt' '-o' '/tmp/graph13496216158261736491.bin' '-w' '/tmp/graph13496216158261736491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13496216158261736491.bin' '-l' '-1' '-v' '-w' '/tmp/graph13496216158261736491.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:47:50] [INFO ] Decomposing Gal with order
[2025-05-29 22:47:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:47:51] [INFO ] Removed a total of 10989 redundant transitions.
[2025-05-29 22:47:51] [INFO ] Flatten gal took : 703 ms
[2025-05-29 22:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2128 labels/synchronizations in 241 ms.
[2025-05-29 22:47:51] [INFO ] Time to serialize gal into /tmp/LTLFireability1676217775363953374.gal : 32 ms
[2025-05-29 22:47:51] [INFO ] Time to serialize properties into /tmp/LTLFireability425448921580314350.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1676217775363953374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability425448921580314350.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i23.u70.p339==0)||(i23.u347.p377==0))||((i5.i2.i0.u107.p486==0)||(i23.u347.p1503==0)))||(i23.u347.p1521==0))"))))
Formula 0 simplified : GF!"((((i23.u70.p339==0)||(i23.u347.p377==0))||((i5.i2.i0.u107.p486==0)||(i23.u347.p1503==0)))||(i23.u347.p1521==0))"
Compilation finished in 10366 ms.
Running link step : cd /tmp/ltsmin14900643166653964842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14900643166653964842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-29 23:11:09] [INFO ] Applying decomposition
[2025-05-29 23:11:10] [INFO ] Flatten gal took : 467 ms
[2025-05-29 23:11:10] [INFO ] Decomposing Gal with order
[2025-05-29 23:11:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:11:11] [INFO ] Removed a total of 19221 redundant transitions.
[2025-05-29 23:11:11] [INFO ] Flatten gal took : 941 ms
[2025-05-29 23:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 589 labels/synchronizations in 234 ms.
[2025-05-29 23:11:12] [INFO ] Time to serialize gal into /tmp/LTLFireability16168336967298888359.gal : 32 ms
[2025-05-29 23:11:12] [INFO ] Time to serialize properties into /tmp/LTLFireability9278284404416754114.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16168336967298888359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9278284404416754114.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i0.i0.i0.i0.i0.i1.i0.u13.p339==0)||(i0.i0.i0.i0.i0.i1.i0.u14.p377==0))||((i0.i0.i0.i0.i0.i1.u15.p486==0)||(i0.i1.u41.p1503...183
Formula 0 simplified : GF!"((((i0.i0.i0.i0.i0.i1.i0.u13.p339==0)||(i0.i0.i0.i0.i0.i1.i0.u14.p377==0))||((i0.i0.i0.i0.i0.i1.u15.p486==0)||(i0.i1.u41.p1503==...177
Reverse transition relation is NOT exact ! Due to transitions t1621, t2251, t2260, t2277, t2279, t2299, u40.t2, u40.t3, i0.t2496, i0.t2495, i0.t2487, i0.i0...2546
Computing Next relation with stutter on 1.94178e+12 deadlock states
Detected timeout of ITS tools.
[2025-05-29 23:34:30] [INFO ] Flatten gal took : 477 ms
[2025-05-29 23:34:30] [INFO ] Input system was already deterministic with 2541 transitions.
[2025-05-29 23:34:30] [INFO ] Transformed 949 places.
[2025-05-29 23:34:30] [INFO ] Transformed 2541 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-29 23:34:31] [INFO ] Time to serialize gal into /tmp/LTLFireability13422314446398061263.gal : 47 ms
[2025-05-29 23:34:31] [INFO ] Time to serialize properties into /tmp/LTLFireability4720085918060309.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13422314446398061263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4720085918060309.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...340
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((p339==0)||(p377==0))||((p486==0)||(p1503==0)))||(p1521==0))"))))
Formula 0 simplified : GF!"((((p339==0)||(p377==0))||((p486==0)||(p1503==0)))||(p1521==0))"
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CloudDeployment-PT-5b"
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-5832"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-5b, 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 r044-tall-174854027700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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.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 '
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 ;