Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620506200579.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudDeployment-PT-4b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200579
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717208452137

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:20:53] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2024-06-01 02:20:53] [INFO ] Transformed 1182 places.
[2024-06-01 02:20:53] [INFO ] Transformed 1824 transitions.
[2024-06-01 02:20:53] [INFO ] Found NUPN structural information;
[2024-06-01 02:20:53] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 446 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 3 formulas.
FORMULA CloudDeployment-PT-4b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1177 transition count 1824
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 304 place count 878 transition count 1278
Iterating global reduction 1 with 299 rules applied. Total rules applied 603 place count 878 transition count 1278
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 709 place count 772 transition count 1172
Iterating global reduction 1 with 106 rules applied. Total rules applied 815 place count 772 transition count 1172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 824 place count 772 transition count 1163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 836 place count 760 transition count 1151
Iterating global reduction 2 with 12 rules applied. Total rules applied 848 place count 760 transition count 1151
Applied a total of 848 rules in 356 ms. Remains 760 /1182 variables (removed 422) and now considering 1151/1824 (removed 673) transitions.
// Phase 1: matrix 1151 rows 760 cols
[2024-06-01 02:20:54] [INFO ] Computed 12 invariants in 28 ms
[2024-06-01 02:20:55] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-06-01 02:20:55] [INFO ] Invariant cache hit.
[2024-06-01 02:20:55] [INFO ] Implicit Places using invariants and state equation in 699 ms returned [10, 19, 188, 202, 369, 377, 546, 555]
[2024-06-01 02:20:55] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 759/1182 places, 1151/1824 transitions.
Applied a total of 0 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 1151/1151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1748 ms. Remains : 759/1182 places, 1151/1824 transitions.
Support contains 33 out of 759 places after structural reductions.
[2024-06-01 02:20:56] [INFO ] Flatten gal took : 143 ms
[2024-06-01 02:20:56] [INFO ] Flatten gal took : 73 ms
[2024-06-01 02:20:56] [INFO ] Input system was already deterministic with 1151 transitions.
RANDOM walk for 40000 steps (313 resets) in 1681 ms. (23 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40002 steps (46 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (45 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
// Phase 1: matrix 1151 rows 759 cols
[2024-06-01 02:20:57] [INFO ] Computed 11 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 41/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 119/169 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 487/656 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 410/1066 variables, 171/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 361/1427 variables, 162/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1427 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 321/1748 variables, 147/660 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1748 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 126/1874 variables, 88/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1874 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 24/1898 variables, 14/762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1898 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 12/1910 variables, 8/770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1910 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1910 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1910/1910 variables, and 770 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1831 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 759/759 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 41/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 119/169 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 487/656 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 410/1066 variables, 171/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 361/1427 variables, 162/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1427 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 321/1748 variables, 147/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1748 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 126/1874 variables, 88/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1874 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 24/1898 variables, 14/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1898 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 12/1910 variables, 8/775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1910 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1910 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1910/1910 variables, and 775 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1759 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 759/759 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3629ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 2132 ms.
Support contains 5 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Graph (trivial) has 785 edges and 759 vertex of which 276 / 759 are part of one of the 31 SCC in 8 ms
Free SCC test removed 245 places
Drop transitions (Empty/Sink Transition effects.) removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Graph (complete) has 1713 edges and 514 vertex of which 501 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 501 transition count 613
Reduce places removed 209 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 210 rules applied. Total rules applied 436 place count 292 transition count 612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 437 place count 291 transition count 612
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 437 place count 291 transition count 567
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 527 place count 246 transition count 567
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 536 place count 237 transition count 558
Iterating global reduction 3 with 9 rules applied. Total rules applied 545 place count 237 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 237 transition count 557
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 546 place count 237 transition count 553
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 554 place count 233 transition count 553
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 686 place count 167 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 687 place count 167 transition count 485
Performed 29 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 745 place count 138 transition count 608
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 769 place count 138 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 6 with 95 rules applied. Total rules applied 864 place count 138 transition count 489
Free-agglomeration rule applied 41 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 41 rules applied. Total rules applied 905 place count 138 transition count 436
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 647 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 135 rules applied. Total rules applied 1040 place count 96 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1041 place count 96 transition count 342
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1044 place count 93 transition count 327
Iterating global reduction 8 with 3 rules applied. Total rules applied 1047 place count 93 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 1091 place count 93 transition count 283
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1092 place count 93 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1093 place count 92 transition count 282
Applied a total of 1093 rules in 249 ms. Remains 92 /759 variables (removed 667) and now considering 282/1151 (removed 869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 92/759 places, 282/1151 transitions.
RANDOM walk for 661 steps (5 resets) in 9 ms. (66 steps per ms) remains 0/3 properties
Computed a total of 110 stabilizing places and 326 stable transitions
Graph (complete) has 2141 edges and 759 vertex of which 746 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.37 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(p0))'
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 747 transition count 1139
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 747 transition count 1139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 747 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 743 transition count 1134
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 743 transition count 1134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 743 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 742 transition count 1131
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 742 transition count 1131
Applied a total of 37 rules in 51 ms. Remains 742 /759 variables (removed 17) and now considering 1131/1151 (removed 20) transitions.
// Phase 1: matrix 1131 rows 742 cols
[2024-06-01 02:21:03] [INFO ] Computed 11 invariants in 6 ms
[2024-06-01 02:21:04] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 02:21:04] [INFO ] Invariant cache hit.
[2024-06-01 02:21:05] [INFO ] Implicit Places using invariants and state equation in 881 ms returned [17, 183, 191, 356, 364, 529, 537]
[2024-06-01 02:21:05] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 741/759 places, 1131/1151 transitions.
Applied a total of 0 rules in 23 ms. Remains 741 /741 variables (removed 0) and now considering 1131/1131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1188 ms. Remains : 741/759 places, 1131/1151 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2097 edges and 741 vertex of which 729 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-00 finished in 2490 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 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 748 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 748 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 748 transition count 1139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 744 transition count 1135
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 744 transition count 1135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 744 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 743 transition count 1132
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 743 transition count 1132
Applied a total of 35 rules in 49 ms. Remains 743 /759 variables (removed 16) and now considering 1132/1151 (removed 19) transitions.
// Phase 1: matrix 1132 rows 743 cols
[2024-06-01 02:21:06] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 02:21:06] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 02:21:06] [INFO ] Invariant cache hit.
[2024-06-01 02:21:07] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [17, 184, 192, 357, 365, 530, 538]
[2024-06-01 02:21:07] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 868 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/759 places, 1132/1151 transitions.
Applied a total of 0 rules in 13 ms. Remains 742 /742 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 931 ms. Remains : 742/759 places, 1132/1151 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-01
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-01 finished in 1038 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||(p1 U p2)))))'
Support contains 6 out of 759 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 748 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 748 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 748 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 745 transition count 1136
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 745 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 745 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 744 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 744 transition count 1134
Applied a total of 32 rules in 60 ms. Remains 744 /759 variables (removed 15) and now considering 1134/1151 (removed 17) transitions.
// Phase 1: matrix 1134 rows 744 cols
[2024-06-01 02:21:07] [INFO ] Computed 11 invariants in 13 ms
[2024-06-01 02:21:07] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 02:21:07] [INFO ] Invariant cache hit.
[2024-06-01 02:21:08] [INFO ] Implicit Places using invariants and state equation in 611 ms returned [17, 183, 193, 358, 366, 531, 539]
[2024-06-01 02:21:08] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 762 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 743/759 places, 1134/1151 transitions.
Applied a total of 0 rules in 17 ms. Remains 743 /743 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 841 ms. Remains : 743/759 places, 1134/1151 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2101 edges and 743 vertex of which 731 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-03 finished in 1620 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)||G(p1))))'
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Graph (trivial) has 789 edges and 759 vertex of which 277 / 759 are part of one of the 32 SCC in 4 ms
Free SCC test removed 245 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Graph (complete) has 1813 edges and 514 vertex of which 501 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 500 transition count 661
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 420 place count 291 transition count 661
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 420 place count 291 transition count 621
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 500 place count 251 transition count 621
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 504 place count 247 transition count 617
Iterating global reduction 2 with 4 rules applied. Total rules applied 508 place count 247 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 508 place count 247 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 510 place count 246 transition count 616
Performed 78 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 666 place count 168 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 667 place count 168 transition count 536
Performed 26 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 719 place count 142 transition count 657
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 742 place count 142 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 824 place count 142 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 825 place count 141 transition count 551
Applied a total of 825 rules in 129 ms. Remains 141 /759 variables (removed 618) and now considering 551/1151 (removed 600) transitions.
[2024-06-01 02:21:09] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2024-06-01 02:21:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:21:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 02:21:09] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
[2024-06-01 02:21:09] [INFO ] Invariant cache hit.
[2024-06-01 02:21:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 02:21:09] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-01 02:21:09] [INFO ] Redundant transitions in 416 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 02:21:09] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
[2024-06-01 02:21:09] [INFO ] Invariant cache hit.
[2024-06-01 02:21:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 423/560 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 4/564 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/565 variables, and 165 constraints, problems are : Problem set: 0 solved, 518 unsolved in 17468 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 423/560 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 25/186 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 4/564 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 493/683 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/565 variables, and 683 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 0/0 constraints]
After SMT, in 48672ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 48682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/759 places, 551/1151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49503 ms. Remains : 141/759 places, 551/1151 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-05 finished in 49573 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)))'
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Graph (trivial) has 788 edges and 759 vertex of which 283 / 759 are part of one of the 31 SCC in 2 ms
Free SCC test removed 252 places
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 1802 edges and 507 vertex of which 494 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 493 transition count 655
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 414 place count 287 transition count 655
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 414 place count 287 transition count 616
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 492 place count 248 transition count 616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 498 place count 242 transition count 610
Iterating global reduction 2 with 6 rules applied. Total rules applied 504 place count 242 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 505 place count 242 transition count 609
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 505 place count 242 transition count 608
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 241 transition count 608
Performed 76 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 659 place count 165 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 660 place count 165 transition count 530
Performed 24 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 708 place count 141 transition count 640
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 726 place count 141 transition count 622
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 5 with 68 rules applied. Total rules applied 794 place count 141 transition count 554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 795 place count 140 transition count 553
Applied a total of 795 rules in 137 ms. Remains 140 /759 variables (removed 619) and now considering 553/1151 (removed 598) transitions.
[2024-06-01 02:21:58] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
// Phase 1: matrix 431 rows 140 cols
[2024-06-01 02:21:58] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 02:21:58] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 02:21:58] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
[2024-06-01 02:21:58] [INFO ] Invariant cache hit.
[2024-06-01 02:21:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 02:21:59] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-06-01 02:21:59] [INFO ] Redundant transitions in 410 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 02:21:59] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
[2024-06-01 02:21:59] [INFO ] Invariant cache hit.
[2024-06-01 02:21:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 430/566 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 4/570 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 519 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/571 variables, and 164 constraints, problems are : Problem set: 0 solved, 519 unsolved in 18122 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 430/566 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 23/183 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (OVERLAPS) 4/570 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 496/683 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 9 (OVERLAPS) 0/570 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 519 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/571 variables, and 683 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints]
After SMT, in 49232ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 49238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/759 places, 553/1151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50228 ms. Remains : 140/759 places, 553/1151 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-06
Stuttering criterion allowed to conclude after 4188 steps with 164 reset in 26 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-06 finished in 50354 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((G(F(!p0))||(F(!p0)&&F(p1)))))'
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 749 transition count 1141
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 749 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 749 transition count 1140
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 745 transition count 1136
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 745 transition count 1136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 745 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 744 transition count 1133
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 744 transition count 1133
Applied a total of 33 rules in 84 ms. Remains 744 /759 variables (removed 15) and now considering 1133/1151 (removed 18) transitions.
// Phase 1: matrix 1133 rows 744 cols
[2024-06-01 02:22:49] [INFO ] Computed 11 invariants in 12 ms
[2024-06-01 02:22:49] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 02:22:49] [INFO ] Invariant cache hit.
[2024-06-01 02:22:49] [INFO ] Implicit Places using invariants and state equation in 652 ms returned [17, 183, 191, 358, 366, 531, 539]
[2024-06-01 02:22:49] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 945 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 743/759 places, 1133/1151 transitions.
Applied a total of 0 rules in 15 ms. Remains 743 /743 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1045 ms. Remains : 743/759 places, 1133/1151 transitions.
Stuttering acceptance computed with spot in 195 ms :[p0, p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-07
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-07 finished in 1267 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 (p1&&X(G(p2)))))'
Support contains 6 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 748 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 748 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 748 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 745 transition count 1136
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 745 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 745 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 744 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 744 transition count 1134
Applied a total of 32 rules in 48 ms. Remains 744 /759 variables (removed 15) and now considering 1134/1151 (removed 17) transitions.
// Phase 1: matrix 1134 rows 744 cols
[2024-06-01 02:22:50] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 02:22:50] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 02:22:50] [INFO ] Invariant cache hit.
[2024-06-01 02:22:51] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [17, 183, 193, 358, 366, 531, 539]
[2024-06-01 02:22:51] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 797 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 743/759 places, 1134/1151 transitions.
Applied a total of 0 rules in 12 ms. Remains 743 /743 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 858 ms. Remains : 743/759 places, 1134/1151 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-08
Product exploration explored 100000 steps with 778 reset in 244 ms.
Product exploration explored 100000 steps with 775 reset in 316 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2101 edges and 743 vertex of which 731 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 p2)), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 154 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (315 resets) in 373 ms. (106 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (49 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (44 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 30 ms. (1290 steps per ms) remains 5/5 properties
// Phase 1: matrix 1134 rows 743 cols
[2024-06-01 02:22:52] [INFO ] Computed 10 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 114/140 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 447/587 variables, 140/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 401/988 variables, 164/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/988 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 358/1346 variables, 164/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1346 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 333/1679 variables, 146/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1679 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 155/1834 variables, 102/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1834 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 31/1865 variables, 19/745 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1865 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 12/1877 variables, 8/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1877 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1877 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1877/1877 variables, and 753 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1028 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 114/140 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 447/587 variables, 140/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 401/988 variables, 164/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/988 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/988 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 358/1346 variables, 164/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1346 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 333/1679 variables, 146/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1679 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 155/1834 variables, 102/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1834 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 31/1865 variables, 19/750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1865 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 18 (OVERLAPS) 12/1877 variables, 8/758 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1877 variables, 0/758 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1877 variables, 0/758 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1877/1877 variables, and 758 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1379 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2433ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 351 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=70 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 12 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 p2)), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 27 factoid took 366 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 1134/1134 transitions.
Applied a total of 0 rules in 18 ms. Remains 743 /743 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
[2024-06-01 02:22:55] [INFO ] Invariant cache hit.
[2024-06-01 02:22:55] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 02:22:55] [INFO ] Invariant cache hit.
[2024-06-01 02:22:56] [INFO ] Implicit Places using invariants and state equation in 705 ms returned [182, 192, 357, 365, 530, 538]
[2024-06-01 02:22:56] [INFO ] Actually due to overlaps returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 855 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/743 places, 1134/1134 transitions.
Applied a total of 0 rules in 13 ms. Remains 742 /742 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 742/743 places, 1134/1134 transitions.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2087 edges and 742 vertex of which 731 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X p1), (X p0), (X (AND p0 p2)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (AND p0 p2))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 104 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (313 resets) in 541 ms. (73 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
// Phase 1: matrix 1134 rows 742 cols
[2024-06-01 02:22:56] [INFO ] Computed 9 invariants in 6 ms
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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 297/312 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/426 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 503/929 variables, 246/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 365/1294 variables, 171/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 347/1641 variables, 150/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1641 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 184/1825 variables, 116/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1825 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 37/1862 variables, 24/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1862 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/1875 variables, 8/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1875 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1876 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1876 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1876 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1876/1876 variables, and 751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 589 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 742/742 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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 297/312 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 114/426 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 503/929 variables, 246/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 365/1294 variables, 171/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1294 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 347/1641 variables, 150/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1641 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 184/1825 variables, 116/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1825 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 37/1862 variables, 24/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1862 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 13/1875 variables, 8/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1875 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1876 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1876 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1876 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1876/1876 variables, and 753 constraints, problems are : Problem set: 0 solved, 2 unsolved in 845 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 742/742 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 274 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X p1), (X p0), (X (AND p0 p2)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (AND p0 p2))), (X (X p2))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 15 factoid took 310 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 797 reset in 210 ms.
Product exploration explored 100000 steps with 778 reset in 215 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 742 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 742/742 places, 1134/1134 transitions.
Graph (trivial) has 768 edges and 742 vertex of which 284 / 742 are part of one of the 32 SCC in 2 ms
Free SCC test removed 252 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 1747 edges and 490 vertex of which 479 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 479 transition count 844
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 197 place count 479 transition count 867
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 223 place count 479 transition count 867
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 324 place count 378 transition count 766
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 425 place count 378 transition count 766
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 506 place count 378 transition count 766
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 567 place count 317 transition count 705
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 628 place count 317 transition count 705
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 656 place count 317 transition count 897
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 660 place count 317 transition count 893
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 692 place count 285 transition count 793
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 724 place count 285 transition count 793
Deduced a syphon composed of 136 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 784 place count 285 transition count 733
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 792 place count 277 transition count 725
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 800 place count 277 transition count 725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 804 place count 277 transition count 809
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 812 place count 269 transition count 777
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 820 place count 269 transition count 777
Deduced a syphon composed of 124 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 2 with 51 rules applied. Total rules applied 871 place count 269 transition count 726
Deduced a syphon composed of 124 places in 0 ms
Applied a total of 871 rules in 140 ms. Remains 269 /742 variables (removed 473) and now considering 726/1134 (removed 408) transitions.
[2024-06-01 02:23:00] [INFO ] Redundant transitions in 357 ms returned []
Running 725 sub problems to find dead transitions.
[2024-06-01 02:23:00] [INFO ] Flow matrix only has 607 transitions (discarded 119 similar events)
// Phase 1: matrix 607 rows 269 cols
[2024-06-01 02:23:00] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:23:00] [INFO ] State equation strengthened by 177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 2 (OVERLAPS) 606/874 variables, 268/272 constraints. Problems are: Problem set: 163 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/874 variables, 176/448 constraints. Problems are: Problem set: 163 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/448 constraints. Problems are: Problem set: 163 solved, 562 unsolved
At refinement iteration 5 (OVERLAPS) 1/875 variables, 1/449 constraints. Problems are: Problem set: 163 solved, 562 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 0/449 constraints. Problems are: Problem set: 163 solved, 562 unsolved
SMT process timed out in 31499ms, After SMT, problems are : Problem set: 163 solved, 562 unsolved
Search for dead transitions found 163 dead transitions in 31507ms
Found 163 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 163 transitions
Dead transitions reduction (with SMT) removed 163 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 269/742 places, 563/1134 transitions.
Graph (complete) has 1276 edges and 269 vertex of which 145 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.1 ms
Discarding 124 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 145 /269 variables (removed 124) and now considering 563/563 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 145/742 places, 563/1134 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32029 ms. Remains : 145/742 places, 563/1134 transitions.
Support contains 6 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1134/1134 transitions.
Applied a total of 0 rules in 12 ms. Remains 742 /742 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
// Phase 1: matrix 1134 rows 742 cols
[2024-06-01 02:23:31] [INFO ] Computed 9 invariants in 8 ms
[2024-06-01 02:23:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 02:23:32] [INFO ] Invariant cache hit.
[2024-06-01 02:23:32] [INFO ] Implicit Places using invariants and state equation in 604 ms returned [191, 356, 364, 529, 537]
[2024-06-01 02:23:32] [INFO ] Actually due to overlaps returned [191]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 763 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 741/742 places, 1134/1134 transitions.
Applied a total of 0 rules in 19 ms. Remains 741 /741 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 795 ms. Remains : 741/742 places, 1134/1134 transitions.
Treatment of property CloudDeployment-PT-4b-LTLCardinality-08 finished in 42706 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)||G(p1))) U p2)&&G(p1))))'
Support contains 4 out of 759 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 750 transition count 1142
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 750 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 750 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 748 transition count 1139
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 748 transition count 1139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 748 transition count 1137
Applied a total of 25 rules in 47 ms. Remains 748 /759 variables (removed 11) and now considering 1137/1151 (removed 14) transitions.
// Phase 1: matrix 1137 rows 748 cols
[2024-06-01 02:23:32] [INFO ] Computed 11 invariants in 12 ms
[2024-06-01 02:23:33] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 02:23:33] [INFO ] Invariant cache hit.
[2024-06-01 02:23:33] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [17, 183, 193, 358, 366, 535, 543]
[2024-06-01 02:23:33] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 794 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 747/759 places, 1137/1151 transitions.
Applied a total of 0 rules in 18 ms. Remains 747 /747 variables (removed 0) and now considering 1137/1137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 861 ms. Remains : 747/759 places, 1137/1151 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-12
Product exploration explored 100000 steps with 786 reset in 201 ms.
Product exploration explored 100000 steps with 794 reset in 177 ms.
Computed a total of 108 stabilizing places and 324 stable transitions
Graph (complete) has 2105 edges and 747 vertex of which 735 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 108 stabilizing places and 324 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (AND p1 p2)), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (321 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (48 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 597014 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 597014 steps, saw 135778 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 1137 rows 747 cols
[2024-06-01 02:23:37] [INFO ] Computed 10 invariants in 3 ms
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) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/136 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/576 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 405/981 variables, 163/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 373/1354 variables, 171/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1354 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 336/1690 variables, 150/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1690 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 153/1843 variables, 101/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1843 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/1872 variables, 18/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1872 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1884 variables, 8/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1884 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1884 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 757 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 747/747 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) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/136 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/576 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 405/981 variables, 163/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 373/1354 variables, 171/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1354 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 336/1690 variables, 150/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1690 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 153/1843 variables, 101/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1843 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 29/1872 variables, 18/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1872 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/1884 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1884 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1884 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1884/1884 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 747/747 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 959ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 1137/1137 transitions.
Graph (trivial) has 778 edges and 747 vertex of which 282 / 747 are part of one of the 32 SCC in 1 ms
Free SCC test removed 250 places
Drop transitions (Empty/Sink Transition effects.) removed 321 transitions
Reduce isomorphic transitions removed 321 transitions.
Graph (complete) has 1668 edges and 497 vertex of which 485 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 485 transition count 597
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 426 place count 280 transition count 597
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 426 place count 280 transition count 552
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 516 place count 235 transition count 552
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 520 place count 231 transition count 548
Iterating global reduction 2 with 4 rules applied. Total rules applied 524 place count 231 transition count 548
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 524 place count 231 transition count 544
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 532 place count 227 transition count 544
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 662 place count 162 transition count 479
Performed 29 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 720 place count 133 transition count 615
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 749 place count 133 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 853 place count 133 transition count 482
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 893 place count 133 transition count 430
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 640 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 133 rules applied. Total rules applied 1026 place count 92 transition count 338
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1027 place count 92 transition count 337
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1030 place count 89 transition count 322
Iterating global reduction 5 with 3 rules applied. Total rules applied 1033 place count 89 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 5 with 44 rules applied. Total rules applied 1077 place count 89 transition count 278
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1078 place count 89 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 88 transition count 277
Applied a total of 1079 rules in 70 ms. Remains 88 /747 variables (removed 659) and now considering 277/1137 (removed 860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 88/747 places, 277/1137 transitions.
RANDOM walk for 218 steps (3 resets) in 4 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X (AND p1 p2)), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
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 128 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-4b-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-12 finished in 5821 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 (p1&&X(G(p2)))))'
Found a Lengthening insensitive property : CloudDeployment-PT-4b-LTLCardinality-08
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 759 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 759/759 places, 1151/1151 transitions.
Graph (trivial) has 785 edges and 759 vertex of which 288 / 759 are part of one of the 32 SCC in 1 ms
Free SCC test removed 256 places
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Graph (complete) has 1797 edges and 503 vertex of which 490 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 489 transition count 655
Reduce places removed 201 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 202 rules applied. Total rules applied 405 place count 288 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 406 place count 287 transition count 654
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 406 place count 287 transition count 617
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 480 place count 250 transition count 617
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 485 place count 245 transition count 612
Iterating global reduction 3 with 5 rules applied. Total rules applied 490 place count 245 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 245 transition count 611
Performed 76 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 643 place count 169 transition count 534
Performed 24 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 691 place count 145 transition count 644
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 709 place count 145 transition count 626
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 712 place count 145 transition count 623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 713 place count 144 transition count 622
Applied a total of 713 rules in 68 ms. Remains 144 /759 variables (removed 615) and now considering 622/1151 (removed 529) transitions.
[2024-06-01 02:23:38] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
// Phase 1: matrix 503 rows 144 cols
[2024-06-01 02:23:39] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:23:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 02:23:39] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
[2024-06-01 02:23:39] [INFO ] Invariant cache hit.
[2024-06-01 02:23:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 02:23:39] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-06-01 02:23:39] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
[2024-06-01 02:23:39] [INFO ] Invariant cache hit.
[2024-06-01 02:23:39] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (OVERLAPS) 502/642 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 4/646 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 589 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/647 variables, and 172 constraints, problems are : Problem set: 0 solved, 589 unsolved in 22994 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (OVERLAPS) 502/642 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 24/192 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (OVERLAPS) 4/646 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 565/761 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/647 variables, and 761 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 0/0 constraints]
After SMT, in 54493ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 54499ms
Starting structural reductions in LI_LTL mode, iteration 1 : 144/759 places, 622/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54843 ms. Remains : 144/759 places, 622/1151 transitions.
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-08
Stuttering criterion allowed to conclude after 283 steps with 14 reset in 1 ms.
Treatment of property CloudDeployment-PT-4b-LTLCardinality-08 finished in 55085 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 02:24:33] [INFO ] Flatten gal took : 53 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 220566 ms.
ITS solved all properties within timeout

BK_STOP 1717208673913

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-4b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-4b, examination is 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 r476-tall-171620506200579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4b.tgz
mv CloudDeployment-PT-4b execution
cd execution
if [ "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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;