Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700047.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-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 591K 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-4b-ReachabilityFireability-2024-03
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-00
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-01
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-02
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-04
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-05
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-06
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-07
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-08
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-09
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-10
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-11
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-12
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-13
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-14
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748555914749

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-4b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-29 21:58:35] [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 21:58:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:58:36] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-05-29 21:58:36] [INFO ] Transformed 1182 places.
[2025-05-29 21:58:36] [INFO ] Transformed 1824 transitions.
[2025-05-29 21:58:36] [INFO ] Found NUPN structural information;
[2025-05-29 21:58:36] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 237 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 (308 resets) in 1868 ms. (21 steps per ms) remains 12/16 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 539 ms. (74 steps per ms) remains 12/12 properties
[2025-05-29 21:58:37] [INFO ] Flatten gal took : 375 ms
BEST_FIRST walk for 40004 steps (33 resets) in 711 ms. (56 steps per ms) remains 12/12 properties
[2025-05-29 21:58:37] [INFO ] Flatten gal took : 152 ms
BEST_FIRST walk for 40003 steps (52 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
[2025-05-29 21:58:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14301455753911297450.gal : 108 ms
[2025-05-29 21:58:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2736085282075775337.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14301455753911297450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2736085282075775337.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (32 resets) in 541 ms. (73 steps per ms) remains 12/12 properties

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 ...329
BEST_FIRST walk for 40003 steps (54 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (34 resets) in 272 ms. (146 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (49 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (53 resets) in 371 ms. (107 steps per ms) remains 11/12 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality2736085282075775337.prop.
BEST_FIRST walk for 40004 steps (48 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (41 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
// Phase 1: matrix 1824 rows 1182 cols
[2025-05-29 21:58:37] [INFO ] Computed 17 invariants in 39 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/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 951/1181 variables, 16/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :11 after 16
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :16 after 133
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :133 after 389
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :389 after 9126
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :9126 after 9414
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :9414 after 9542
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :9542 after 9990
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 951/1198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :9990 after 72374
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :72374 after 696345
At refinement iteration 6 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3005/3006 variables, and 2379 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5041 ms.
Refiners :[Domain max(s): 1181/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1181/1182 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 951/1181 variables, 16/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :696345 after 1.03556e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 951/1198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 10250ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 230 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 789 edges and 1182 vertex of which 63 / 1182 are part of one of the 10 SCC in 5 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 2660 edges and 1129 vertex of which 1122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 330 rules applied. Total rules applied 332 place count 1122 transition count 1427
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 336 rules applied. Total rules applied 668 place count 794 transition count 1419
Reduce places removed 3 places and 0 transitions.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 2 with 92 rules applied. Total rules applied 760 place count 791 transition count 1330
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 853 place count 702 transition count 1326
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 853 place count 702 transition count 1297
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 911 place count 673 transition count 1297
Discarding 138 places :
Symmetric choice reduction at 4 with 138 rule applications. Total rules 1049 place count 535 transition count 1159
Iterating global reduction 4 with 138 rules applied. Total rules applied 1187 place count 535 transition count 1159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1190 place count 535 transition count 1156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1190 place count 535 transition count 1154
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1194 place count 533 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1195 place count 532 transition count 1153
Iterating global reduction 5 with 1 rules applied. Total rules applied 1196 place count 532 transition count 1153
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 1328 place count 466 transition count 1087
Performed 32 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1392 place count 434 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1394 place count 434 transition count 1221
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 1432 place count 434 transition count 1183
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1448 place count 434 transition count 1167
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1464 place count 418 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1465 place count 418 transition count 1166
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1466 place count 418 transition count 1165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1467 place count 417 transition count 1165
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1480 place count 417 transition count 1165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1484 place count 417 transition count 1161
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1485 place count 417 transition count 1161
Applied a total of 1485 rules in 458 ms. Remains 417 /1182 variables (removed 765) and now considering 1161/1824 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 417/1182 places, 1161/1824 transitions.
RANDOM walk for 40000 steps (717 resets) in 414 ms. (96 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (92 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
SDD proceeding with computation,12 properties remain. new max is 65536
BEST_FIRST walk for 40004 steps (65 resets) in 401 ms. (99 steps per ms) remains 11/11 properties
SDD size :1.03556e+06 after 1.24741e+06
BEST_FIRST walk for 40002 steps (120 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (70 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (115 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (119 resets) in 266 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (92 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (82 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 306577 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 11
Probabilistic random walk after 306577 steps, saw 71127 distinct states, run finished after 3005 ms. (steps per millisecond=102 ) properties seen :0
[2025-05-29 21:58:52] [INFO ] Flow matrix only has 1148 transitions (discarded 13 similar events)
// Phase 1: matrix 1148 rows 417 cols
[2025-05-29 21:58:52] [INFO ] Computed 15 invariants in 14 ms
[2025-05-29 21:58:52] [INFO ] State equation strengthened by 18 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/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 123/353 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1141/1494 variables, 353/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1494 variables, 13/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1494 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CloudDeployment-PT-4b-ReachabilityFireability-2025-01 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-4b-ReachabilityFireability-2025-02 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-4b-ReachabilityFireability-2025-04 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-4b-ReachabilityFireability-2025-08 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 71/1565 variables, 64/445 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1565 variables, 5/450 constraints. Problems are: Problem set: 4 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :1.24741e+06 after 5.28384e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/1565 variables, 0/450 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1565 variables, 0/450 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1565/1565 variables, and 450 constraints, problems are : Problem set: 4 solved, 7 unsolved in 4494 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 417/417 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 175/323 variables, 14/15 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1080/1403 variables, 323/338 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1403 variables, 13/351 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 0/351 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem CloudDeployment-PT-4b-ReachabilityFireability-2025-07 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 141/1544 variables, 77/428 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 5/433 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/433 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/1564 variables, 16/449 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1564 variables, 0/449 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/1565 variables, 1/450 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1565 variables, 0/450 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1565 variables, 0/450 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1565/1565 variables, and 450 constraints, problems are : Problem set: 5 solved, 6 unsolved in 5154 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 417/417 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9742ms problems are : Problem set: 5 solved, 6 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2025-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 756 ms.
Support contains 78 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 1161/1161 transitions.
Graph (trivial) has 291 edges and 417 vertex of which 63 / 417 are part of one of the 18 SCC in 1 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 1705 edges and 372 vertex of which 371 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 371 transition count 1034
Reduce places removed 38 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 48 rules applied. Total rules applied 89 place count 333 transition count 1024
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 99 place count 323 transition count 1024
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 99 place count 323 transition count 1002
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 143 place count 301 transition count 1002
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 161 place count 283 transition count 984
Iterating global reduction 3 with 18 rules applied. Total rules applied 179 place count 283 transition count 984
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 283 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 283 transition count 981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 281 transition count 981
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 280 transition count 980
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 280 transition count 980
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 279 transition count 979
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 279 transition count 979
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 252 place count 247 transition count 947
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 259 place count 247 transition count 940
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 295 place count 229 transition count 1069
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 309 place count 229 transition count 1055
Drop transitions (Redundant composition of simpler transitions.) removed 110 transitions
Redundant transition composition rules discarded 110 transitions
Iterating global reduction 6 with 110 rules applied. Total rules applied 419 place count 229 transition count 945
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 228 transition count 944
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 228 transition count 944
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 438 place count 228 transition count 927
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 456 place count 211 transition count 926
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 469 place count 211 transition count 913
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 473 place count 211 transition count 913
Applied a total of 473 rules in 142 ms. Remains 211 /417 variables (removed 206) and now considering 913/1161 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 211/417 places, 913/1161 transitions.
RANDOM walk for 40000 steps (911 resets) in 523 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (64 resets) in 552 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 836667 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836667 steps, saw 133851 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-29 21:59:06] [INFO ] Flow matrix only has 816 transitions (discarded 97 similar events)
// Phase 1: matrix 816 rows 211 cols
[2025-05-29 21:59:06] [INFO ] Computed 16 invariants in 9 ms
[2025-05-29 21:59:06] [INFO ] State equation strengthened by 105 read => feed constraints.
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/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/189 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 810/999 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 99/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/1024 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1024 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/1027 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1027 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1027 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/189 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 810/999 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 99/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/1024 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1024 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/1027 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1027 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1027 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1027/1027 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 644 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1196ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 78 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 913/913 transitions.
Applied a total of 0 rules in 14 ms. Remains 211 /211 variables (removed 0) and now considering 913/913 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 211/211 places, 913/913 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 913/913 transitions.
Applied a total of 0 rules in 13 ms. Remains 211 /211 variables (removed 0) and now considering 913/913 (removed 0) transitions.
[2025-05-29 21:59:07] [INFO ] Flow matrix only has 816 transitions (discarded 97 similar events)
[2025-05-29 21:59:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:07] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 21:59:07] [INFO ] Flow matrix only has 816 transitions (discarded 97 similar events)
[2025-05-29 21:59:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:07] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-29 21:59:08] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:59:08] [INFO ] Redundant transitions in 450 ms returned []
Running 912 sub problems to find dead transitions.
[2025-05-29 21:59:08] [INFO ] Flow matrix only has 816 transitions (discarded 97 similar events)
[2025-05-29 21:59:08] [INFO ] Invariant cache hit.
[2025-05-29 21:59:08] [INFO ] State equation strengthened by 105 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :5.28384e+06 after 1.99393e+07
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (OVERLAPS) 816/1026 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 912 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1026 variables, 105/331 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1026 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/1027 variables, 1/332 constraints. Problems are: Problem set: 255 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 332 constraints, problems are : Problem set: 255 solved, 657 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 912/423 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 657 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 8/8 constraints. Problems are: Problem set: 255 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/8 constraints. Problems are: Problem set: 255 solved, 657 unsolved
At refinement iteration 2 (OVERLAPS) 8/210 variables, 8/16 constraints. Problems are: Problem set: 255 solved, 657 unsolved
SDD proceeding with computation,12 properties remain. new max is 524288
SDD size :1.99393e+07 after 2.23136e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 255 solved, 657 unsolved
At refinement iteration 4 (OVERLAPS) 816/1026 variables, 210/226 constraints. Problems are: Problem set: 255 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 105/331 constraints. Problems are: Problem set: 255 solved, 657 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 423/754 constraints. Problems are: Problem set: 255 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1027 variables, and 754 constraints, problems are : Problem set: 255 solved, 657 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 657/423 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61608ms problems are : Problem set: 255 solved, 657 unsolved
Search for dead transitions found 255 dead transitions in 61617ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/211 places, 658/913 transitions.
Applied a total of 0 rules in 11 ms. Remains 211 /211 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:00:10] [INFO ] Redundant transitions in 328 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63238 ms. Remains : 211/211 places, 658/913 transitions.
RANDOM walk for 40000 steps (908 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (67 resets) in 508 ms. (78 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1057586 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1057586 steps, saw 169024 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
[2025-05-29 22:00:14] [INFO ] Flow matrix only has 561 transitions (discarded 97 similar events)
// Phase 1: matrix 561 rows 211 cols
[2025-05-29 22:00:14] [INFO ] Computed 24 invariants in 11 ms
[2025-05-29 22:00:14] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/189 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 555/744 variables, 189/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 99/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/769 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/772 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/772 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/189 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 555/744 variables, 189/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 99/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/769 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/772 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/772 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 817ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 78 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 658/658 transitions.
Applied a total of 0 rules in 10 ms. Remains 211 /211 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 211/211 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 658/658 transitions.
Applied a total of 0 rules in 9 ms. Remains 211 /211 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2025-05-29 22:00:14] [INFO ] Flow matrix only has 561 transitions (discarded 97 similar events)
[2025-05-29 22:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:00:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 22:00:15] [INFO ] Flow matrix only has 561 transitions (discarded 97 similar events)
[2025-05-29 22:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:00:15] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-29 22:00:15] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:00:15] [INFO ] Redundant transitions in 345 ms returned []
Running 657 sub problems to find dead transitions.
[2025-05-29 22:00:15] [INFO ] Flow matrix only has 561 transitions (discarded 97 similar events)
[2025-05-29 22:00:15] [INFO ] Invariant cache hit.
[2025-05-29 22:00:15] [INFO ] State equation strengthened by 105 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (OVERLAPS) 8/210 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 4 (OVERLAPS) 561/771 variables, 210/234 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 105/339 constraints. Problems are: Problem set: 0 solved, 657 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 7 (OVERLAPS) 1/772 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/772 variables, and 340 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 657/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (OVERLAPS) 8/210 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 4 (OVERLAPS) 561/771 variables, 210/234 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 105/339 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 424/763 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Error getting values : (error "ParserException while parsing response: (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 Int declared 771/772 variables, and 763 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 210/211 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 657/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60922ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 60924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61868 ms. Remains : 211/211 places, 658/658 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 211 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 210 transition count 560
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 99 place count 210 transition count 557
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 207 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 205 transition count 546
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 205 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 203 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 202 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 202 transition count 545
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 202 transition count 539
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 196 transition count 539
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 196 transition count 539
Applied a total of 137 rules in 43 ms. Remains 196 /211 variables (removed 15) and now considering 539/658 (removed 119) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 539 rows 196 cols
[2025-05-29 22:01:16] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:01:16] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:01:17] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2025-05-29 22:01:17] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 22:01:17] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 22:01:17] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 22:01:17] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:01:17] [INFO ] Flatten gal took : 31 ms
[2025-05-29 22:01:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7515164496335175972.gal : 14 ms
[2025-05-29 22:01:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12116000570758914223.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/ReachabilityCardinality7515164496335175972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12116000570758914223.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 ...329
Loading property file /tmp/ReachabilityCardinality12116000570758914223.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 47
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :47 after 99
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :99 after 6393
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6393 after 9872
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9872 after 43745
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :43745 after 6.04424e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.04424e+06 after 1.0363e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.0363e+07 after 2.8372e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.8372e+07 after 3.58135e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.58135e+07 after 4.22224e+09
SDD proceeding with computation,12 properties remain. new max is 1048576
SDD size :2.23136e+08 after 4.04497e+09
Detected timeout of ITS tools.
[2025-05-29 22:01:32] [INFO ] Flatten gal took : 27 ms
[2025-05-29 22:01:32] [INFO ] Applying decomposition
[2025-05-29 22:01:32] [INFO ] Flatten gal took : 26 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/graph3163538948247750697.txt' '-o' '/tmp/graph3163538948247750697.bin' '-w' '/tmp/graph3163538948247750697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3163538948247750697.bin' '-l' '-1' '-v' '-w' '/tmp/graph3163538948247750697.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:01:32] [INFO ] Decomposing Gal with order
[2025-05-29 22:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:01:32] [INFO ] Removed a total of 994 redundant transitions.
[2025-05-29 22:01:32] [INFO ] Flatten gal took : 120 ms
[2025-05-29 22:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 18 ms.
[2025-05-29 22:01:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7060675071704647163.gal : 5 ms
[2025-05-29 22:01:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8093767770447490577.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/ReachabilityCardinality7060675071704647163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8093767770447490577.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 ...307
Loading property file /tmp/ReachabilityCardinality8093767770447490577.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 4035
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4035 after 9.48603e+07
Reachability property CloudDeployment-PT-4b-ReachabilityFireability-2024-03 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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.7602e+12,0.114112,7292,302,123,4762,1337,837,7308,212,2921,0
Total reachable state count : 1760197445667

Verifying 1 reachability properties.
Reachability property CloudDeployment-PT-4b-ReachabilityFireability-2024-03 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-4b-ReachabilityFireability-2024-03,118272,0.150022,7420,88,65,4762,1337,1558,7308,347,2921,0
Over-approximation ignoring read arcs solved 0 properties in 16136 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 22:01:33] [INFO ] Flatten gal took : 90 ms
[2025-05-29 22:01:33] [INFO ] Applying decomposition
[2025-05-29 22:01:33] [INFO ] Flatten gal took : 88 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/graph16514149476778713448.txt' '-o' '/tmp/graph16514149476778713448.bin' '-w' '/tmp/graph16514149476778713448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16514149476778713448.bin' '-l' '-1' '-v' '-w' '/tmp/graph16514149476778713448.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:01:33] [INFO ] Decomposing Gal with order
[2025-05-29 22:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:01:34] [INFO ] Removed a total of 2042 redundant transitions.
[2025-05-29 22:01:34] [INFO ] Flatten gal took : 291 ms
[2025-05-29 22:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 53 ms.
[2025-05-29 22:01:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17841471470477754812.gal : 16 ms
[2025-05-29 22:01:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10134998678624278546.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/ReachabilityCardinality17841471470477754812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10134998678624278546.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 ...309
Loading property file /tmp/ReachabilityCardinality10134998678624278546.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :17 after 7.62725e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.62725e+07 after 1.35487e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.35487e+10 after 8.67234e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.67234e+10 after 3.06635e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.06635e+13 after 9.46176e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.46176e+13 after 1.49596e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.49596e+15 after 1.66786e+16
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.66786e+16 after 1.76028e+16
Detected timeout of ITS tools.
[2025-05-29 22:31:36] [INFO ] Flatten gal took : 466 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin441643170066988760
[2025-05-29 22:31:36] [INFO ] Applying decomposition
[2025-05-29 22:31:36] [INFO ] Computing symmetric may disable matrix : 658 transitions.
[2025-05-29 22:31:37] [INFO ] Computation of Complete disable matrix. took 149 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:31:37] [INFO ] Flatten gal took : 412 ms
[2025-05-29 22:31:37] [INFO ] Computing symmetric may enable matrix : 658 transitions.
[2025-05-29 22:31:37] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:31:39] [INFO ] Computing Do-Not-Accords matrix : 658 transitions.
[2025-05-29 22:31:39] [INFO ] Computation of Completed DNA matrix. took 137 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:31:39] [INFO ] Built C files in 2787ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin441643170066988760
Running compilation step : cd /tmp/ltsmin441643170066988760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph11328455271751086382.txt' '-o' '/tmp/graph11328455271751086382.bin' '-w' '/tmp/graph11328455271751086382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11328455271751086382.bin' '-l' '-1' '-v' '-w' '/tmp/graph11328455271751086382.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:31:39] [INFO ] Decomposing Gal with order
[2025-05-29 22:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:31:40] [INFO ] Removed a total of 1291 redundant transitions.
[2025-05-29 22:31:40] [INFO ] Flatten gal took : 327 ms
[2025-05-29 22:31:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 88 ms.
[2025-05-29 22:31:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7361341978503610994.gal : 15 ms
[2025-05-29 22:31:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16944279754012243673.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/ReachabilityFireability7361341978503610994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16944279754012243673.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/ReachabilityFireability16944279754012243673.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 109
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :109 after 138365
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :138365 after 6.44014e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.44014e+11 after 2.68209e+12
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,2.42615e+13,0.514775,14016,488,278,16406,7906,1196,30523,375,25195,0
Total reachable state count : 24261458667460

Verifying 1 reachability properties.
Reachability property CloudDeployment-PT-4b-ReachabilityFireability-2024-03 does not hold.
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : CloudDeployment-PT-4b-ReachabilityFireability-2024-03

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-4b-ReachabilityFireability-2024-03,0,0.540281,14272,1,0,16406,7906,1809,30523,483,25195,6305
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1985158 ms.

BK_STOP 1748557901336

--------------------
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-4b"
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-4b, 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-174854027700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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