About the Execution of ITS-Tools for CloudDeployment-PT-3b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1126690.00 | 0.00 | 0.00 | TFTFTFTFTFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027600027.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-3b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027600027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 58K 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 308K 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-3b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748553123534
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 21:12:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 21:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:12:04] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-05-29 21:12:04] [INFO ] Transformed 859 places.
[2025-05-29 21:12:04] [INFO ] Transformed 1152 transitions.
[2025-05-29 21:12:04] [INFO ] Found NUPN structural information;
[2025-05-29 21:12:04] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-3b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 855 transition count 1152
Discarding 204 places :
Symmetric choice reduction at 1 with 204 rule applications. Total rules 208 place count 651 transition count 891
Iterating global reduction 1 with 204 rules applied. Total rules applied 412 place count 651 transition count 891
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 483 place count 580 transition count 820
Iterating global reduction 1 with 71 rules applied. Total rules applied 554 place count 580 transition count 820
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 559 place count 580 transition count 815
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 568 place count 571 transition count 806
Iterating global reduction 2 with 9 rules applied. Total rules applied 577 place count 571 transition count 806
Applied a total of 577 rules in 181 ms. Remains 571 /859 variables (removed 288) and now considering 806/1152 (removed 346) transitions.
// Phase 1: matrix 806 rows 571 cols
[2025-05-29 21:12:05] [INFO ] Computed 9 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:05] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-29 21:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:06] [INFO ] Implicit Places using invariants and state equation in 519 ms returned [365]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 570/859 places, 806/1152 transitions.
Applied a total of 0 rules in 20 ms. Remains 570 /570 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1101 ms. Remains : 570/859 places, 806/1152 transitions.
Support contains 33 out of 570 places after structural reductions.
[2025-05-29 21:12:06] [INFO ] Flatten gal took : 86 ms
[2025-05-29 21:12:06] [INFO ] Flatten gal took : 58 ms
[2025-05-29 21:12:06] [INFO ] Input system was already deterministic with 806 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (423 resets) in 1593 ms. (25 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40003 steps (76 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (73 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (79 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (74 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (75 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (73 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
// Phase 1: matrix 806 rows 570 cols
[2025-05-29 21:12:07] [INFO ] Computed 8 invariants in 6 ms
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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 17/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 309/434 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 304/738 variables, 129/262 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 271/1009 variables, 121/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1009 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 249/1258 variables, 113/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1258 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 94/1352 variables, 67/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1352 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 18/1370 variables, 11/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1370 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 6/1376 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1376 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1376 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1376/1376 variables, and 578 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1366 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 17/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 309/434 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 304/738 variables, 129/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/738 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 271/1009 variables, 121/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1009 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 249/1258 variables, 113/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 94/1352 variables, 67/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1352 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 18/1370 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1370 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/1376 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1376 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/1376 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1376/1376 variables, and 586 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4143 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5549ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 222 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=222 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 664 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 83 stabilizing places and 204 stable transitions
Graph (complete) has 1469 edges and 570 vertex of which 559 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.15 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((X(p1)||p0)))'
Support contains 2 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 561 transition count 797
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 561 transition count 797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 559 transition count 795
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 559 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 559 transition count 794
Applied a total of 23 rules in 52 ms. Remains 559 /570 variables (removed 11) and now considering 794/806 (removed 12) transitions.
// Phase 1: matrix 794 rows 559 cols
[2025-05-29 21:12:14] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:14] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-29 21:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:14] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-05-29 21:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 794/1352 variables, 558/566 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1352/1353 variables, and 566 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/559 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 794/1352 variables, 558/566 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 793/1359 constraints. Problems are: Problem set: 0 solved, 793 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 1352/1353 variables, and 1359 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/559 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in LTL mode, iteration 1 : 559/570 places, 794/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61277 ms. Remains : 559/570 places, 794/806 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 8546 steps with 94 reset in 56 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-01 finished in 61607 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((G(F(!p0))||(!p1&&F(!p0)))))||(F(p2)&&X(X(F((G(F(!p0))||(!p1&&F(!p0)))))))))'
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 561 transition count 797
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 561 transition count 797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 559 transition count 795
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 559 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 559 transition count 794
Applied a total of 23 rules in 27 ms. Remains 559 /570 variables (removed 11) and now considering 794/806 (removed 12) transitions.
// Phase 1: matrix 794 rows 559 cols
[2025-05-29 21:13:15] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-29 21:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:16] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-05-29 21:13:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 794/1352 variables, 558/566 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1352/1353 variables, and 566 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/559 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 794/1352 variables, 558/566 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 793/1359 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1352/1353 variables, and 1359 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/559 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in LTL mode, iteration 1 : 559/570 places, 794/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61095 ms. Remains : 559/570 places, 794/806 transitions.
Stuttering acceptance computed with spot in 228 ms :[p0, (AND (NOT p2) p0), p0, (AND (NOT p2) p0), p0, p0]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-03
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-03 finished in 61349 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((X(p0)||(X(G(p1))&&G(p2))))))'
Support contains 4 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 560 transition count 796
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 560 transition count 796
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 558 transition count 794
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 558 transition count 794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 558 transition count 793
Applied a total of 25 rules in 28 ms. Remains 558 /570 variables (removed 12) and now considering 793/806 (removed 13) transitions.
// Phase 1: matrix 793 rows 558 cols
[2025-05-29 21:14:17] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:14:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-29 21:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:14:17] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2025-05-29 21:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 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 1350/1351 variables, and 565 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1350 variables, 792/1357 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1351 variables, and 1357 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 558/570 places, 793/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 558/570 places, 793/806 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-05
Product exploration explored 100000 steps with 1031 reset in 215 ms.
Product exploration explored 100000 steps with 1067 reset in 262 ms.
Computed a total of 80 stabilizing places and 201 stable transitions
Graph (complete) has 1452 edges and 558 vertex of which 547 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Computed a total of 80 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (424 resets) in 259 ms. (153 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (79 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
[2025-05-29 21:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 79/116 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 296/412 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 303/715 variables, 128/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 265/980 variables, 119/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 241/1221 variables, 108/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1221 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 100/1321 variables, 69/548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 21/1342 variables, 12/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 17 (OVERLAPS) 9/1351 variables, 6/566 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1351 variables, 0/566 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1351 variables, 0/566 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1351/1351 variables, and 566 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1477 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 79/116 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 296/412 variables, 116/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 303/715 variables, 128/252 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 3/255 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 265/980 variables, 119/374 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 241/1221 variables, 108/482 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1221 variables, 0/482 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 100/1321 variables, 69/551 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1321 variables, 0/551 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/1342 variables, 12/563 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 0/563 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 9/1351 variables, 6/569 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1351 variables, 0/569 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1351 variables, 0/569 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1351/1351 variables, and 569 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1677 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3163ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 152 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=38 )
Parikh walk visited 3 properties in 3 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 12 factoid took 338 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 558 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 793/793 transitions.
Applied a total of 0 rules in 8 ms. Remains 558 /558 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2025-05-29 21:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:15:23] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 21:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:15:23] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2025-05-29 21:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1350/1351 variables, and 565 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1350 variables, 792/1357 constraints. Problems are: Problem set: 0 solved, 792 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 1350/1351 variables, and 1357 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60332ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Finished structural reductions in LTL mode , in 1 iterations and 60955 ms. Remains : 558/558 places, 793/793 transitions.
Computed a total of 80 stabilizing places and 201 stable transitions
Graph (complete) has 1452 edges and 558 vertex of which 547 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Computed a total of 80 stabilizing places and 201 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (421 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 609232 steps, run visited all 1 properties in 2205 ms. (steps per millisecond=276 )
Probabilistic random walk after 609232 steps, saw 138764 distinct states, run finished after 2210 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1058 reset in 136 ms.
Product exploration explored 100000 steps with 1074 reset in 150 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 793/793 transitions.
Graph (trivial) has 582 edges and 558 vertex of which 213 / 558 are part of one of the 24 SCC in 4 ms
Free SCC test removed 189 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Graph (complete) has 1197 edges and 369 vertex of which 358 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 358 transition count 574
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 150 place count 358 transition count 592
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 171 place count 358 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 249 place count 280 transition count 514
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 327 place count 280 transition count 514
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 387 place count 280 transition count 514
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 432 place count 235 transition count 469
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 477 place count 235 transition count 469
Performed 21 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 498 place count 235 transition count 604
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 501 place count 235 transition count 601
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 525 place count 211 transition count 526
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 549 place count 211 transition count 526
Deduced a syphon composed of 103 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 2 with 45 rules applied. Total rules applied 594 place count 211 transition count 481
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 600 place count 205 transition count 475
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 606 place count 205 transition count 475
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 609 place count 205 transition count 529
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 615 place count 199 transition count 505
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 621 place count 199 transition count 505
Deduced a syphon composed of 94 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 660 place count 199 transition count 466
Deduced a syphon composed of 94 places in 1 ms
Applied a total of 660 rules in 168 ms. Remains 199 /558 variables (removed 359) and now considering 466/793 (removed 327) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:16:28] [INFO ] Redundant transitions in 388 ms returned []
Running 465 sub problems to find dead transitions.
[2025-05-29 21:16:28] [INFO ] Flow matrix only has 389 transitions (discarded 77 similar events)
// Phase 1: matrix 389 rows 199 cols
[2025-05-29 21:16:28] [INFO ] Computed 3 invariants in 2 ms
[2025-05-29 21:16:28] [INFO ] State equation strengthened by 97 read => feed constraints.
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/198 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 2 (OVERLAPS) 388/586 variables, 198/201 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 96/297 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 0/297 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 1/587 variables, 1/298 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/298 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 1/588 variables, 1/299 constraints. Problems are: Problem set: 124 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 299 constraints, problems are : Problem set: 124 solved, 341 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 465/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 124 solved, 341 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 8/112 variables, 3/3 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 379/491 variables, 112/115 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 96/211 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 340/551 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/551 constraints. Problems are: Problem set: 124 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 96/587 variables, 87/638 constraints. Problems are: Problem set: 124 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 638 constraints, problems are : Problem set: 124 solved, 341 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 96/97 constraints, PredecessorRefiner: 341/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 124 solved, 341 unsolved
Search for dead transitions found 124 dead transitions in 60297ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 199/558 places, 342/793 transitions.
Graph (complete) has 825 edges and 199 vertex of which 105 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.2 ms
Discarding 94 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 105 /199 variables (removed 94) and now considering 342/342 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/558 places, 342/793 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60873 ms. Remains : 105/558 places, 342/793 transitions.
Built C files in :
/tmp/ltsmin1308116074479871118
[2025-05-29 21:17:28] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1308116074479871118
Running compilation step : cd /tmp/ltsmin1308116074479871118;'/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 1318 ms.
Running link step : cd /tmp/ltsmin1308116074479871118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 136 ms.
Running LTSmin : cd /tmp/ltsmin1308116074479871118;'/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/stateBased2012186466144394167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 793/793 transitions.
Applied a total of 0 rules in 19 ms. Remains 558 /558 variables (removed 0) and now considering 793/793 (removed 0) transitions.
// Phase 1: matrix 793 rows 558 cols
[2025-05-29 21:17:43] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:17:43] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-29 21:17:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:17:44] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2025-05-29 21:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1350/1351 variables, and 565 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (OVERLAPS) 793/1350 variables, 557/565 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1350 variables, 792/1357 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 189)
(s7 1)
(s8 1)
(s9 2)
(s10 1)
(s11 0)
(s12 0)
(s13 2)
(s14 0)
(s15 1)
(s16 1)
(s17 2)
(s18 3)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 189)
(s172 1)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 181)
(s181 9)
(s182 0)
(s183 2)
(s184 1)
(s185 0)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 2)
(s192 1)
(s193 0)
(s194 1)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 0)
(s217 1)
(s218 1)
(s219 1)
(s220 0)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 0)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 0)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 1)
(s347 1)
(s348 111)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 188)
(s354 1)
(s355 2)
(s356 1)
(s357 0)
(s358 0)
(s359 1)
(s360 1)
(s361 1)
(s362 4)
(s363 0)
(s364 3)
(s365 1)
(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 69)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 0)
(s390 1)
(s391 1)
(timeout
s392 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1351 variables, and 1357 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 557/558 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 558/558 places, 793/793 transitions.
Built C files in :
/tmp/ltsmin4035276138056616267
[2025-05-29 21:18:44] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4035276138056616267
Running compilation step : cd /tmp/ltsmin4035276138056616267;'/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 1228 ms.
Running link step : cd /tmp/ltsmin4035276138056616267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4035276138056616267;'/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/stateBased7029653999284668092.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:18:59] [INFO ] Flatten gal took : 37 ms
[2025-05-29 21:18:59] [INFO ] Flatten gal took : 37 ms
[2025-05-29 21:18:59] [INFO ] Time to serialize gal into /tmp/LTL17681983574516324615.gal : 16 ms
[2025-05-29 21:18:59] [INFO ] Time to serialize properties into /tmp/LTL14888114073354889949.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17681983574516324615.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13290145328706495150.hoa' '-atoms' '/tmp/LTL14888114073354889949.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...320
Loading property file /tmp/LTL14888114073354889949.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13290145328706495150.hoa
Detected timeout of ITS tools.
[2025-05-29 21:19:14] [INFO ] Flatten gal took : 75 ms
[2025-05-29 21:19:15] [INFO ] Flatten gal took : 64 ms
[2025-05-29 21:19:15] [INFO ] Time to serialize gal into /tmp/LTL17454070934789925599.gal : 7 ms
[2025-05-29 21:19:15] [INFO ] Time to serialize properties into /tmp/LTL16363112316959702419.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17454070934789925599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16363112316959702419.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((p367==0)||(p842==1))"))||((X(G("((p842==0)&&(p367==1))")))&&(G("((p553==0)&&(p518==1))")))))))
Formula 0 simplified : XF(X!"((p367==0)||(p842==1))" & (XF!"((p842==0)&&(p367==1))" | F!"((p553==0)&&(p518==1))"))
Detected timeout of ITS tools.
[2025-05-29 21:19:30] [INFO ] Flatten gal took : 28 ms
[2025-05-29 21:19:30] [INFO ] Applying decomposition
[2025-05-29 21:19:30] [INFO ] Flatten gal took : 27 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/graph8022683397238562816.txt' '-o' '/tmp/graph8022683397238562816.bin' '-w' '/tmp/graph8022683397238562816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8022683397238562816.bin' '-l' '-1' '-v' '-w' '/tmp/graph8022683397238562816.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:19:30] [INFO ] Decomposing Gal with order
[2025-05-29 21:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:19:30] [INFO ] Removed a total of 728 redundant transitions.
[2025-05-29 21:19:30] [INFO ] Flatten gal took : 86 ms
[2025-05-29 21:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 18 ms.
[2025-05-29 21:19:30] [INFO ] Time to serialize gal into /tmp/LTL4188588272542861020.gal : 10 ms
[2025-05-29 21:19:30] [INFO ] Time to serialize properties into /tmp/LTL9566176205652251949.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/LTL4188588272542861020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9566176205652251949.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i7.i1.u82.p367==0)||(i14.u211.p842==1))"))||((X(G("((i14.u211.p842==0)&&(i7.i1.u82.p367==1))")))&&(G("((i15.i0.u136.p553=...190
Formula 0 simplified : XF(X!"((i7.i1.u82.p367==0)||(i14.u211.p842==1))" & (XF!"((i14.u211.p842==0)&&(i7.i1.u82.p367==1))" | F!"((i15.i0.u136.p553==0)&&(i12...176
Reverse transition relation is NOT exact ! Due to transitions t109, t136, t165, t166, t184, t356, t357, t375, t494, t521, t550, t570, t596, t635, t639, t64...1138
Computing Next relation with stutter on 4.87979e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-3b-LTLCardinality-05 finished in 328510 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 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Graph (trivial) has 593 edges and 570 vertex of which 208 / 570 are part of one of the 24 SCC in 2 ms
Free SCC test removed 184 places
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1229 edges and 386 vertex of which 375 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 160 place count 374 transition count 434
Reduce places removed 158 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 216 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 322 place count 214 transition count 432
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 322 place count 214 transition count 405
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 376 place count 187 transition count 405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 380 place count 183 transition count 401
Iterating global reduction 3 with 4 rules applied. Total rules applied 384 place count 183 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 384 place count 183 transition count 399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 388 place count 181 transition count 399
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 504 place count 123 transition count 340
Performed 18 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 540 place count 105 transition count 403
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 552 place count 105 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 598 place count 105 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 599 place count 104 transition count 344
Applied a total of 599 rules in 61 ms. Remains 104 /570 variables (removed 466) and now considering 344/806 (removed 462) transitions.
[2025-05-29 21:19:45] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
// Phase 1: matrix 267 rows 104 cols
[2025-05-29 21:19:45] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 21:19:45] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2025-05-29 21:19:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-29 21:19:45] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:19:46] [INFO ] Redundant transitions in 205 ms returned []
Running 319 sub problems to find dead transitions.
[2025-05-29 21:19:46] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2025-05-29 21:19:46] [INFO ] Invariant cache hit.
[2025-05-29 21:19:46] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 266/367 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 3/370 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13595 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 266/367 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 3/370 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 301/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 438 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43796ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 43797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/570 places, 344/806 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44274 ms. Remains : 104/570 places, 344/806 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-07
Product exploration explored 100000 steps with 5859 reset in 250 ms.
Product exploration explored 100000 steps with 5902 reset in 234 ms.
Computed a total of 29 stabilizing places and 199 stable transitions
Computed a total of 29 stabilizing places and 199 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2532 resets) in 1050 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (237 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1227108 steps, run visited all 1 properties in 1746 ms. (steps per millisecond=702 )
Probabilistic random walk after 1227108 steps, saw 153902 distinct states, run finished after 1746 ms. (steps per millisecond=702 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 344/344 transitions.
Applied a total of 0 rules in 13 ms. Remains 104 /104 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2025-05-29 21:20:32] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2025-05-29 21:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:20:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-29 21:20:33] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2025-05-29 21:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:20:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-29 21:20:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:20:33] [INFO ] Redundant transitions in 181 ms returned []
Running 319 sub problems to find dead transitions.
[2025-05-29 21:20:33] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2025-05-29 21:20:33] [INFO ] Invariant cache hit.
[2025-05-29 21:20:33] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 266/367 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 3/370 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13929 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 266/367 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 3/370 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 301/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 438 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44160ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 44161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44550 ms. Remains : 104/104 places, 344/344 transitions.
Computed a total of 29 stabilizing places and 199 stable transitions
Computed a total of 29 stabilizing places and 199 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37694 steps (2365 resets) in 107 ms. (349 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5990 reset in 196 ms.
Product exploration explored 100000 steps with 5911 reset in 205 ms.
Built C files in :
/tmp/ltsmin3789135680037504684
[2025-05-29 21:21:18] [INFO ] Computing symmetric may disable matrix : 344 transitions.
[2025-05-29 21:21:18] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:21:18] [INFO ] Computing symmetric may enable matrix : 344 transitions.
[2025-05-29 21:21:18] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:21:18] [INFO ] Computing Do-Not-Accords matrix : 344 transitions.
[2025-05-29 21:21:18] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:21:18] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3789135680037504684
Running compilation step : cd /tmp/ltsmin3789135680037504684;'/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 780 ms.
Running link step : cd /tmp/ltsmin3789135680037504684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3789135680037504684;'/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/stateBased7600141741484060867.hoa' '--buchi-type=spotba'
LTSmin run took 990 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-3b-LTLCardinality-07 finished in 94828 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((F(p0)&&F(p1)&&F(p2))))'
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 563 transition count 799
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 563 transition count 799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 562 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 562 transition count 798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 562 transition count 797
Applied a total of 17 rules in 25 ms. Remains 562 /570 variables (removed 8) and now considering 797/806 (removed 9) transitions.
// Phase 1: matrix 797 rows 562 cols
[2025-05-29 21:21:20] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:21:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-29 21:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:21:20] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2025-05-29 21:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1358/1359 variables, and 569 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 796/1365 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1358/1359 variables, and 1365 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 562/570 places, 797/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60899 ms. Remains : 562/570 places, 797/806 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1457 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p2), (X p0), (X (X p1)), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLCardinality-08 finished in 61604 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' '!(((p0 U p1) U X((G(p1)&&F(G(p2))))))'
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 564 transition count 800
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 564 transition count 800
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 562 transition count 798
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 562 transition count 798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 562 transition count 797
Applied a total of 17 rules in 26 ms. Remains 562 /570 variables (removed 8) and now considering 797/806 (removed 9) transitions.
// Phase 1: matrix 797 rows 562 cols
[2025-05-29 21:22:22] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:22:22] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-29 21:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:22:22] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2025-05-29 21:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1358/1359 variables, and 569 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 796/1365 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1358/1359 variables, and 1365 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Starting structural reductions in LTL mode, iteration 1 : 562/570 places, 797/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60914 ms. Remains : 562/570 places, 797/806 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-12
Product exploration explored 100000 steps with 1060 reset in 141 ms.
Product exploration explored 100000 steps with 1063 reset in 202 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 154 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (408 resets) in 131 ms. (303 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
[2025-05-29 21:23:24] [INFO ] Invariant cache hit.
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/967 variables, 120/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 258/1225 variables, 114/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 106/1331 variables, 74/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1331 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/1352 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1352 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/1359 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/701 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 266/967 variables, 120/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 258/1225 variables, 114/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 106/1331 variables, 74/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1331 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 21/1352 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1359 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 572 constraints, problems are : Problem set: 0 solved, 2 unsolved in 960 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 356 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 797/797 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2025-05-29 21:23:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 21:23:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:26] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2025-05-29 21:23:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1358/1359 variables, and 569 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 796/1365 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1358/1359 variables, and 1365 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/562 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 562/562 places, 797/797 transitions.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 141 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (412 resets) in 111 ms. (357 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2025-05-29 21:24:27] [INFO ] Invariant cache hit.
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/967 variables, 120/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 258/1225 variables, 114/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 106/1331 variables, 74/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1331 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/1352 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1352 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/1359 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 418 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/701 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 266/967 variables, 120/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 258/1225 variables, 114/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 106/1331 variables, 74/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1331 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 21/1352 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1359 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 572 constraints, problems are : Problem set: 0 solved, 2 unsolved in 936 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 193 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 451 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 1037 reset in 143 ms.
Product exploration explored 100000 steps with 1067 reset in 161 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 797/797 transitions.
Graph (trivial) has 581 edges and 562 vertex of which 204 / 562 are part of one of the 23 SCC in 2 ms
Free SCC test removed 181 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 1217 edges and 381 vertex of which 370 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 370 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 159 place count 370 transition count 586
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 159 place count 370 transition count 602
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 178 place count 370 transition count 602
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 259 place count 289 transition count 521
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 340 place count 289 transition count 521
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 402 place count 289 transition count 524
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 449 place count 242 transition count 477
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 496 place count 242 transition count 477
Performed 21 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 517 place count 242 transition count 625
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 532 place count 242 transition count 610
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 558 place count 216 transition count 528
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 584 place count 216 transition count 528
Deduced a syphon composed of 104 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 616 place count 216 transition count 496
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 619 place count 213 transition count 493
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 622 place count 213 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 213 transition count 511
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 625 place count 211 transition count 503
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 627 place count 211 transition count 503
Deduced a syphon composed of 100 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 630 place count 211 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 630 rules in 62 ms. Remains 211 /562 variables (removed 351) and now considering 500/797 (removed 297) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:24:30] [INFO ] Redundant transitions in 186 ms returned []
Running 499 sub problems to find dead transitions.
[2025-05-29 21:24:30] [INFO ] Flow matrix only has 430 transitions (discarded 70 similar events)
// Phase 1: matrix 430 rows 211 cols
[2025-05-29 21:24:30] [INFO ] Computed 3 invariants in 3 ms
[2025-05-29 21:24:30] [INFO ] State equation strengthened by 74 read => feed constraints.
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/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
At refinement iteration 2 (OVERLAPS) 429/639 variables, 210/213 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 73/286 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/286 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 1/640 variables, 1/287 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/287 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 1/641 variables, 1/288 constraints. Problems are: Problem set: 134 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 288 constraints, problems are : Problem set: 134 solved, 365 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 211/211 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 499/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 134 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 8/118 variables, 3/3 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 420/538 variables, 118/121 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 73/194 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 364/558 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/558 constraints. Problems are: Problem set: 134 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 102/640 variables, 93/651 constraints. Problems are: Problem set: 134 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/641 variables, and 651 constraints, problems are : Problem set: 134 solved, 365 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 211/211 constraints, ReadFeed: 73/74 constraints, PredecessorRefiner: 365/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 134 solved, 365 unsolved
Search for dead transitions found 134 dead transitions in 60305ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 211/562 places, 366/797 transitions.
Graph (complete) has 841 edges and 211 vertex of which 111 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 111 /211 variables (removed 100) and now considering 366/366 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/562 places, 366/797 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60564 ms. Remains : 111/562 places, 366/797 transitions.
Built C files in :
/tmp/ltsmin2289820360335366448
[2025-05-29 21:25:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2289820360335366448
Running compilation step : cd /tmp/ltsmin2289820360335366448;'/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 1265 ms.
Running link step : cd /tmp/ltsmin2289820360335366448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2289820360335366448;'/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/stateBased11047714688147558026.hoa' '--buchi-type=spotba'
LTSmin run took 496 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-3b-LTLCardinality-12 finished in 190946 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(p0)&&X(X(G(p1)))))'
Support contains 4 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 562 transition count 798
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 562 transition count 798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 561 transition count 797
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 561 transition count 797
Applied a total of 18 rules in 23 ms. Remains 561 /570 variables (removed 9) and now considering 797/806 (removed 9) transitions.
// Phase 1: matrix 797 rows 561 cols
[2025-05-29 21:25:32] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:25:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 21:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:25:33] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2025-05-29 21:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1357 variables, 560/568 constraints. Problems are: Problem set: 0 solved, 796 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 1357/1358 variables, and 568 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 560/561 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1357 variables, 560/568 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 796/1364 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1357/1358 variables, and 1364 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 560/561 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 561/570 places, 797/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60960 ms. Remains : 561/570 places, 797/806 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-13 finished in 61138 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((X(p0)||(X(G(p1))&&G(p2))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-3b-LTLCardinality-05
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 4 out of 570 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 570/570 places, 806/806 transitions.
Graph (trivial) has 590 edges and 570 vertex of which 213 / 570 are part of one of the 24 SCC in 1 ms
Free SCC test removed 189 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Graph (complete) has 1221 edges and 381 vertex of which 370 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 369 transition count 433
Reduce places removed 153 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 156 rules applied. Total rules applied 311 place count 216 transition count 430
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 213 transition count 430
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 314 place count 213 transition count 404
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 366 place count 187 transition count 404
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 370 place count 183 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 374 place count 183 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 183 transition count 398
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 378 place count 181 transition count 398
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 490 place count 125 transition count 341
Performed 18 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 526 place count 107 transition count 404
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 538 place count 107 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 541 place count 107 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 106 transition count 388
Applied a total of 542 rules in 37 ms. Remains 106 /570 variables (removed 464) and now considering 388/806 (removed 418) transitions.
[2025-05-29 21:26:34] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
// Phase 1: matrix 311 rows 106 cols
[2025-05-29 21:26:34] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:26:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-29 21:26:34] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:26:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:26:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-29 21:26:34] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-05-29 21:26:34] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:26:34] [INFO ] Invariant cache hit.
[2025-05-29 21:26:34] [INFO ] State equation strengthened by 15 read => feed constraints.
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/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 3/416 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/417 variables, and 124 constraints, problems are : Problem set: 0 solved, 363 unsolved in 21297 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 3/416 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 339/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 486 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51611ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 51612ms
Starting structural reductions in LI_LTL mode, iteration 1 : 106/570 places, 388/806 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51909 ms. Remains : 106/570 places, 388/806 transitions.
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-05
Product exploration explored 100000 steps with 6033 reset in 283 ms.
Product exploration explored 100000 steps with 6037 reset in 296 ms.
Computed a total of 32 stabilizing places and 242 stable transitions
Computed a total of 32 stabilizing places and 242 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (2536 resets) in 441 ms. (90 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (244 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (240 resets) in 26 ms. (1481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (244 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (240 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (236 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
[2025-05-29 21:27:27] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:27:27] [INFO ] Invariant cache hit.
[2025-05-29 21:27:27] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 144/165 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 223/388 variables, 62/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 8 (OVERLAPS) 28/416 variables, 23/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/417 variables, and 124 constraints, problems are : Problem set: 2 solved, 3 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 144/165 variables, 21/24 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 223/388 variables, 62/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 15/101 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 28/416 variables, 23/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/127 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/127 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/127 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/417 variables, and 127 constraints, problems are : Problem set: 2 solved, 3 unsolved in 351 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 3116 steps, including 228 resets, run visited all 3 properties in 44 ms. (steps per millisecond=70 )
Parikh walk visited 3 properties in 45 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 12 factoid took 398 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 388/388 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2025-05-29 21:27:28] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:27:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-29 21:27:28] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:27:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-29 21:27:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-05-29 21:27:28] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:27:28] [INFO ] Invariant cache hit.
[2025-05-29 21:27:28] [INFO ] State equation strengthened by 15 read => feed constraints.
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/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 3/416 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/417 variables, and 124 constraints, problems are : Problem set: 0 solved, 363 unsolved in 26823 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 3/416 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 339/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 486 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57144ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 57145ms
Finished structural reductions in LTL mode , in 1 iterations and 57347 ms. Remains : 106/106 places, 388/388 transitions.
Computed a total of 32 stabilizing places and 242 stable transitions
Computed a total of 32 stabilizing places and 242 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2542 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (242 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 559581 steps, run visited all 1 properties in 921 ms. (steps per millisecond=607 )
Probabilistic random walk after 559581 steps, saw 80999 distinct states, run finished after 921 ms. (steps per millisecond=607 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6069 reset in 218 ms.
Product exploration explored 100000 steps with 6064 reset in 224 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 388/388 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 391
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 391
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 1 with 46 rules applied. Total rules applied 50 place count 105 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 50 rules in 22 ms. Remains 105 /106 variables (removed 1) and now considering 345/388 (removed 43) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:28:28] [INFO ] Redundant transitions in 170 ms returned []
Running 320 sub problems to find dead transitions.
[2025-05-29 21:28:28] [INFO ] Flow matrix only has 268 transitions (discarded 77 similar events)
// Phase 1: matrix 268 rows 105 cols
[2025-05-29 21:28:28] [INFO ] Computed 3 invariants in 1 ms
[2025-05-29 21:28:28] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 2 (OVERLAPS) 267/369 variables, 102/105 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 12/117 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 3/372 variables, 3/120 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/373 variables, and 120 constraints, problems are : Problem set: 1 solved, 319 unsolved in 15110 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 319 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 267/368 variables, 101/104 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 12/116 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 17/133 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 4/372 variables, 4/137 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 302/439 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 319 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/373 variables, and 439 constraints, problems are : Problem set: 1 solved, 319 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 319/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45331ms problems are : Problem set: 1 solved, 319 unsolved
Search for dead transitions found 1 dead transitions in 45332ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/106 places, 344/388 transitions.
Graph (complete) has 812 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 344/344 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/106 places, 344/388 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45542 ms. Remains : 104/106 places, 344/388 transitions.
Built C files in :
/tmp/ltsmin6080860599386959128
[2025-05-29 21:29:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6080860599386959128
Running compilation step : cd /tmp/ltsmin6080860599386959128;'/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 645 ms.
Running link step : cd /tmp/ltsmin6080860599386959128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6080860599386959128;'/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/stateBased12399283471725366107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 388/388 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2025-05-29 21:29:29] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
// Phase 1: matrix 311 rows 106 cols
[2025-05-29 21:29:29] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:29:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 21:29:29] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:29:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-29 21:29:29] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-05-29 21:29:29] [INFO ] Flow matrix only has 311 transitions (discarded 77 similar events)
[2025-05-29 21:29:29] [INFO ] Invariant cache hit.
[2025-05-29 21:29:29] [INFO ] State equation strengthened by 15 read => feed constraints.
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/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 3/416 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/417 variables, and 124 constraints, problems are : Problem set: 0 solved, 363 unsolved in 21815 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 310/413 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 3/416 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 339/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 486 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 363/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52131ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 52132ms
Finished structural reductions in LTL mode , in 1 iterations and 52371 ms. Remains : 106/106 places, 388/388 transitions.
Built C files in :
/tmp/ltsmin14464631949168267215
[2025-05-29 21:30:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14464631949168267215
Running compilation step : cd /tmp/ltsmin14464631949168267215;'/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 651 ms.
Running link step : cd /tmp/ltsmin14464631949168267215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14464631949168267215;'/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/stateBased1296360303566938613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:30:36] [INFO ] Flatten gal took : 28 ms
[2025-05-29 21:30:36] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:30:36] [INFO ] Time to serialize gal into /tmp/LTL10746249420421451432.gal : 2 ms
[2025-05-29 21:30:36] [INFO ] Time to serialize properties into /tmp/LTL15653454718288581967.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10746249420421451432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11395478573653492563.hoa' '-atoms' '/tmp/LTL15653454718288581967.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...320
Loading property file /tmp/LTL15653454718288581967.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11395478573653492563.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t165, t201, t208, t356, t392, t401, t550, t586, t593, t788.t594, t521.t555, t480.t489.t55...1953
Computing Next relation with stutter on 3.85665e+07 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1132 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.3845,336444,1,0,707,1.30644e+06,781,406,8778,1.91652e+06,1112
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property CloudDeployment-PT-3b-LTLCardinality-05 finished in 256058 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-29 21:30:50] [INFO ] Flatten gal took : 42 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1125458 ms.
BK_STOP 1748554250224
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-3b"
export BK_EXAMINATION="LTLCardinality"
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-3b, examination is LTLCardinality"
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-174854027600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3b.tgz
mv CloudDeployment-PT-3b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;