About the Execution of GreatSPN+red for CloudDeployment-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2300.943 | 907115.00 | 1055995.00 | 2637.60 | FFFFFFTTFTFFTFFF | 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-171620504900603.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-6a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504900603
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:36 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 317K 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-6a-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-6a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716470338037
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:18:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 13:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:18:59] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-23 13:18:59] [INFO ] Transformed 221 places.
[2024-05-23 13:18:59] [INFO ] Transformed 908 transitions.
[2024-05-23 13:18:59] [INFO ] Found NUPN structural information;
[2024-05-23 13:18:59] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
FORMULA CloudDeployment-PT-6a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 794/794 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 210 transition count 794
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 207 transition count 791
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 207 transition count 791
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 1 with 75 rules applied. Total rules applied 92 place count 207 transition count 716
Applied a total of 92 rules in 124 ms. Remains 207 /221 variables (removed 14) and now considering 716/794 (removed 78) transitions.
[2024-05-23 13:18:59] [INFO ] Flow matrix only has 381 transitions (discarded 335 similar events)
// Phase 1: matrix 381 rows 207 cols
[2024-05-23 13:18:59] [INFO ] Computed 25 invariants in 20 ms
[2024-05-23 13:19:00] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 13:19:00] [INFO ] Flow matrix only has 381 transitions (discarded 335 similar events)
[2024-05-23 13:19:00] [INFO ] Invariant cache hit.
[2024-05-23 13:19:00] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-23 13:19:00] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-05-23 13:19:00] [INFO ] Flow matrix only has 381 transitions (discarded 335 similar events)
[2024-05-23 13:19:00] [INFO ] Invariant cache hit.
[2024-05-23 13:19:00] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 380/586 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 715 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 178/409 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 1/587 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/588 variables, and 410 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 178/179 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 380/586 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 178/409 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 715/1124 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (OVERLAPS) 1/587 variables, 1/1125 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 1125 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 178/179 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
After SMT, in 61418ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 61462ms
Starting structural reductions in LTL mode, iteration 1 : 207/221 places, 716/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62391 ms. Remains : 207/221 places, 716/794 transitions.
Support contains 29 out of 207 places after structural reductions.
[2024-05-23 13:20:02] [INFO ] Flatten gal took : 87 ms
[2024-05-23 13:20:02] [INFO ] Flatten gal took : 54 ms
[2024-05-23 13:20:02] [INFO ] Input system was already deterministic with 716 transitions.
Support contains 25 out of 207 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (446 resets) in 1720 ms. (23 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (46 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (54 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2024-05-23 13:20:03] [INFO ] Flow matrix only has 381 transitions (discarded 335 similar events)
[2024-05-23 13:20:03] [INFO ] Invariant cache hit.
[2024-05-23 13:20:03] [INFO ] State equation strengthened by 179 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/206 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 380/586 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 178/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/587 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/588 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/588 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 411 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 179/179 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/206 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 380/586 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 178/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/587 variables, 1/412 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/412 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/588 variables, 1/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/588 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 588/588 variables, and 413 constraints, problems are : Problem set: 1 solved, 1 unsolved in 258 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 716/716 transitions.
Graph (trivial) has 239 edges and 207 vertex of which 60 / 207 are part of one of the 18 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 132 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 174 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 542
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 155 transition count 497
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 155 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 153 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 153 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 152 transition count 494
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 152 transition count 494
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 151 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 151 transition count 493
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 64 place count 133 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 1 with 108 rules applied. Total rules applied 172 place count 133 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 178 place count 133 transition count 508
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 184 place count 127 transition count 508
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 185 place count 127 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 126 transition count 507
Applied a total of 186 rules in 146 ms. Remains 126 /207 variables (removed 81) and now considering 507/716 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 126/207 places, 507/716 transitions.
RANDOM walk for 40000 steps (616 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 992280 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 1
Probabilistic random walk after 992280 steps, saw 179859 distinct states, run finished after 3004 ms. (steps per millisecond=330 ) properties seen :0
[2024-05-23 13:20:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2024-05-23 13:20:07] [INFO ] Computed 24 invariants in 7 ms
[2024-05-23 13:20:07] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/126 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/381 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/381 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/126 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/381 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-05-23 13:20:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2024-05-23 13:20:07] [INFO ] Invariant cache hit.
[2024-05-23 13:20:07] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-23 13:20:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2024-05-23 13:20:07] [INFO ] Invariant cache hit.
[2024-05-23 13:20:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 13:20:07] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-23 13:20:07] [INFO ] Redundant transitions in 32 ms returned []
Running 471 sub problems to find dead transitions.
[2024-05-23 13:20:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2024-05-23 13:20:07] [INFO ] Invariant cache hit.
[2024-05-23 13:20:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 6/126 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 255/381 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (OVERLAPS) 0/381 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 158 constraints, problems are : Problem set: 0 solved, 471 unsolved in 14049 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 6/126 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 255/381 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 471/629 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 8 (OVERLAPS) 0/381 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 629 constraints, problems are : Problem set: 0 solved, 471 unsolved in 24452 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 39088ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 39093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39458 ms. Remains : 126/126 places, 507/507 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 102 edges and 126 vertex of which 38 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 295 transitions.
Ensure Unique test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 83 transition count 189
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 58 place count 60 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 58 place count 60 transition count 179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 78 place count 50 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 45 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 45 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 40 transition count 144
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 40 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 40 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 38 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 119 place count 38 transition count 125
Free-agglomeration rule applied 6 times with reduction of 52 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 125 place count 38 transition count 67
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 141 place count 32 transition count 57
Applied a total of 141 rules in 28 ms. Remains 32 /126 variables (removed 94) and now considering 57/507 (removed 450) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 57 rows 32 cols
[2024-05-23 13:20:46] [INFO ] Computed 13 invariants in 0 ms
[2024-05-23 13:20:46] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 13:20:46] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-23 13:20:46] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 13:20:46] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 13:20:46] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 204 ms.
FORMULA CloudDeployment-PT-6a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA CloudDeployment-PT-6a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 105 stabilizing places and 512 stable transitions
Graph (complete) has 2005 edges and 207 vertex of which 205 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 203 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 203 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 201 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 200 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 199 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 199 transition count 709
Applied a total of 15 rules in 15 ms. Remains 199 /207 variables (removed 8) and now considering 709/716 (removed 7) transitions.
[2024-05-23 13:20:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:20:47] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:20:47] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-23 13:20:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:47] [INFO ] Invariant cache hit.
[2024-05-23 13:20:47] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:20:47] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:20:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:47] [INFO ] Invariant cache hit.
[2024-05-23 13:20:47] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 30940ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 30949ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 709/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31423 ms. Remains : 199/207 places, 709/716 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 209 ms.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
RANDOM walk for 11352 steps (130 resets) in 56 ms. (199 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLCardinality-03 finished in 32313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Graph (trivial) has 236 edges and 207 vertex of which 59 / 207 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 156 transition count 548
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 156 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 155 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 155 transition count 547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 154 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 154 transition count 546
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 136 transition count 612
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 164 place count 136 transition count 505
Applied a total of 164 rules in 74 ms. Remains 136 /207 variables (removed 71) and now considering 505/716 (removed 211) transitions.
[2024-05-23 13:21:19] [INFO ] Flow matrix only has 205 transitions (discarded 300 similar events)
// Phase 1: matrix 205 rows 136 cols
[2024-05-23 13:21:19] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:21:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 13:21:19] [INFO ] Flow matrix only has 205 transitions (discarded 300 similar events)
[2024-05-23 13:21:19] [INFO ] Invariant cache hit.
[2024-05-23 13:21:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:21:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-23 13:21:20] [INFO ] Redundant transitions in 281 ms returned []
Running 462 sub problems to find dead transitions.
[2024-05-23 13:21:20] [INFO ] Flow matrix only has 205 transitions (discarded 300 similar events)
[2024-05-23 13:21:20] [INFO ] Invariant cache hit.
[2024-05-23 13:21:20] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 6/136 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 204/340 variables, 136/160 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/341 variables, and 167 constraints, problems are : Problem set: 0 solved, 462 unsolved in 12762 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 6/136 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 204/340 variables, 136/160 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 462/629 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/341 variables, and 629 constraints, problems are : Problem set: 0 solved, 462 unsolved in 22909 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints]
After SMT, in 36165ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 36169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/207 places, 505/716 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36762 ms. Remains : 136/207 places, 505/716 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLCardinality-04 finished in 36911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Graph (trivial) has 241 edges and 207 vertex of which 60 / 207 are part of one of the 18 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 154 transition count 544
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 154 transition count 544
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 152 transition count 542
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 152 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 151 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 151 transition count 541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 150 transition count 540
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 150 transition count 540
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 63 place count 132 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 171 place count 132 transition count 498
Applied a total of 171 rules in 64 ms. Remains 132 /207 variables (removed 75) and now considering 498/716 (removed 218) transitions.
[2024-05-23 13:21:56] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 132 cols
[2024-05-23 13:21:56] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:21:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 13:21:56] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:21:56] [INFO ] Invariant cache hit.
[2024-05-23 13:21:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:21:56] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-23 13:21:57] [INFO ] Redundant transitions in 314 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-23 13:21:57] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:21:57] [INFO ] Invariant cache hit.
[2024-05-23 13:21:57] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 163 constraints, problems are : Problem set: 0 solved, 455 unsolved in 12549 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 455/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 618 constraints, problems are : Problem set: 0 solved, 455 unsolved in 21795 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
After SMT, in 34866ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 34871ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/207 places, 498/716 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35502 ms. Remains : 132/207 places, 498/716 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Computed a total of 78 stabilizing places and 390 stable transitions
Graph (complete) has 1582 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 78 stabilizing places and 390 stable transitions
Detected a total of 78/132 stabilizing places and 390/498 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 12630 steps (211 resets) in 60 ms. (207 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 498/498 transitions.
Applied a total of 0 rules in 21 ms. Remains 132 /132 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-23 13:22:32] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:22:32] [INFO ] Invariant cache hit.
[2024-05-23 13:22:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 13:22:32] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:22:32] [INFO ] Invariant cache hit.
[2024-05-23 13:22:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:22:32] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-23 13:22:33] [INFO ] Redundant transitions in 310 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-23 13:22:33] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:22:33] [INFO ] Invariant cache hit.
[2024-05-23 13:22:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 163 constraints, problems are : Problem set: 0 solved, 455 unsolved in 12805 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 455/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 618 constraints, problems are : Problem set: 0 solved, 455 unsolved in 21616 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
After SMT, in 34809ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 34813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35401 ms. Remains : 132/132 places, 498/498 transitions.
Computed a total of 78 stabilizing places and 390 stable transitions
Graph (complete) has 1582 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 78 stabilizing places and 390 stable transitions
Detected a total of 78/132 stabilizing places and 390/498 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 11615 steps (190 resets) in 59 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 498/498 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-23 13:23:08] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:23:08] [INFO ] Invariant cache hit.
[2024-05-23 13:23:08] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-23 13:23:08] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:23:08] [INFO ] Invariant cache hit.
[2024-05-23 13:23:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:23:08] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-23 13:23:09] [INFO ] Redundant transitions in 294 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-23 13:23:09] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-23 13:23:09] [INFO ] Invariant cache hit.
[2024-05-23 13:23:09] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 163 constraints, problems are : Problem set: 0 solved, 455 unsolved in 12428 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 455/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 618 constraints, problems are : Problem set: 0 solved, 455 unsolved in 21812 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
After SMT, in 34695ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 34700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35306 ms. Remains : 132/132 places, 498/498 transitions.
Treatment of property CloudDeployment-PT-6a-LTLCardinality-05 finished in 107509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 203 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 203 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 201 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 200 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 199 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 199 transition count 709
Applied a total of 15 rules in 8 ms. Remains 199 /207 variables (removed 8) and now considering 709/716 (removed 7) transitions.
[2024-05-23 13:23:43] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:23:43] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:23:44] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-23 13:23:44] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:44] [INFO ] Invariant cache hit.
[2024-05-23 13:23:44] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:23:44] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:23:44] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:44] [INFO ] Invariant cache hit.
[2024-05-23 13:23:44] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 31077ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 31087ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 709/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31570 ms. Remains : 199/207 places, 709/716 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 1950 ms.
Product exploration explored 100000 steps with 50000 reset in 1923 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLCardinality-07 finished in 35567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 204 transition count 714
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 204 transition count 714
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 202 transition count 712
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 201 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 201 transition count 711
Applied a total of 11 rules in 13 ms. Remains 201 /207 variables (removed 6) and now considering 711/716 (removed 5) transitions.
[2024-05-23 13:24:19] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
// Phase 1: matrix 376 rows 201 cols
[2024-05-23 13:24:19] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:24:19] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-23 13:24:19] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:24:19] [INFO ] Invariant cache hit.
[2024-05-23 13:24:19] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-23 13:24:19] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-23 13:24:19] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:24:19] [INFO ] Invariant cache hit.
[2024-05-23 13:24:19] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 375/575 variables, 200/224 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 173/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (OVERLAPS) 1/576 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 710 unsolved
SMT process timed out in 30911ms, After SMT, problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 30917ms
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 711/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31366 ms. Remains : 201/207 places, 711/716 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 80 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 99 stabilizing places and 507 stable transitions
Graph (complete) has 1971 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 99 stabilizing places and 507 stable transitions
Detected a total of 99/201 stabilizing places and 507/711 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 25522 steps (289 resets) in 131 ms. (193 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 711/711 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-05-23 13:24:52] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:24:52] [INFO ] Invariant cache hit.
[2024-05-23 13:24:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 13:24:52] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:24:52] [INFO ] Invariant cache hit.
[2024-05-23 13:24:52] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-23 13:24:52] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-23 13:24:52] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:24:52] [INFO ] Invariant cache hit.
[2024-05-23 13:24:52] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 375/575 variables, 200/224 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 173/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (OVERLAPS) 1/576 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/577 variables, and 398 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 201/201 constraints, ReadFeed: 173/174 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 375/575 variables, 200/224 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 173/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 710/1107 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (OVERLAPS) 1/576 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/577 variables, and 1108 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 201/201 constraints, ReadFeed: 173/174 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
After SMT, in 61114ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 61121ms
Finished structural reductions in LTL mode , in 1 iterations and 61524 ms. Remains : 201/201 places, 711/711 transitions.
Computed a total of 99 stabilizing places and 507 stable transitions
Graph (complete) has 1971 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 99 stabilizing places and 507 stable transitions
Detected a total of 99/201 stabilizing places and 507/711 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 14228 steps (160 resets) in 53 ms. (263 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 1 reset in 85 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 711/711 transitions.
Graph (trivial) has 235 edges and 201 vertex of which 56 / 201 are part of one of the 17 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 157 transition count 563
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 157 transition count 563
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 29 place count 157 transition count 671
Deduced a syphon composed of 18 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 0 with 127 rules applied. Total rules applied 156 place count 157 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 157 place count 157 transition count 544
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 157 rules in 46 ms. Remains 157 /201 variables (removed 44) and now considering 544/711 (removed 167) transitions.
[2024-05-23 13:25:55] [INFO ] Redundant transitions in 326 ms returned []
Running 543 sub problems to find dead transitions.
[2024-05-23 13:25:55] [INFO ] Flow matrix only has 238 transitions (discarded 306 similar events)
// Phase 1: matrix 238 rows 157 cols
[2024-05-23 13:25:55] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:25:55] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 2 (OVERLAPS) 237/393 variables, 156/180 constraints. Problems are: Problem set: 25 solved, 518 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 137/317 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/317 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 1/394 variables, 1/318 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/318 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/319 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/319 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/319 constraints. Problems are: Problem set: 25 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 319 constraints, problems are : Problem set: 25 solved, 518 unsolved in 26915 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 18/18 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 19/156 variables, 6/24 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 237/393 variables, 156/180 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 137/317 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 518/835 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/835 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/836 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/836 constraints. Problems are: Problem set: 25 solved, 518 unsolved
At refinement iteration 10 (OVERLAPS) 1/395 variables, 1/837 constraints. Problems are: Problem set: 25 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 837 constraints, problems are : Problem set: 25 solved, 518 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 518/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 57486ms problems are : Problem set: 25 solved, 518 unsolved
Search for dead transitions found 25 dead transitions in 57491ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 157/201 places, 519/711 transitions.
Graph (complete) has 1640 edges and 157 vertex of which 138 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 138 /157 variables (removed 19) and now considering 519/519 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 138/201 places, 519/711 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57879 ms. Remains : 138/201 places, 519/711 transitions.
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 711/711 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-05-23 13:26:52] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
// Phase 1: matrix 376 rows 201 cols
[2024-05-23 13:26:52] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:26:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 13:26:53] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:26:53] [INFO ] Invariant cache hit.
[2024-05-23 13:26:53] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-23 13:26:53] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-23 13:26:53] [INFO ] Flow matrix only has 376 transitions (discarded 335 similar events)
[2024-05-23 13:26:53] [INFO ] Invariant cache hit.
[2024-05-23 13:26:53] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 375/575 variables, 200/224 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 173/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (OVERLAPS) 1/576 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 710 unsolved
SMT process timed out in 31026ms, After SMT, problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 31032ms
Finished structural reductions in LTL mode , in 1 iterations and 31427 ms. Remains : 201/201 places, 711/711 transitions.
Treatment of property CloudDeployment-PT-6a-LTLCardinality-10 finished in 184934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 203 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 203 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 201 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 200 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 199 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 199 transition count 709
Applied a total of 15 rules in 15 ms. Remains 199 /207 variables (removed 8) and now considering 709/716 (removed 7) transitions.
[2024-05-23 13:27:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:27:24] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:27:24] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-23 13:27:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:27:24] [INFO ] Invariant cache hit.
[2024-05-23 13:27:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:27:24] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:27:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:27:24] [INFO ] Invariant cache hit.
[2024-05-23 13:27:24] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61062ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61070ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 709/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61481 ms. Remains : 199/207 places, 709/716 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLCardinality-11 finished in 61619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Graph (trivial) has 236 edges and 207 vertex of which 60 / 207 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 155 transition count 545
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 155 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 154 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 154 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 137 transition count 600
Drop transitions (Redundant composition of simpler transitions.) removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 150 place count 137 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 136 transition count 502
Applied a total of 152 rules in 36 ms. Remains 136 /207 variables (removed 71) and now considering 502/716 (removed 214) transitions.
[2024-05-23 13:28:26] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 136 cols
[2024-05-23 13:28:26] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:28:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 13:28:26] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:28:26] [INFO ] Invariant cache hit.
[2024-05-23 13:28:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:28:26] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-23 13:28:26] [INFO ] Redundant transitions in 272 ms returned []
Running 459 sub problems to find dead transitions.
[2024-05-23 13:28:26] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:28:26] [INFO ] Invariant cache hit.
[2024-05-23 13:28:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 6/136 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 202/338 variables, 136/160 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 167 constraints, problems are : Problem set: 0 solved, 459 unsolved in 13500 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 6/136 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 202/338 variables, 136/160 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 459/626 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 626 constraints, problems are : Problem set: 0 solved, 459 unsolved in 22633 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 0/0 constraints]
After SMT, in 36621ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 36626ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/207 places, 502/716 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37230 ms. Remains : 136/207 places, 502/716 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Computed a total of 82 stabilizing places and 394 stable transitions
Graph (complete) has 1593 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 82 stabilizing places and 394 stable transitions
Detected a total of 82/136 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 769 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (664 resets) in 110 ms. (360 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2024-05-23 13:29:04] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:29:04] [INFO ] Invariant cache hit.
[2024-05-23 13:29:04] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/136 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 338/339 variables, and 160 constraints, problems are : Problem set: 1 solved, 0 unsolved in 69 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLCardinality-12 finished in 38541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 203 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 203 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 201 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 200 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 199 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 199 transition count 709
Applied a total of 15 rules in 11 ms. Remains 199 /207 variables (removed 8) and now considering 709/716 (removed 7) transitions.
[2024-05-23 13:29:04] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:29:04] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:29:04] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 13:29:04] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:29:04] [INFO ] Invariant cache hit.
[2024-05-23 13:29:04] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:29:05] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:29:05] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:29:05] [INFO ] Invariant cache hit.
[2024-05-23 13:29:05] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 31047ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 31056ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 709/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31470 ms. Remains : 199/207 places, 709/716 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLCardinality-13 finished in 31560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 203 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 203 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 201 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 200 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 199 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 199 transition count 709
Applied a total of 15 rules in 11 ms. Remains 199 /207 variables (removed 8) and now considering 709/716 (removed 7) transitions.
[2024-05-23 13:29:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:29:36] [INFO ] Invariant cache hit.
[2024-05-23 13:29:36] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 13:29:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:29:36] [INFO ] Invariant cache hit.
[2024-05-23 13:29:36] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:29:36] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:29:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:29:36] [INFO ] Invariant cache hit.
[2024-05-23 13:29:36] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61168ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61178ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 709/716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61575 ms. Remains : 199/207 places, 709/716 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLCardinality-15 finished in 61756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Found a Shortening insensitive property : CloudDeployment-PT-6a-LTLCardinality-10
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 207/207 places, 716/716 transitions.
Graph (trivial) has 235 edges and 207 vertex of which 56 / 207 are part of one of the 17 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 159 transition count 565
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 159 transition count 565
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 157 transition count 563
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 157 transition count 563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 156 transition count 562
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 562
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 138 transition count 628
Applied a total of 57 rules in 26 ms. Remains 138 /207 variables (removed 69) and now considering 628/716 (removed 88) transitions.
[2024-05-23 13:30:38] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
// Phase 1: matrix 322 rows 138 cols
[2024-05-23 13:30:38] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:30:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-23 13:30:38] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:30:38] [INFO ] Invariant cache hit.
[2024-05-23 13:30:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:30:38] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-05-23 13:30:38] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:30:38] [INFO ] Invariant cache hit.
[2024-05-23 13:30:38] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/460 variables, and 169 constraints, problems are : Problem set: 0 solved, 549 unsolved in 18339 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 549/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/460 variables, and 718 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
After SMT, in 48971ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 48977ms
Starting structural reductions in LI_LTL mode, iteration 1 : 138/207 places, 628/716 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49271 ms. Remains : 138/207 places, 628/716 transitions.
Running random walk in product with property : CloudDeployment-PT-6a-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Computed a total of 80 stabilizing places and 506 stable transitions
Graph (complete) has 1729 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 80 stabilizing places and 506 stable transitions
Detected a total of 80/138 stabilizing places and 506/628 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4668 steps (92 resets) in 34 ms. (133 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 628/628 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-23 13:31:28] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:31:28] [INFO ] Invariant cache hit.
[2024-05-23 13:31:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 13:31:28] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:31:28] [INFO ] Invariant cache hit.
[2024-05-23 13:31:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:31:28] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-05-23 13:31:28] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:31:28] [INFO ] Invariant cache hit.
[2024-05-23 13:31:28] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/460 variables, and 169 constraints, problems are : Problem set: 0 solved, 549 unsolved in 17758 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 549/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/460 variables, and 718 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30008 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
After SMT, in 48429ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 48435ms
Finished structural reductions in LTL mode , in 1 iterations and 48709 ms. Remains : 138/138 places, 628/628 transitions.
Computed a total of 80 stabilizing places and 506 stable transitions
Graph (complete) has 1729 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 80 stabilizing places and 506 stable transitions
Detected a total of 80/138 stabilizing places and 506/628 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8146 steps (162 resets) in 83 ms. (96 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 74 ms.
Product exploration explored 100000 steps with 2 reset in 82 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 628/628 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 109 place count 138 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 138 transition count 519
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 110 rules in 28 ms. Remains 138 /138 variables (removed 0) and now considering 519/628 (removed 109) transitions.
[2024-05-23 13:32:19] [INFO ] Redundant transitions in 283 ms returned []
Running 476 sub problems to find dead transitions.
[2024-05-23 13:32:19] [INFO ] Flow matrix only has 213 transitions (discarded 306 similar events)
// Phase 1: matrix 213 rows 138 cols
[2024-05-23 13:32:19] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:32:19] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Problem TDEAD29 is UNSAT
At refinement iteration 4 (OVERLAPS) 212/350 variables, 138/162 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/169 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 475 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/351 variables, and 169 constraints, problems are : Problem set: 1 solved, 475 unsolved in 14366 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 7/138 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 212/350 variables, 138/162 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/169 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 475/644 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 8 (OVERLAPS) 0/350 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 475 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/351 variables, and 644 constraints, problems are : Problem set: 1 solved, 475 unsolved in 23512 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 475/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 38485ms problems are : Problem set: 1 solved, 475 unsolved
Search for dead transitions found 1 dead transitions in 38491ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 138/138 places, 518/628 transitions.
Graph (complete) has 1615 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 137 /138 variables (removed 1) and now considering 518/518 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/138 places, 518/628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38825 ms. Remains : 137/138 places, 518/628 transitions.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 628/628 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-23 13:32:57] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
// Phase 1: matrix 322 rows 138 cols
[2024-05-23 13:32:57] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:32:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 13:32:57] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:32:57] [INFO ] Invariant cache hit.
[2024-05-23 13:32:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:32:57] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-05-23 13:32:57] [INFO ] Flow matrix only has 322 transitions (discarded 306 similar events)
[2024-05-23 13:32:57] [INFO ] Invariant cache hit.
[2024-05-23 13:32:57] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/460 variables, and 169 constraints, problems are : Problem set: 0 solved, 549 unsolved in 17629 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 321/459 variables, 138/162 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 549/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/460 variables, and 718 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
After SMT, in 48337ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 48342ms
Finished structural reductions in LTL mode , in 1 iterations and 48639 ms. Remains : 138/138 places, 628/628 transitions.
Treatment of property CloudDeployment-PT-6a-LTLCardinality-10 finished in 188148 ms.
[2024-05-23 13:33:46] [INFO ] Flatten gal took : 45 ms
[2024-05-23 13:33:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 13:33:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 207 places, 716 transitions and 4775 arcs took 9 ms.
Total runtime 887103 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudDeployment-PT-6a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 207
TRANSITIONS: 716
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.003s]
SAVING FILE /home/mcc/execution/410/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: 1466
MODEL NAME: /home/mcc/execution/410/model
207 places, 716 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-6a-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-6a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716471245152
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-6a"
export BK_EXAMINATION="LTLCardinality"
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-6a, examination is LTLCardinality"
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-171620504900603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6a.tgz
mv CloudDeployment-PT-6a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;