About the Execution of LTSMin+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 |
| 1580.819 | 143197.00 | 185241.00 | 413.70 | TFTFTFFTTFTTT?T? | 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.r476-tall-171620506200582.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200582
=====================================================================
--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-01
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-02
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-03
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-04
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-05
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-06
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-07
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-08
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-09
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-10
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-11
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-12
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-13
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-14
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717208575213
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:22:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:22:56] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-01 02:22:56] [INFO ] Transformed 1182 places.
[2024-06-01 02:22:56] [INFO ] Transformed 1824 transitions.
[2024-06-01 02:22:56] [INFO ] Found NUPN structural information;
[2024-06-01 02:22:56] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (308 resets) in 1281 ms. (31 steps per ms) remains 7/13 properties
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (41 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (42 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 316 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (43 resets) in 825 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (42 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
// Phase 1: matrix 1824 rows 1182 cols
[2024-06-01 02:22:57] [INFO ] Computed 17 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1025/1180 variables, 16/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1180 variables, 1025/1196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1180 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/1181 variables, 1/1197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3005 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CloudDeployment-PT-4b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1/3006 variables, 1/2380 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3006 variables, 1/2381 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3006 variables, 0/2381 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/3006 variables, 0/2381 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 2381 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3268 ms.
Refiners :[Domain max(s): 1182/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1182/1182 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1063/1180 variables, 16/133 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1180 variables, 1063/1196 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1180 variables, 0/1196 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/1181 variables, 1/1197 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 1/1198 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 0/1198 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1824/3005 variables, 1181/2379 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3005 variables, 6/2385 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3005 variables, 0/2385 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/3006 variables, 1/2386 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3006 variables, 1/2387 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3006/3006 variables, and 2387 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5027 ms.
Refiners :[Domain max(s): 1182/1182 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1182/1182 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 8523ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 938 edges and 1182 vertex of which 158 / 1182 are part of one of the 21 SCC in 8 ms
Free SCC test removed 137 places
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 2557 edges and 1045 vertex of which 1039 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 351 rules applied. Total rules applied 353 place count 1038 transition count 1304
Reduce places removed 347 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 354 rules applied. Total rules applied 707 place count 691 transition count 1297
Reduce places removed 2 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 2 with 67 rules applied. Total rules applied 774 place count 689 transition count 1232
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 840 place count 624 transition count 1231
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 840 place count 624 transition count 1184
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 934 place count 577 transition count 1184
Discarding 160 places :
Symmetric choice reduction at 4 with 160 rule applications. Total rules 1094 place count 417 transition count 777
Iterating global reduction 4 with 160 rules applied. Total rules applied 1254 place count 417 transition count 777
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 1264 place count 417 transition count 767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1266 place count 415 transition count 767
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1266 place count 415 transition count 764
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1272 place count 412 transition count 764
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1274 place count 410 transition count 762
Iterating global reduction 6 with 2 rules applied. Total rules applied 1276 place count 410 transition count 762
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1277 place count 409 transition count 761
Iterating global reduction 6 with 1 rules applied. Total rules applied 1278 place count 409 transition count 761
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1390 place count 353 transition count 705
Performed 32 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1454 place count 321 transition count 840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1455 place count 321 transition count 839
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 7 with 53 rules applied. Total rules applied 1508 place count 321 transition count 786
Free-agglomeration rule applied 34 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1542 place count 321 transition count 751
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1582 place count 287 transition count 745
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1608 place count 287 transition count 719
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 1628 place count 287 transition count 719
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1632 place count 287 transition count 715
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1633 place count 286 transition count 714
Applied a total of 1633 rules in 459 ms. Remains 286 /1182 variables (removed 896) and now considering 714/1824 (removed 1110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 286/1182 places, 714/1824 transitions.
RANDOM walk for 40000 steps (856 resets) in 714 ms. (55 steps per ms) remains 5/6 properties
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (122 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (124 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (125 resets) in 81 ms. (487 steps per ms) remains 4/5 properties
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (124 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
[2024-06-01 02:23:07] [INFO ] Flow matrix only has 630 transitions (discarded 84 similar events)
// Phase 1: matrix 630 rows 286 cols
[2024-06-01 02:23:07] [INFO ] Computed 16 invariants in 6 ms
[2024-06-01 02:23:07] [INFO ] State equation strengthened by 233 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 209/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/286 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 630/916 variables, 286/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 233/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/916 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 916/916 variables, and 535 constraints, problems are : Problem set: 0 solved, 4 unsolved in 432 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 286/286 constraints, ReadFeed: 233/233 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 209/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/286 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 630/916 variables, 286/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 233/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/916 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 916/916 variables, and 539 constraints, problems are : Problem set: 0 solved, 4 unsolved in 990 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 286/286 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1467ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 940 ms.
Support contains 55 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 714/714 transitions.
Graph (trivial) has 151 edges and 286 vertex of which 17 / 286 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 276 transition count 678
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 258 transition count 674
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 254 transition count 674
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 45 place count 254 transition count 666
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 246 transition count 666
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 72 place count 235 transition count 653
Iterating global reduction 3 with 11 rules applied. Total rules applied 83 place count 235 transition count 653
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 235 transition count 650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 235 transition count 649
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 234 transition count 649
Performed 25 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 138 place count 209 transition count 616
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 147 place count 209 transition count 607
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 161 place count 202 transition count 651
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 174 place count 202 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 236 place count 202 transition count 576
Free-agglomeration rule applied 11 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 247 place count 202 transition count 564
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 267 place count 191 transition count 555
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 284 place count 191 transition count 538
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 295 place count 191 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 297 place count 191 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 298 place count 190 transition count 535
Applied a total of 298 rules in 167 ms. Remains 190 /286 variables (removed 96) and now considering 535/714 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 190/286 places, 535/714 transitions.
RANDOM walk for 40000 steps (8 resets) in 412 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 724238 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 3
Probabilistic random walk after 724238 steps, saw 93974 distinct states, run finished after 3008 ms. (steps per millisecond=240 ) properties seen :0
[2024-06-01 02:23:12] [INFO ] Flow matrix only has 410 transitions (discarded 125 similar events)
// Phase 1: matrix 410 rows 190 cols
[2024-06-01 02:23:12] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 02:23:13] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 127/182 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 410/600 variables, 190/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 148/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/600 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 354 constraints, problems are : Problem set: 0 solved, 3 unsolved in 262 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 127/182 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 410/600 variables, 190/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 148/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/600 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 607 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 904ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA CloudDeployment-PT-4b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 342 ms.
Support contains 54 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 535/535 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 534
Applied a total of 2 rules in 17 ms. Remains 189 /190 variables (removed 1) and now considering 534/535 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 189/190 places, 534/535 transitions.
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 911861 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 2
Probabilistic random walk after 911861 steps, saw 116816 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
[2024-06-01 02:23:17] [INFO ] Flow matrix only has 405 transitions (discarded 129 similar events)
// Phase 1: matrix 405 rows 189 cols
[2024-06-01 02:23:17] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 02:23:17] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/181 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/189 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 405/594 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 148/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/181 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/189 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 405/594 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 148/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/594 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 518 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 797ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 54 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 534/534 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 534/534 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-01 02:23:18] [INFO ] Flow matrix only has 405 transitions (discarded 129 similar events)
[2024-06-01 02:23:18] [INFO ] Invariant cache hit.
[2024-06-01 02:23:18] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 02:23:18] [INFO ] Flow matrix only has 405 transitions (discarded 129 similar events)
[2024-06-01 02:23:18] [INFO ] Invariant cache hit.
[2024-06-01 02:23:18] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-06-01 02:23:18] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-06-01 02:23:18] [INFO ] Redundant transitions in 73 ms returned []
Running 530 sub problems to find dead transitions.
[2024-06-01 02:23:19] [INFO ] Flow matrix only has 405 transitions (discarded 129 similar events)
[2024-06-01 02:23:19] [INFO ] Invariant cache hit.
[2024-06-01 02:23:19] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 4/189 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD528 is UNSAT
At refinement iteration 4 (OVERLAPS) 405/594 variables, 189/205 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 148/353 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/353 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 0/594 variables, 0/353 constraints. Problems are: Problem set: 6 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 353 constraints, problems are : Problem set: 6 solved, 524 unsolved in 24713 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 4/189 variables, 13/16 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 405/594 variables, 189/205 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 148/353 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 524/877 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/877 constraints. Problems are: Problem set: 6 solved, 524 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/877 constraints. Problems are: Problem set: 6 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 877 constraints, problems are : Problem set: 6 solved, 524 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 524/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 55786ms problems are : Problem set: 6 solved, 524 unsolved
Search for dead transitions found 6 dead transitions in 55794ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/189 places, 528/534 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 183 transition count 528
Applied a total of 6 rules in 12 ms. Remains 183 /189 variables (removed 6) and now considering 528/528 (removed 0) transitions.
[2024-06-01 02:24:14] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
// Phase 1: matrix 399 rows 183 cols
[2024-06-01 02:24:14] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 02:24:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 02:24:14] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:14] [INFO ] Invariant cache hit.
[2024-06-01 02:24:15] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-06-01 02:24:15] [INFO ] Implicit Places using invariants and state equation in 429 ms returned [71, 112]
[2024-06-01 02:24:15] [INFO ] Actually due to overlaps returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 528 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 182/189 places, 528/534 transitions.
Applied a total of 0 rules in 12 ms. Remains 182 /182 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56940 ms. Remains : 182/189 places, 528/534 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1030969 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 2
Probabilistic random walk after 1030969 steps, saw 139541 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-01 02:24:18] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
// Phase 1: matrix 399 rows 182 cols
[2024-06-01 02:24:18] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 02:24:18] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/174 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/180 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 398/578 variables, 180/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 148/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/581 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/581 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 182/182 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/174 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/180 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 398/578 variables, 180/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 148/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/581 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 498 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 182/182 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 54 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 182 /182 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 182/182 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 528/528 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-06-01 02:24:19] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:19] [INFO ] Invariant cache hit.
[2024-06-01 02:24:19] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 02:24:19] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:19] [INFO ] Invariant cache hit.
[2024-06-01 02:24:19] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-06-01 02:24:19] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 359 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 181/182 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 181 /181 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 380 ms. Remains : 181/182 places, 528/528 transitions.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1042533 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 2
Probabilistic random walk after 1042533 steps, saw 141651 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-06-01 02:24:23] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
// Phase 1: matrix 399 rows 181 cols
[2024-06-01 02:24:23] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 02:24:23] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/175 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/568 variables, 175/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 145/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/580 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/580 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 343 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/175 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/568 variables, 175/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 145/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/580 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/580 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 54 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-06-01 02:24:23] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:23] [INFO ] Invariant cache hit.
[2024-06-01 02:24:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 02:24:24] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:24] [INFO ] Invariant cache hit.
[2024-06-01 02:24:24] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-06-01 02:24:24] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-01 02:24:24] [INFO ] Redundant transitions in 175 ms returned []
Running 524 sub problems to find dead transitions.
[2024-06-01 02:24:24] [INFO ] Flow matrix only has 399 transitions (discarded 129 similar events)
[2024-06-01 02:24:24] [INFO ] Invariant cache hit.
[2024-06-01 02:24:24] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 4/181 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 399/580 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 148/343 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 0/580 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 343 constraints, problems are : Problem set: 0 solved, 524 unsolved in 21913 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 4/181 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 399/580 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 148/343 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 524/867 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (OVERLAPS) 0/580 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 867 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 52793ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 52798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53352 ms. Remains : 181/181 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 75 edges and 181 vertex of which 3 / 181 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 132 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 178 transition count 387
Reduce places removed 9 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 169 transition count 381
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 163 transition count 381
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 163 transition count 378
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 38 place count 160 transition count 378
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 155 transition count 373
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 155 transition count 373
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 152 transition count 358
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 152 transition count 358
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 147 place count 152 transition count 265
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 4 with 10 rules applied. Total rules applied 157 place count 147 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 161 place count 147 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 170 place count 147 transition count 247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 172 place count 146 transition count 247
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 173 place count 146 transition count 246
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 146 transition count 243
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 179 place count 143 transition count 243
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 143 transition count 243
Applied a total of 180 rules in 29 ms. Remains 143 /181 variables (removed 38) and now considering 243/528 (removed 285) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 243 rows 143 cols
[2024-06-01 02:25:17] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 02:25:17] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 02:25:17] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2024-06-01 02:25:17] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 02:25:17] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 02:25:17] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 477 ms.
[2024-06-01 02:25:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 02:25:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 528 transitions and 3409 arcs took 21 ms.
[2024-06-01 02:25:18] [INFO ] Flatten gal took : 126 ms
Total runtime 141830 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityCardinality-2024-13
Could not compute solution for formula : CloudDeployment-PT-4b-ReachabilityCardinality-2024-15
BK_STOP 1717208718410
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CloudDeployment-PT-4b-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/613/inv_0_
rfs formula name CloudDeployment-PT-4b-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/613/inv_1_
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171620506200582"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;