About the Execution of GreatSPN+red for CloudDeployment-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11209.264 | 826834.00 | 2146735.00 | 1815.20 | TTTFTTTT??F?FTTT | normal |
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.r069-tall-171620504800583.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 greatspnxred
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 r069-tall-171620504800583
=====================================================================
--------------------
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 1716467241133
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:27:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 12:27:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:27:22] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-23 12:27:22] [INFO ] Transformed 1182 places.
[2024-05-23 12:27:22] [INFO ] Transformed 1824 transitions.
[2024-05-23 12:27:22] [INFO ] Found NUPN structural information;
[2024-05-23 12:27:22] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (302 resets) in 1615 ms. (24 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 (56 resets) in 1175 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (53 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (37 resets) in 1502 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (50 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (39 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (60 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (44 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (45 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (44 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
// Phase 1: matrix 1824 rows 1182 cols
[2024-05-23 12:27:24] [INFO ] Computed 17 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 940/1181 variables, 16/258 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 940/1198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 13 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, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3006 variables, 1/2381 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 2381 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5060 ms.
Refiners :[Domain max(s): 1182/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1182/1182 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 951/1181 variables, 16/247 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 951/1198 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 12/2391 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3005/3006 variables, and 2391 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5013 ms.
Refiners :[Domain max(s): 1181/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1181/1182 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 11050ms problems are : Problem set: 1 solved, 12 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 773 edges and 1182 vertex of which 83 / 1182 are part of one of the 12 SCC in 7 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Graph (complete) has 2638 edges and 1111 vertex of which 1105 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 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 1105 transition count 1439
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 302 rules applied. Total rules applied 601 place count 808 transition count 1434
Reduce places removed 2 places and 0 transitions.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Iterating post reduction 2 with 85 rules applied. Total rules applied 686 place count 806 transition count 1351
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 773 place count 723 transition count 1347
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 773 place count 723 transition count 1301
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 865 place count 677 transition count 1301
Discarding 137 places :
Symmetric choice reduction at 4 with 137 rule applications. Total rules 1002 place count 540 transition count 1164
Iterating global reduction 4 with 137 rules applied. Total rules applied 1139 place count 540 transition count 1164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1144 place count 540 transition count 1159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1144 place count 540 transition count 1158
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1146 place count 539 transition count 1158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1147 place count 538 transition count 1157
Iterating global reduction 5 with 1 rules applied. Total rules applied 1148 place count 538 transition count 1157
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 1266 place count 479 transition count 1098
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1316 place count 454 transition count 1184
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 1334 place count 454 transition count 1166
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 1338 place count 452 transition count 1184
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 1340 place count 452 transition count 1182
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 1365 place count 452 transition count 1157
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1390 place count 427 transition count 1157
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 1397 place count 427 transition count 1150
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1399 place count 427 transition count 1148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1401 place count 425 transition count 1148
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 1418 place count 425 transition count 1148
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1421 place count 425 transition count 1145
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 1423 place count 425 transition count 1145
Applied a total of 1423 rules in 461 ms. Remains 425 /1182 variables (removed 757) and now considering 1145/1824 (removed 679) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 425/1182 places, 1145/1824 transitions.
RANDOM walk for 40000 steps (579 resets) in 781 ms. (51 steps per ms) remains 10/12 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (115 resets) in 242 ms. (164 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (118 resets) in 276 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (112 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (140 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (81 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
[2024-05-23 12:27:36] [INFO ] Flow matrix only has 1140 transitions (discarded 5 similar events)
// Phase 1: matrix 1140 rows 425 cols
[2024-05-23 12:27:36] [INFO ] Computed 13 invariants in 10 ms
[2024-05-23 12:27:36] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 77/276 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1094/1370 variables, 276/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1370 variables, 29/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 189/1559 variables, 143/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1559 variables, 9/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1559 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 6/1565 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1565 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/1565 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1565/1565 variables, and 476 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2792 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 425/425 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 77/276 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1094/1370 variables, 276/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1370 variables, 29/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1370 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 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) 189/1559 variables, 143/462 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1559 variables, 9/471 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1559 variables, 6/477 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1559 variables, 0/477 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/1565 variables, 6/483 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1565 variables, 0/483 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1565 variables, 0/483 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1565/1565 variables, and 483 constraints, problems are : Problem set: 3 solved, 7 unsolved in 10267 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 425/425 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 13651ms problems are : Problem set: 3 solved, 7 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1857 ms.
Support contains 135 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1145/1145 transitions.
Graph (trivial) has 181 edges and 425 vertex of which 8 / 425 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 421 transition count 1108
Reduce places removed 28 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 40 rules applied. Total rules applied 69 place count 393 transition count 1096
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 81 place count 381 transition count 1096
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 81 place count 381 transition count 1079
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 115 place count 364 transition count 1079
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 131 place count 348 transition count 1058
Iterating global reduction 3 with 16 rules applied. Total rules applied 147 place count 348 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 348 transition count 1057
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 204 place count 320 transition count 1029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 206 place count 320 transition count 1027
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 236 place count 305 transition count 1091
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 239 place count 305 transition count 1088
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 6 with 47 rules applied. Total rules applied 286 place count 305 transition count 1041
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 6 with 2 rules applied. Total rules applied 288 place count 304 transition count 1040
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 296 place count 304 transition count 1032
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 306 place count 296 transition count 1030
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 307 place count 296 transition count 1029
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 308 place count 296 transition count 1029
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 309 place count 295 transition count 1029
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 313 place count 295 transition count 1029
Applied a total of 313 rules in 187 ms. Remains 295 /425 variables (removed 130) and now considering 1029/1145 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 295/425 places, 1029/1145 transitions.
RANDOM walk for 40000 steps (827 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (69 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (171 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 487530 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 6
Probabilistic random walk after 487530 steps, saw 96329 distinct states, run finished after 3004 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 12:27:55] [INFO ] Flow matrix only has 1001 transitions (discarded 28 similar events)
// Phase 1: matrix 1001 rows 295 cols
[2024-05-23 12:27:55] [INFO ] Computed 14 invariants in 7 ms
[2024-05-23 12:27:55] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 86/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 988/1209 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 35/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1209 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 87/1296 variables, 74/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1296 variables, 15/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1296 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1296/1296 variables, and 359 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1185 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 295/295 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 86/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 988/1209 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 35/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1209 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 87/1296 variables, 74/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1296 variables, 15/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1296/1296 variables, and 365 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7407 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 295/295 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 8903ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1404 ms.
Support contains 134 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 1029/1029 transitions.
Graph (trivial) has 20 edges and 295 vertex of which 2 / 295 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 293 transition count 1031
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 9 place count 293 transition count 1025
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 293 transition count 1024
Applied a total of 10 rules in 48 ms. Remains 293 /295 variables (removed 2) and now considering 1024/1029 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 293/295 places, 1024/1029 transitions.
RANDOM walk for 40000 steps (830 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 355 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (64 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (95 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (167 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 175 ms. (227 steps per ms) remains 4/5 properties
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 12:28:06] [INFO ] Flow matrix only has 992 transitions (discarded 32 similar events)
// Phase 1: matrix 992 rows 293 cols
[2024-05-23 12:28:06] [INFO ] Computed 14 invariants in 6 ms
[2024-05-23 12:28:06] [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) 88/206 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 942/1148 variables, 206/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1148 variables, 33/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/1269 variables, 78/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1269 variables, 17/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1269 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/1285 variables, 9/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1285/1285 variables, and 357 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 293/293 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) 88/206 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 942/1148 variables, 206/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1148 variables, 33/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/1269 variables, 78/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1269 variables, 17/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1269 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1269 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 16/1285 variables, 9/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1285 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1285 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1285/1285 variables, and 361 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6832 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 293/293 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8101ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 812 ms.
Support contains 118 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 1024/1024 transitions.
Graph (trivial) has 57 edges and 293 vertex of which 11 / 293 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 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 0 with 3 rules applied. Total rules applied 4 place count 287 transition count 1010
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 284 transition count 1008
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 282 transition count 1008
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 11 place count 282 transition count 1004
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 278 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 276 transition count 1001
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 276 transition count 1001
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 271 transition count 996
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 39 place count 268 transition count 1020
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 50 place count 268 transition count 1009
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 78 place count 268 transition count 981
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 83 place count 268 transition count 976
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 88 place count 263 transition count 976
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 263 transition count 975
Applied a total of 89 rules in 107 ms. Remains 263 /293 variables (removed 30) and now considering 975/1024 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 263/293 places, 975/1024 transitions.
RANDOM walk for 40000 steps (847 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (170 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 678101 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 4
Probabilistic random walk after 678101 steps, saw 98113 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-23 12:28:19] [INFO ] Flow matrix only has 922 transitions (discarded 53 similar events)
// Phase 1: matrix 922 rows 263 cols
[2024-05-23 12:28:19] [INFO ] Computed 14 invariants in 8 ms
[2024-05-23 12:28:19] [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) 909/1111 variables, 202/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1111 variables, 35/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1111 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 74/1185 variables, 61/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1185 variables, 15/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1185 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 327 constraints, problems are : Problem set: 0 solved, 4 unsolved in 833 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) 909/1111 variables, 202/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1111 variables, 35/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1111 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 74/1185 variables, 61/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1185 variables, 15/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1185 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1185/1185 variables, and 331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4155 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 5181ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 976 ms.
Support contains 118 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 975/975 transitions.
Applied a total of 0 rules in 14 ms. Remains 263 /263 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 263/263 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 975/975 transitions.
Applied a total of 0 rules in 14 ms. Remains 263 /263 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2024-05-23 12:28:25] [INFO ] Flow matrix only has 922 transitions (discarded 53 similar events)
[2024-05-23 12:28:25] [INFO ] Invariant cache hit.
[2024-05-23 12:28:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-23 12:28:25] [INFO ] Flow matrix only has 922 transitions (discarded 53 similar events)
[2024-05-23 12:28:25] [INFO ] Invariant cache hit.
[2024-05-23 12:28:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-23 12:28:25] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-23 12:28:25] [INFO ] Redundant transitions in 226 ms returned []
Running 974 sub problems to find dead transitions.
[2024-05-23 12:28:25] [INFO ] Flow matrix only has 922 transitions (discarded 53 similar events)
[2024-05-23 12:28:25] [INFO ] Invariant cache hit.
[2024-05-23 12:28:25] [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, 974 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 2 (OVERLAPS) 922/1184 variables, 262/276 constraints. Problems are: Problem set: 0 solved, 974 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1184 variables, 50/326 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1184 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 974 unsolved
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 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 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
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
At refinement iteration 5 (OVERLAPS) 1/1185 variables, 1/327 constraints. Problems are: Problem set: 255 solved, 719 unsolved
(s69 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 1.0 4.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 (/ 3.0 4.0))
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 327 constraints, problems are : Problem set: 255 solved, 719 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 263/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 6/6 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/6 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 8/262 variables, 8/14 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/14 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 4 (OVERLAPS) 922/1184 variables, 262/276 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 50/326 constraints. Problems are: Problem set: 255 solved, 719 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1184 variables, 719/1045 constraints. Problems are: Problem set: 255 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1185 variables, and 1045 constraints, problems are : Problem set: 255 solved, 719 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 262/263 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 719/974 constraints, Known Traps: 0/0 constraints]
After SMT, in 63810ms problems are : Problem set: 255 solved, 719 unsolved
Search for dead transitions found 255 dead transitions in 63821ms
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, 720/975 transitions.
Applied a total of 0 rules in 13 ms. Remains 263 /263 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2024-05-23 12:29:30] [INFO ] Redundant transitions in 383 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64946 ms. Remains : 263/263 places, 720/975 transitions.
RANDOM walk for 40000 steps (858 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (65 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (70 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (173 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 708357 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 4
Probabilistic random walk after 708357 steps, saw 101464 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
[2024-05-23 12:29:33] [INFO ] Flow matrix only has 667 transitions (discarded 53 similar events)
// Phase 1: matrix 667 rows 263 cols
[2024-05-23 12:29:33] [INFO ] Computed 22 invariants in 9 ms
[2024-05-23 12:29:33] [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) 654/856 variables, 202/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 35/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 74/930 variables, 61/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/930 variables, 15/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/930 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 569 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) 654/856 variables, 202/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 35/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 74/930 variables, 61/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/930 variables, 15/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/930 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 339 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1710 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 2385ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 915 ms.
Support contains 118 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 720/720 transitions.
Applied a total of 0 rules in 12 ms. Remains 263 /263 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 263/263 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 720/720 transitions.
Applied a total of 0 rules in 13 ms. Remains 263 /263 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2024-05-23 12:29:36] [INFO ] Flow matrix only has 667 transitions (discarded 53 similar events)
[2024-05-23 12:29:36] [INFO ] Invariant cache hit.
[2024-05-23 12:29:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 12:29:37] [INFO ] Flow matrix only has 667 transitions (discarded 53 similar events)
[2024-05-23 12:29:37] [INFO ] Invariant cache hit.
[2024-05-23 12:29:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-23 12:29:37] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-23 12:29:37] [INFO ] Redundant transitions in 142 ms returned []
Running 719 sub problems to find dead transitions.
[2024-05-23 12:29:37] [INFO ] Flow matrix only has 667 transitions (discarded 53 similar events)
[2024-05-23 12:29:37] [INFO ] Invariant cache hit.
[2024-05-23 12:29:37] [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, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 8/262 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (OVERLAPS) 667/929 variables, 262/284 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 50/334 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 719 unsolved
SMT process timed out in 31768ms, After SMT, problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 31775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32319 ms. Remains : 263/263 places, 720/720 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 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 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 678
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 262 transition count 675
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 259 transition count 675
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 62 place count 259 transition count 675
Applied a total of 62 rules in 53 ms. Remains 259 /263 variables (removed 4) and now considering 675/720 (removed 45) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 675 rows 259 cols
[2024-05-23 12:30:09] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 12:30:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 12:30:09] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 6 ms returned sat
[2024-05-23 12:30:10] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 12:30:10] [INFO ] After 1372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 12:30:11] [INFO ] After 2061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2267 ms.
[2024-05-23 12:30:11] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-23 12:30:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 720 transitions and 4394 arcs took 9 ms.
[2024-05-23 12:30:11] [INFO ] Flatten gal took : 152 ms
Total runtime 169598 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudDeployment-PT-4b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 263
TRANSITIONS: 720
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 633
MODEL NAME: /home/mcc/execution/405/model
263 places, 720 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-08 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716468067967
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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="greatspnxred"
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 greatspnxred"
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 r069-tall-171620504800583"
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 '
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 ;