Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CloudDeployment-PT-5b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-00
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-01
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-02
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-03
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-04
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-05
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-06
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-07
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-08
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-09
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-10
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-11
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-12
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-13
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-14
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748558759957

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-29 22:46:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 22:46:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:46:01] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2025-05-29 22:46:01] [INFO ] Transformed 1525 places.
[2025-05-29 22:46:01] [INFO ] Transformed 3132 transitions.
[2025-05-29 22:46:01] [INFO ] Found NUPN structural information;
[2025-05-29 22:46:01] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (245 resets) in 1976 ms. (20 steps per ms) remains 12/16 properties
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (33 resets) in 603 ms. (66 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 345 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (35 resets) in 380 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 209 ms. (190 steps per ms) remains 11/12 properties
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (36 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (37 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
[2025-05-29 22:46:02] [INFO ] Flatten gal took : 712 ms
BEST_FIRST walk for 40004 steps (22 resets) in 1416 ms. (28 steps per ms) remains 11/11 properties
[2025-05-29 22:46:03] [INFO ] Flatten gal took : 456 ms
BEST_FIRST walk for 40004 steps (31 resets) in 491 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 356 ms. (112 steps per ms) remains 11/11 properties
[2025-05-29 22:46:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11935193941051592241.gal : 194 ms
BEST_FIRST walk for 40004 steps (37 resets) in 424 ms. (94 steps per ms) remains 11/11 properties
[2025-05-29 22:46:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10031291566658623937.prop : 11 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11935193941051592241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10031291566658623937.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 3132 rows 1525 cols
[2025-05-29 22:46:03] [INFO ] Computed 21 invariants in 69 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1392/1524 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality10031291566658623937.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1524 variables, 1392/1545 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1524 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5289ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 1525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Graph (trivial) has 1324 edges and 1525 vertex of which 162 / 1525 are part of one of the 23 SCC in 7 ms
Free SCC test removed 139 places
Drop transitions (Empty/Sink Transition effects.) removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 3558 edges and 1386 vertex of which 1376 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.9 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
SDD proceeding with computation,11 properties remain. new max is 4
Iterating post reduction 0 with 577 rules applied. Total rules applied 579 place count 1376 transition count 2381
SDD size :1 after 3
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 589 rules applied. Total rules applied 1168 place count 804 transition count 2364
Reduce places removed 7 places and 0 transitions.
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :10 after 16
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :16 after 20
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :20 after 42
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 2 with 74 rules applied. Total rules applied 1242 place count 797 transition count 2297
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1311 place count 730 transition count 2295
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :42 after 205
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 1311 place count 730 transition count 2270
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1361 place count 705 transition count 2270
Discarding 218 places :
Symmetric choice reduction at 4 with 218 rule applications. Total rules 1579 place count 487 transition count 2052
Iterating global reduction 4 with 218 rules applied. Total rules applied 1797 place count 487 transition count 2052
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 1814 place count 487 transition count 2035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1815 place count 486 transition count 2035
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 1815 place count 486 transition count 2028
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1829 place count 479 transition count 2028
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1831 place count 477 transition count 2026
Iterating global reduction 6 with 2 rules applied. Total rules applied 1833 place count 477 transition count 2026
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1834 place count 476 transition count 2025
Iterating global reduction 6 with 1 rules applied. Total rules applied 1835 place count 476 transition count 2025
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 6 with 186 rules applied. Total rules applied 2021 place count 383 transition count 1932
Performed 54 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 2129 place count 329 transition count 2226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2137 place count 329 transition count 2218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2138 place count 328 transition count 2200
Iterating global reduction 7 with 1 rules applied. Total rules applied 2139 place count 328 transition count 2200
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 7 with 31 rules applied. Total rules applied 2170 place count 328 transition count 2169
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2186 place count 328 transition count 2153
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 2202 place count 312 transition count 2153
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 2222 place count 312 transition count 2153
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2225 place count 312 transition count 2150
Applied a total of 2225 rules in 731 ms. Remains 312 /1525 variables (removed 1213) and now considering 2150/3132 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 756 ms. Remains : 312/1525 places, 2150/3132 transitions.
RANDOM walk for 40000 steps (687 resets) in 2198 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (54 resets) in 279 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 283 ms. (140 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :205 after 14357
BEST_FIRST walk for 40003 steps (80 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (68 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 136 ms. (292 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (71 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 422 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (58 resets) in 432 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (85 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (66 resets) in 401 ms. (99 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 295285 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :1 out of 11
Probabilistic random walk after 295285 steps, saw 56813 distinct states, run finished after 3011 ms. (steps per millisecond=98 ) properties seen :1
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-05-29 22:46:14] [INFO ] Flow matrix only has 2037 transitions (discarded 113 similar events)
// Phase 1: matrix 2037 rows 312 cols
[2025-05-29 22:46:14] [INFO ] Computed 21 invariants in 39 ms
[2025-05-29 22:46:14] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 180/311 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2037/2348 variables, 311/332 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2348 variables, 65/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2348 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-09 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-10 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-13 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 1/2349 variables, 1/398 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2349 variables, 0/398 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/2349 variables, 0/398 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2349/2349 variables, and 398 constraints, problems are : Problem set: 3 solved, 7 unsolved in 3984 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 312/312 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 200/311 variables, 20/21 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2037/2348 variables, 311/332 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2348 variables, 65/397 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2348 variables, 0/397 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-02 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-08 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-5b-ReachabilityFireability-2025-15 is UNSAT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 1/2349 variables, 1/398 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2349 variables, 0/398 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2349 variables, 0/398 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2349/2349 variables, and 398 constraints, problems are : Problem set: 6 solved, 4 unsolved in 2954 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 312/312 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7157ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 781 ms.
Support contains 89 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 2150/2150 transitions.
Graph (trivial) has 111 edges and 312 vertex of which 16 / 312 are part of one of the 7 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 303 transition count 2128
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 297 transition count 2123
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 23 place count 292 transition count 2123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 23 place count 292 transition count 2119
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 31 place count 288 transition count 2119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 286 transition count 2117
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 286 transition count 2117
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 71 place count 268 transition count 2099
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 262 transition count 2142
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 103 place count 262 transition count 2122
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 149 place count 262 transition count 2076
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 159 place count 262 transition count 2066
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 183 place count 252 transition count 2052
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 198 place count 252 transition count 2037
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 252 transition count 2037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 251 transition count 2037
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 202 place count 251 transition count 2037
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 251 transition count 2036
Applied a total of 203 rules in 623 ms. Remains 251 /312 variables (removed 61) and now considering 2036/2150 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 251/312 places, 2036/2150 transitions.
RANDOM walk for 40000 steps (621 resets) in 1955 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (38 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (40 resets) in 507 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 296644 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 296644 steps, saw 64134 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-29 22:46:27] [INFO ] Flow matrix only has 1873 transitions (discarded 163 similar events)
// Phase 1: matrix 1873 rows 251 cols
[2025-05-29 22:46:27] [INFO ] Computed 21 invariants in 15 ms
[2025-05-29 22:46:27] [INFO ] State equation strengthened by 179 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 161/250 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
At refinement iteration 4 (OVERLAPS) 1873/2123 variables, 250/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :14357 after 632712
At refinement iteration 5 (INCLUDED_ONLY) 0/2123 variables, 179/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2123 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/2124 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2124 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2124 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2124/2124 variables, and 451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1516 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 251/251 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 161/250 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :632712 after 645032
At refinement iteration 4 (OVERLAPS) 1873/2123 variables, 250/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2123 variables, 179/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2123 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/2124 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2124 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :645032 after 660520
At refinement iteration 9 (OVERLAPS) 0/2124 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2124/2124 variables, and 451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2123 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 251/251 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3751ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 446 ms.
Support contains 89 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 2036/2036 transitions.
Applied a total of 0 rules in 49 ms. Remains 251 /251 variables (removed 0) and now considering 2036/2036 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 251/251 places, 2036/2036 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 2036/2036 transitions.
Applied a total of 0 rules in 38 ms. Remains 251 /251 variables (removed 0) and now considering 2036/2036 (removed 0) transitions.
[2025-05-29 22:46:31] [INFO ] Flow matrix only has 1873 transitions (discarded 163 similar events)
[2025-05-29 22:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :660520 after 680760
[2025-05-29 22:46:31] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-05-29 22:46:31] [INFO ] Flow matrix only has 1873 transitions (discarded 163 similar events)
[2025-05-29 22:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:46:32] [INFO ] State equation strengthened by 179 read => feed constraints.
[2025-05-29 22:46:33] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :680760 after 690612
[2025-05-29 22:46:34] [INFO ] Redundant transitions in 1030 ms returned []
Running 2035 sub problems to find dead transitions.
[2025-05-29 22:46:34] [INFO ] Flow matrix only has 1873 transitions (discarded 163 similar events)
[2025-05-29 22:46:34] [INFO ] Invariant cache hit.
[2025-05-29 22:46:34] [INFO ] State equation strengthened by 179 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :690612 after 718866
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :718866 after 1.64693e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :1.64693e+06 after 1.92599e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/2124 variables, and 21 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30079 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/251 constraints, ReadFeed: 0/179 constraints, PredecessorRefiner: 2035/484 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
SDD proceeding with computation,11 properties remain. new max is 262144
SDD size :1.92599e+06 after 2.23855e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 2 (OVERLAPS) 1873/2123 variables, 250/271 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2123 variables, 179/450 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2123 variables, 484/934 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/2124 variables, and 934 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 250/251 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 2035/484 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64399ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 64417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67195 ms. Remains : 251/251 places, 2036/2036 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 59 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 165 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 250 transition count 1869
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 248 transition count 1868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 247 transition count 1868
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 247 transition count 1867
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 246 transition count 1867
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 12 place count 243 transition count 1853
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 243 transition count 1853
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 242 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 241 transition count 1851
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 241 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 240 transition count 1850
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 240 transition count 1850
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 240 transition count 1838
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 240 transition count 1833
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 235 transition count 1833
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 56 place count 235 transition count 1833
Applied a total of 56 rules in 237 ms. Remains 235 /251 variables (removed 16) and now considering 1833/2036 (removed 203) transitions.
Running SMT prover for 4 properties.
Excessive predecessor constraint size, skipping predecessor.
// Phase 1: matrix 1833 rows 235 cols
[2025-05-29 22:47:38] [INFO ] Computed 21 invariants in 34 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:47:39] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:47:39] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 22:47:40] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-29 22:47:40] [INFO ] After 1192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-29 22:47:40] [INFO ] After 1587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-29 22:47:41] [INFO ] Flatten gal took : 235 ms
[2025-05-29 22:47:41] [INFO ] Flatten gal took : 220 ms
[2025-05-29 22:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1835941707927071001.gal : 49 ms
[2025-05-29 22:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5144046886041419882.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1835941707927071001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5144046886041419882.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5144046886041419882.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 73
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :73 after 577
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :577 after 20161
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :20161 after 132541
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :132541 after 137701
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :137701 after 140101
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :140101 after 147205
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :147205 after 569341
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :569341 after 1.61784e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.61784e+06 after 4.17468e+07
Detected timeout of ITS tools.
[2025-05-29 22:47:56] [INFO ] Flatten gal took : 209 ms
[2025-05-29 22:47:56] [INFO ] Applying decomposition
[2025-05-29 22:47:56] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8548520258842046996.txt' '-o' '/tmp/graph8548520258842046996.bin' '-w' '/tmp/graph8548520258842046996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8548520258842046996.bin' '-l' '-1' '-v' '-w' '/tmp/graph8548520258842046996.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:47:57] [INFO ] Decomposing Gal with order
[2025-05-29 22:47:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:47:58] [INFO ] Removed a total of 11439 redundant transitions.
[2025-05-29 22:47:58] [INFO ] Flatten gal took : 917 ms
[2025-05-29 22:47:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2186 labels/synchronizations in 498 ms.
[2025-05-29 22:47:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6645290964581587654.gal : 61 ms
[2025-05-29 22:47:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14948552919418233722.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6645290964581587654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14948552919418233722.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14948552919418233722.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3 after 19
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19 after 6.09584e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6.09584e+08 after 3.90986e+12
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-12 is true.
Invariant property CloudDeployment-PT-5b-ReachabilityFireability-2025-11 does not hold.
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-01 is true.
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-00 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.21731e+16,1.7518,37324,660,191,25317,3075,3539,76904,1783,8556,0
Total reachable state count : 12173061259295687

Verifying 4 reachability properties.
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-00,8.92968e+12,1.88498,37324,108,102,25317,3075,3775,76904,1842,8556,0
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-01,5.08286e+11,1.92948,37324,140,111,25317,3075,4193,76904,1925,8556,0
Invariant property CloudDeployment-PT-5b-ReachabilityFireability-2025-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-11,2.89229e+11,2.31167,37324,187,161,25317,3075,4811,76904,2023,8556,0
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-12,2.9455e+13,2.3478,37324,292,140,25317,3075,5311,76904,2129,8556,0
Over-approximation ignoring read arcs solved 0 properties in 23622 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 22:48:02] [INFO ] Flatten gal took : 211 ms
[2025-05-29 22:48:02] [INFO ] Applying decomposition
[2025-05-29 22:48:02] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph854792716508433444.txt' '-o' '/tmp/graph854792716508433444.bin' '-w' '/tmp/graph854792716508433444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph854792716508433444.bin' '-l' '-1' '-v' '-w' '/tmp/graph854792716508433444.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:48:03] [INFO ] Decomposing Gal with order
[2025-05-29 22:48:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:48:04] [INFO ] Removed a total of 6678 redundant transitions.
[2025-05-29 22:48:04] [INFO ] Flatten gal took : 1151 ms
[2025-05-29 22:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2119 labels/synchronizations in 84 ms.
[2025-05-29 22:48:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4967475338468242763.gal : 34 ms
[2025-05-29 22:48:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17071405849280096649.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4967475338468242763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17071405849280096649.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17071405849280096649.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3 after 2355
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2355 after 2.01163e+06
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-01 is true.
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2.01163e+06 after 2.64429e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.64429e+08 after 4.7648e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :4.7648e+08 after 1.40717e+09
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.40717e+09 after 3.26194e+09
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.26194e+09 after 3.89496e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.89496e+10 after 3.71773e+12
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-00 is true.
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.71773e+12 after 6.71846e+13
Detected timeout of ITS tools.
[2025-05-29 23:18:05] [INFO ] Flatten gal took : 189 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3726011580032711892
[2025-05-29 23:18:05] [INFO ] Too many transitions (2036) to apply POR reductions. Disabling POR matrices.
[2025-05-29 23:18:05] [INFO ] Applying decomposition
[2025-05-29 23:18:05] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3726011580032711892
Running compilation step : cd /tmp/ltsmin3726011580032711892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-29 23:18:05] [INFO ] Flatten gal took : 205 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3038974223633993681.txt' '-o' '/tmp/graph3038974223633993681.bin' '-w' '/tmp/graph3038974223633993681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3038974223633993681.bin' '-l' '-1' '-v' '-w' '/tmp/graph3038974223633993681.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:18:05] [INFO ] Decomposing Gal with order
[2025-05-29 23:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:18:06] [INFO ] Removed a total of 10999 redundant transitions.
[2025-05-29 23:18:06] [INFO ] Flatten gal took : 499 ms
[2025-05-29 23:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 3276 labels/synchronizations in 201 ms.
[2025-05-29 23:18:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5653880242543033423.gal : 20 ms
[2025-05-29 23:18:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17177347908037411687.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5653880242543033423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17177347908037411687.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability17177347908037411687.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 2.99814e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.99814e+06 after 2.88533e+08
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-12 is true.
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property CloudDeployment-PT-5b-ReachabilityFireability-2025-11 does not hold.
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.10471e+12,1.17116,41892,570,592,12786,5496,4283,27400,1950,13598,0
Total reachable state count : 6104709047873

Verifying 2 reachability properties.
Invariant property CloudDeployment-PT-5b-ReachabilityFireability-2025-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-11,2.74957e+08,1.24806,41892,177,387,12786,5496,5319,27400,2149,13598,0
Reachability property CloudDeployment-PT-5b-ReachabilityFireability-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-5b-ReachabilityFireability-2025-12,1.24407e+08,1.33905,41892,132,248,12786,5496,5964,27400,2265,13598,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1927113 ms.

BK_STOP 1748560688268

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-5b, examination is ReachabilityFireability"
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-174854027700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;