About the Execution of ITS-Tools for CloudDeployment-PT-4a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 466804.00 | 0.00 | 0.00 | FFFTFFFTFFFFTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700035.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-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 55K 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.7K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 156K 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-4a-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748554424133
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-4a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 21:33:45] [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:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:33:45] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-05-29 21:33:45] [INFO ] Transformed 141 places.
[2025-05-29 21:33:45] [INFO ] Transformed 475 transitions.
[2025-05-29 21:33:45] [INFO ] Found NUPN structural information;
[2025-05-29 21:33:45] [INFO ] Parsed PT model containing 141 places and 475 transitions and 2657 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
FORMULA CloudDeployment-PT-4a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 423/423 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 134 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 133 transition count 422
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 133 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 133 transition count 384
Applied a total of 47 rules in 48 ms. Remains 133 /141 variables (removed 8) and now considering 384/423 (removed 39) transitions.
[2025-05-29 21:33:45] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 133 cols
[2025-05-29 21:33:45] [INFO ] Computed 17 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:46] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-29 21:33:46] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2025-05-29 21:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:46] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-05-29 21:33:46] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-29 21:33:46] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2025-05-29 21:33:46] [INFO ] Invariant cache hit.
[2025-05-29 21:33:46] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 224/356 variables, 132/149 constraints. Problems are: Problem set: 0 solved, 383 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 88/237 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 1/357 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/358 variables, and 239 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30073 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 133/133 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 224/356 variables, 132/149 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 88/237 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 383/620 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 1/357 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 383 unsolved
SMT process timed out in 60565ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 133/141 places, 384/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61230 ms. Remains : 133/141 places, 384/423 transitions.
Support contains 24 out of 133 places after structural reductions.
[2025-05-29 21:34:47] [INFO ] Flatten gal took : 57 ms
[2025-05-29 21:34:47] [INFO ] Flatten gal took : 29 ms
[2025-05-29 21:34:47] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 40000 steps (669 resets) in 1418 ms. (28 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40002 steps (113 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2025-05-29 21:34:47] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2025-05-29 21:34:47] [INFO ] Invariant cache hit.
[2025-05-29 21:34:47] [INFO ] State equation strengthened by 89 read => feed constraints.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/132 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/356 variables, 132/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 88/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/358 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/358 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 133/133 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/132 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/356 variables, 132/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 88/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/357 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/358 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/358 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 133/133 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 7 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudDeployment-PT-4a-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 65 stabilizing places and 248 stable transitions
Graph (complete) has 1111 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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&&G(p1)) U G(!p2))||G(p3)))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 384/384 transitions.
Graph (trivial) has 153 edges and 133 vertex of which 39 / 133 are part of one of the 12 SCC in 2 ms
Free SCC test removed 27 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 100 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 100 transition count 298
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 29 place count 90 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 75 place count 90 transition count 273
Applied a total of 75 rules in 63 ms. Remains 90 /133 variables (removed 43) and now considering 273/384 (removed 111) transitions.
[2025-05-29 21:34:48] [INFO ] Flow matrix only has 121 transitions (discarded 152 similar events)
// Phase 1: matrix 121 rows 90 cols
[2025-05-29 21:34:48] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 21:34:48] [INFO ] Flow matrix only has 121 transitions (discarded 152 similar events)
[2025-05-29 21:34:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 21:34:48] [INFO ] Implicit Places using invariants and state equation in 115 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:34:48] [INFO ] Redundant transitions in 195 ms returned []
Running 252 sub problems to find dead transitions.
[2025-05-29 21:34:48] [INFO ] Flow matrix only has 121 transitions (discarded 152 similar events)
[2025-05-29 21:34:48] [INFO ] Invariant cache hit.
[2025-05-29 21:34:48] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 120/210 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 111 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12041 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 120/210 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 252/363 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 363 constraints, problems are : Problem set: 0 solved, 252 unsolved in 17261 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29409ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 29411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/133 places, 273/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29868 ms. Remains : 90/133 places, 273/384 transitions.
Stuttering acceptance computed with spot in 446 ms :[(AND p2 (NOT p3)), true, (NOT p1), p2, (NOT p3), (AND p2 (NOT p3)), p2, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 52 stabilizing places and 197 stable transitions
Graph (complete) has 885 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 52 stabilizing places and 197 stable transitions
Detected a total of 52/90 stabilizing places and 197/273 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p3 p2), (X p2), (X (NOT (AND (NOT p1) p3))), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p0) p1 (NOT p3)))), (X (OR (AND p2 p0 p3) (AND p2 (NOT p1) p3))), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (OR (AND p2 p0) (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 p3)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) (NOT p1) p3)))), (X (NOT (AND p2 (NOT p3)))), (X (AND p2 p3)), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (OR (AND p2 p0 p3) (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 (NOT p1) (NOT p3)))))), (X (X (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) (NOT p1) p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 51 factoid took 137 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p3)]
RANDOM walk for 4730 steps (104 resets) in 43 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p3 p2), (X p2), (X (NOT (AND (NOT p1) p3))), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p0) p1 (NOT p3)))), (X (OR (AND p2 p0 p3) (AND p2 (NOT p1) p3))), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (OR (AND p2 p0) (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 p3)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) (NOT p1) p3)))), (X (NOT (AND p2 (NOT p3)))), (X (AND p2 p3)), (X p0), (X p1), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (OR (AND p2 p0 p3) (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 (NOT p1) (NOT p3)))))), (X (X (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) (NOT p1) p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 51 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4a-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 31067 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))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 384/384 transitions.
Graph (trivial) has 155 edges and 133 vertex of which 40 / 133 are part of one of the 12 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 98 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 98 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 97 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 285
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 33 place count 87 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 83 place count 87 transition count 261
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 87 transition count 261
Applied a total of 85 rules in 47 ms. Remains 87 /133 variables (removed 46) and now considering 261/384 (removed 123) transitions.
[2025-05-29 21:35:19] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2025-05-29 21:35:19] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:35:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-29 21:35:19] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
[2025-05-29 21:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:35:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 21:35:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:35:19] [INFO ] Redundant transitions in 125 ms returned []
Running 240 sub problems to find dead transitions.
[2025-05-29 21:35:19] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
[2025-05-29 21:35:19] [INFO ] Invariant cache hit.
[2025-05-29 21:35:19] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 4/87 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 117/204 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/205 variables, and 108 constraints, problems are : Problem set: 0 solved, 240 unsolved in 8747 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 87/87 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 4/87 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 117/204 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 240/348 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/205 variables, and 348 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17265 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 87/87 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26103ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 26104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/133 places, 261/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26446 ms. Remains : 87/133 places, 261/384 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-02 finished in 26509 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)&&F(G(p1)))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 384/384 transitions.
Graph (trivial) has 152 edges and 133 vertex of which 36 / 133 are part of one of the 11 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 101 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 101 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 100 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 100 transition count 292
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 89 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 84 place count 89 transition count 265
Applied a total of 84 rules in 36 ms. Remains 89 /133 variables (removed 44) and now considering 265/384 (removed 119) transitions.
[2025-05-29 21:35:45] [INFO ] Flow matrix only has 122 transitions (discarded 143 similar events)
// Phase 1: matrix 122 rows 89 cols
[2025-05-29 21:35:45] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:35:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 21:35:46] [INFO ] Flow matrix only has 122 transitions (discarded 143 similar events)
[2025-05-29 21:35:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:35:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 21:35:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:35:46] [INFO ] Redundant transitions in 143 ms returned []
Running 244 sub problems to find dead transitions.
[2025-05-29 21:35:46] [INFO ] Flow matrix only has 122 transitions (discarded 143 similar events)
[2025-05-29 21:35:46] [INFO ] Invariant cache hit.
[2025-05-29 21:35:46] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 110 constraints, problems are : Problem set: 0 solved, 244 unsolved in 8484 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 244/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 354 constraints, problems are : Problem set: 0 solved, 244 unsolved in 16588 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25150ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 25152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/133 places, 265/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25525 ms. Remains : 89/133 places, 265/384 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 25690 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(X(p0))||G(!p1)||(!p1&&F(p2)))))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 384/384 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 131 transition count 383
Applied a total of 3 rules in 9 ms. Remains 131 /133 variables (removed 2) and now considering 383/384 (removed 1) transitions.
[2025-05-29 21:36:11] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2025-05-29 21:36:11] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:36:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 21:36:11] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:36:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:36:11] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-29 21:36:11] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-29 21:36:11] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:36:11] [INFO ] Invariant cache hit.
[2025-05-29 21:36:11] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (OVERLAPS) 1/354 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/355 variables, and 235 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 382/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 617 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 131/133 places, 383/384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60462 ms. Remains : 131/133 places, 383/384 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-09
Product exploration explored 100000 steps with 128 reset in 113 ms.
Product exploration explored 100000 steps with 14 reset in 108 ms.
Computed a total of 63 stabilizing places and 247 stable transitions
Graph (complete) has 1094 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 247 stable transitions
Detected a total of 63/131 stabilizing places and 247/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 274 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
RANDOM walk for 40000 steps (640 resets) in 346 ms. (115 steps per ms) remains 1/10 properties
BEST_FIRST walk for 35690 steps (61 resets) in 91 ms. (387 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 717 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2025-05-29 21:37:14] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:37:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 21:37:14] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:37:15] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-29 21:37:15] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-29 21:37:15] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:37:15] [INFO ] Invariant cache hit.
[2025-05-29 21:37:15] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (OVERLAPS) 1/354 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/355 variables, and 235 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 382/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 617 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 131/131 places, 383/383 transitions.
Computed a total of 63 stabilizing places and 247 stable transitions
Graph (complete) has 1094 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 247 stable transitions
Detected a total of 63/131 stabilizing places and 247/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 257 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
RANDOM walk for 40000 steps (653 resets) in 148 ms. (268 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (74 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
[2025-05-29 21:38:16] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:38:16] [INFO ] Invariant cache hit.
[2025-05-29 21:38:16] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/355 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 369ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1590 steps, including 30 resets, run visited all 1 properties in 9 ms. (steps per millisecond=176 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 781 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Product exploration explored 100000 steps with 22 reset in 62 ms.
Product exploration explored 100000 steps with 181 reset in 68 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) p1 p0)]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 152 edges and 131 vertex of which 39 / 131 are part of one of the 12 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 100 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 100 transition count 289
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 20 place count 100 transition count 341
Deduced a syphon composed of 11 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 81 place count 100 transition count 280
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 81 rules in 21 ms. Remains 100 /131 variables (removed 31) and now considering 280/383 (removed 103) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:38:19] [INFO ] Redundant transitions in 168 ms returned []
Running 279 sub problems to find dead transitions.
[2025-05-29 21:38:19] [INFO ] Flow matrix only has 137 transitions (discarded 143 similar events)
// Phase 1: matrix 137 rows 100 cols
[2025-05-29 21:38:19] [INFO ] Computed 16 invariants in 2 ms
[2025-05-29 21:38:19] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 2 (OVERLAPS) 136/235 variables, 99/115 constraints. Problems are: Problem set: 15 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 67/182 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 1/236 variables, 1/183 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/183 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/237 variables, 1/184 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/184 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/184 constraints. Problems are: Problem set: 15 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 184 constraints, problems are : Problem set: 15 solved, 264 unsolved in 19612 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 100/100 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 11/99 variables, 4/16 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 136/235 variables, 99/115 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 67/182 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 264/446 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/446 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/236 variables, 1/447 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/237 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 448 constraints, problems are : Problem set: 15 solved, 264 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 100/100 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 264/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49715ms problems are : Problem set: 15 solved, 264 unsolved
Search for dead transitions found 15 dead transitions in 49716ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/131 places, 265/383 transitions.
Graph (complete) has 875 edges and 100 vertex of which 89 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 89 /100 variables (removed 11) and now considering 265/265 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/131 places, 265/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49923 ms. Remains : 89/131 places, 265/383 transitions.
Built C files in :
/tmp/ltsmin14850516626868526204
[2025-05-29 21:39:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14850516626868526204
Running compilation step : cd /tmp/ltsmin14850516626868526204;'/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 771 ms.
Running link step : cd /tmp/ltsmin14850516626868526204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14850516626868526204;'/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/stateBased9391346409464689829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2025-05-29 21:39:24] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2025-05-29 21:39:24] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:39:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-29 21:39:24] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:39:24] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-29 21:39:24] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-29 21:39:24] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
[2025-05-29 21:39:24] [INFO ] Invariant cache hit.
[2025-05-29 21:39:24] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (OVERLAPS) 1/354 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/355 variables, and 235 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 223/353 variables, 130/146 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 382/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 617 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 131/131 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in LTL mode , in 1 iterations and 60446 ms. Remains : 131/131 places, 383/383 transitions.
Built C files in :
/tmp/ltsmin8219267096987352010
[2025-05-29 21:40:24] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8219267096987352010
Running compilation step : cd /tmp/ltsmin8219267096987352010;'/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 604 ms.
Running link step : cd /tmp/ltsmin8219267096987352010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8219267096987352010;'/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/stateBased8198366948821754973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:40:39] [INFO ] Flatten gal took : 21 ms
[2025-05-29 21:40:39] [INFO ] Flatten gal took : 21 ms
[2025-05-29 21:40:39] [INFO ] Time to serialize gal into /tmp/LTL6314921513604948549.gal : 5 ms
[2025-05-29 21:40:39] [INFO ] Time to serialize properties into /tmp/LTL5341177596803270397.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/LTL6314921513604948549.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14626057685917844671.hoa' '-atoms' '/tmp/LTL5341177596803270397.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5341177596803270397.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14626057685917844671.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...357
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
163 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,1.69987,63784,1,0,474,191948,768,229,7271,202961,787
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-4a-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudDeployment-PT-4a-LTLCardinality-09 finished in 270237 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))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 384/384 transitions.
Graph (trivial) has 160 edges and 133 vertex of which 40 / 133 are part of one of the 12 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Ensure Unique test removed 1 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 99 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 99 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 98 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 98 transition count 286
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 37 place count 86 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 93 place count 86 transition count 258
Applied a total of 93 rules in 24 ms. Remains 86 /133 variables (removed 47) and now considering 258/384 (removed 126) transitions.
[2025-05-29 21:40:41] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2025-05-29 21:40:41] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:40:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-29 21:40:41] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2025-05-29 21:40:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:40:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-29 21:40:42] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:40:42] [INFO ] Redundant transitions in 138 ms returned []
Running 257 sub problems to find dead transitions.
[2025-05-29 21:40:42] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2025-05-29 21:40:42] [INFO ] Invariant cache hit.
[2025-05-29 21:40:42] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 114/199 variables, 85/101 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 66/167 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 1/200 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 169 constraints, problems are : Problem set: 0 solved, 257 unsolved in 17026 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 114/199 variables, 85/101 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 66/167 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 257/424 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 1/200 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 426 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47141ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 47142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/133 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47522 ms. Remains : 86/133 places, 258/384 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 729 ms.
Product exploration explored 100000 steps with 50000 reset in 702 ms.
Computed a total of 50 stabilizing places and 186 stable transitions
Graph (complete) has 868 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 50 stabilizing places and 186 stable transitions
Detected a total of 50/86 stabilizing places and 186/258 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4a-LTLCardinality-12 finished in 49044 ms.
All properties solved by simple procedures.
Total runtime 465536 ms.
BK_STOP 1748554890937
--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-4a"
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-4a, 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-174854027700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a 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 ;