Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620506200583.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
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 r476-tall-171620506200583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717208601142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:23:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:23:22] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-01 02:23:22] [INFO ] Transformed 1182 places.
[2024-06-01 02:23:22] [INFO ] Transformed 1824 transitions.
[2024-06-01 02:23:22] [INFO ] Found NUPN structural information;
[2024-06-01 02:23:22] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (303 resets) in 2408 ms. (16 steps per ms) remains 13/16 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (53 resets) in 507 ms. (78 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (53 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (33 resets) in 1271 ms. (31 steps per ms) remains 12/13 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (50 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (26 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (38 resets) in 268 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (25 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 49 ms. (800 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (43 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
// Phase 1: matrix 1824 rows 1182 cols
[2024-06-01 02:23:24] [INFO ] Computed 17 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 963/1181 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 963/1198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem CloudDeployment-PT-4b-ReachabilityFireability-2024-12 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1/3006 variables, 1/2380 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3006 variables, 1/2381 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3006 variables, 0/2381 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 2381 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5048 ms.
Refiners :[Domain max(s): 1182/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1182/1182 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 976/1181 variables, 16/222 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 976/1198 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 11/2390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3005/3006 variables, and 2390 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5015 ms.
Refiners :[Domain max(s): 1181/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1181/1182 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 11102ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 205 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 815 edges and 1182 vertex of which 87 / 1182 are part of one of the 12 SCC in 6 ms
Free SCC test removed 75 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 2633 edges and 1107 vertex of which 1101 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 318 place count 1101 transition count 1415
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 323 rules applied. Total rules applied 641 place count 785 transition count 1408
Reduce places removed 2 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 2 with 81 rules applied. Total rules applied 722 place count 783 transition count 1329
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 805 place count 704 transition count 1325
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 805 place count 704 transition count 1277
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 901 place count 656 transition count 1277
Discarding 144 places :
Symmetric choice reduction at 4 with 144 rule applications. Total rules 1045 place count 512 transition count 1133
Iterating global reduction 4 with 144 rules applied. Total rules applied 1189 place count 512 transition count 1133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1194 place count 512 transition count 1128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1194 place count 512 transition count 1126
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 1198 place count 510 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1199 place count 509 transition count 1125
Iterating global reduction 5 with 1 rules applied. Total rules applied 1200 place count 509 transition count 1125
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 1324 place count 447 transition count 1063
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1376 place count 421 transition count 1154
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 1394 place count 421 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1398 place count 419 transition count 1154
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1400 place count 419 transition count 1152
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 1423 place count 419 transition count 1129
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 1447 place count 396 transition count 1128
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1454 place count 396 transition count 1121
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1456 place count 396 transition count 1119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1458 place count 394 transition count 1119
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 1478 place count 394 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1482 place count 394 transition count 1115
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1484 place count 394 transition count 1115
Applied a total of 1484 rules in 461 ms. Remains 394 /1182 variables (removed 788) and now considering 1115/1824 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 394/1182 places, 1115/1824 transitions.
RANDOM walk for 40000 steps (679 resets) in 628 ms. (63 steps per ms) remains 10/11 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (115 resets) in 344 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (117 resets) in 322 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (128 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (95 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (134 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 134 ms. (296 steps per ms) remains 9/10 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 02:23:36] [INFO ] Flow matrix only has 1107 transitions (discarded 8 similar events)
// Phase 1: matrix 1107 rows 394 cols
[2024-06-01 02:23:36] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 02:23:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 63/248 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1046/1294 variables, 248/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1294 variables, 28/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 195/1489 variables, 134/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1489 variables, 9/432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 12/1501 variables, 12/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1501 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1501 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1501/1501 variables, and 444 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2254 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 394/394 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 63/248 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1046/1294 variables, 248/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1294 variables, 28/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CloudDeployment-PT-4b-ReachabilityFireability-2024-00 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-4b-ReachabilityFireability-2024-02 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-4b-ReachabilityFireability-2024-05 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 195/1489 variables, 134/424 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 9/433 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1489 variables, 5/438 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1489 variables, 0/438 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1501 variables, 12/450 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1501 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 450 constraints, problems are : Problem set: 3 solved, 6 unsolved in 6703 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 394/394 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 9396ms problems are : Problem set: 3 solved, 6 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2201 ms.
Support contains 118 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 1115/1115 transitions.
Graph (trivial) has 194 edges and 394 vertex of which 30 / 394 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 374 transition count 1059
Reduce places removed 23 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 31 rules applied. Total rules applied 55 place count 351 transition count 1051
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 63 place count 343 transition count 1051
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 63 place count 343 transition count 1034
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 97 place count 326 transition count 1034
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 106 place count 317 transition count 1020
Iterating global reduction 3 with 9 rules applied. Total rules applied 115 place count 317 transition count 1020
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 167 place count 291 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 291 transition count 991
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -109
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 206 place count 273 transition count 1100
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 232 place count 273 transition count 1074
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 5 with 78 rules applied. Total rules applied 310 place count 273 transition count 996
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 272 transition count 995
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 321 place count 272 transition count 986
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 330 place count 263 transition count 986
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 333 place count 263 transition count 986
Applied a total of 333 rules in 163 ms. Remains 263 /394 variables (removed 131) and now considering 986/1115 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 263/394 places, 986/1115 transitions.
RANDOM walk for 40000 steps (852 resets) in 445 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (70 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (93 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (175 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 546488 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 4
Probabilistic random walk after 546488 steps, saw 99025 distinct states, run finished after 3004 ms. (steps per millisecond=181 ) properties seen :0
[2024-06-01 02:23:51] [INFO ] Flow matrix only has 933 transitions (discarded 53 similar events)
// Phase 1: matrix 933 rows 263 cols
[2024-06-01 02:23:51] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 02:23:51] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 84/202 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 921/1123 variables, 202/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1123 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1123 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 73/1196 variables, 61/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1196 variables, 11/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1196 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1196 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 327 constraints, problems are : Problem set: 0 solved, 4 unsolved in 771 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 84/202 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 921/1123 variables, 202/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1123 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1123 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 73/1196 variables, 61/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1196 variables, 11/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1196 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1196 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1196 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3662 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4642ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 876 ms.
Support contains 118 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 986/986 transitions.
Applied a total of 0 rules in 18 ms. Remains 263 /263 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 263/263 places, 986/986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 986/986 transitions.
Applied a total of 0 rules in 17 ms. Remains 263 /263 variables (removed 0) and now considering 986/986 (removed 0) transitions.
[2024-06-01 02:23:57] [INFO ] Flow matrix only has 933 transitions (discarded 53 similar events)
[2024-06-01 02:23:57] [INFO ] Invariant cache hit.
[2024-06-01 02:23:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 02:23:57] [INFO ] Flow matrix only has 933 transitions (discarded 53 similar events)
[2024-06-01 02:23:57] [INFO ] Invariant cache hit.
[2024-06-01 02:23:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 02:23:57] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-06-01 02:23:58] [INFO ] Redundant transitions in 186 ms returned []
Running 985 sub problems to find dead transitions.
[2024-06-01 02:23:58] [INFO ] Flow matrix only has 933 transitions (discarded 53 similar events)
[2024-06-01 02:23:58] [INFO ] Invariant cache hit.
[2024-06-01 02:23:58] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 2 (OVERLAPS) 933/1195 variables, 262/276 constraints. Problems are: Problem set: 0 solved, 985 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1195 variables, 50/326 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1195 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 985 unsolved
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 TDEAD105 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 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
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/1196 variables, 1/327 constraints. Problems are: Problem set: 255 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 327 constraints, problems are : Problem set: 255 solved, 730 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 985/985 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 6/6 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/6 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 2 (OVERLAPS) 8/262 variables, 8/14 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/14 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 4 (OVERLAPS) 933/1195 variables, 262/276 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1195 variables, 50/326 constraints. Problems are: Problem set: 255 solved, 730 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1195 variables, 730/1056 constraints. Problems are: Problem set: 255 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1196 variables, and 1056 constraints, problems are : Problem set: 255 solved, 730 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 262/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 730/985 constraints, Known Traps: 0/0 constraints]
After SMT, in 63930ms problems are : Problem set: 255 solved, 730 unsolved
Search for dead transitions found 255 dead transitions in 63942ms
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 : 263/263 places, 731/986 transitions.
Applied a total of 0 rules in 15 ms. Remains 263 /263 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-06-01 02:25:02] [INFO ] Redundant transitions in 357 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65002 ms. Remains : 263/263 places, 731/986 transitions.
RANDOM walk for 40000 steps (847 resets) in 360 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (66 resets) in 443 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (91 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (177 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 459679 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 4
Probabilistic random walk after 459679 steps, saw 93228 distinct states, run finished after 3004 ms. (steps per millisecond=153 ) properties seen :0
[2024-06-01 02:25:05] [INFO ] Flow matrix only has 678 transitions (discarded 53 similar events)
// Phase 1: matrix 678 rows 263 cols
[2024-06-01 02:25:05] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 02:25:05] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/202 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 666/868 variables, 202/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 39/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 73/941 variables, 61/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 11/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/941 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 941/941 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 598 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/202 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 666/868 variables, 202/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 39/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 73/941 variables, 61/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 11/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/941 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/941 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 941/941 variables, and 339 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1729 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2448ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 790 ms.
Support contains 118 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 731/731 transitions.
Applied a total of 0 rules in 14 ms. Remains 263 /263 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 263/263 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 731/731 transitions.
Applied a total of 0 rules in 13 ms. Remains 263 /263 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-06-01 02:25:09] [INFO ] Flow matrix only has 678 transitions (discarded 53 similar events)
[2024-06-01 02:25:09] [INFO ] Invariant cache hit.
[2024-06-01 02:25:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 02:25:09] [INFO ] Flow matrix only has 678 transitions (discarded 53 similar events)
[2024-06-01 02:25:09] [INFO ] Invariant cache hit.
[2024-06-01 02:25:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 02:25:09] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-06-01 02:25:09] [INFO ] Redundant transitions in 114 ms returned []
Running 730 sub problems to find dead transitions.
[2024-06-01 02:25:09] [INFO ] Flow matrix only has 678 transitions (discarded 53 similar events)
[2024-06-01 02:25:09] [INFO ] Invariant cache hit.
[2024-06-01 02:25:09] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (OVERLAPS) 8/262 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (OVERLAPS) 678/940 variables, 262/284 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/940 variables, 50/334 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 730 unsolved
SMT process timed out in 32015ms, After SMT, problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 32021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32542 ms. Remains : 263/263 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 263 transition count 678
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 262 transition count 689
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 262 transition count 687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 260 transition count 687
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 260 transition count 687
Applied a total of 60 rules in 50 ms. Remains 260 /263 variables (removed 3) and now considering 687/731 (removed 44) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 687 rows 260 cols
[2024-06-01 02:25:41] [INFO ] Computed 22 invariants in 9 ms
[2024-06-01 02:25:42] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 02:25:42] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 8 ms returned sat
[2024-06-01 02:25:43] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 02:25:43] [INFO ] After 1392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 02:25:44] [INFO ] After 2124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2608 ms.
[2024-06-01 02:25:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 02:25:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 731 transitions and 4480 arcs took 9 ms.
[2024-06-01 02:25:44] [INFO ] Flatten gal took : 114 ms
Total runtime 142495 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityFireability-2024-03
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityFireability-2024-08
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityFireability-2024-09
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityFireability-2024-11

BK_STOP 1717208745114

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CloudDeployment-PT-4b-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/585/inv_0_
rfs formula name CloudDeployment-PT-4b-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/585/inv_1_
rfs formula name CloudDeployment-PT-4b-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/585/inv_2_
rfs formula name CloudDeployment-PT-4b-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/585/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r476-tall-171620506200583"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;