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-171620506200612.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-6b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 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 4.8M 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-6b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717209259142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:34:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:34:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:34:20] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-06-01 02:34:20] [INFO ] Transformed 1888 places.
[2024-06-01 02:34:20] [INFO ] Transformed 6804 transitions.
[2024-06-01 02:34:20] [INFO ] Found NUPN structural information;
[2024-06-01 02:34:20] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1882 transition count 6804
Discarding 519 places :
Symmetric choice reduction at 1 with 519 rule applications. Total rules 525 place count 1363 transition count 6285
Iterating global reduction 1 with 519 rules applied. Total rules applied 1044 place count 1363 transition count 6285
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 1245 place count 1162 transition count 6084
Iterating global reduction 1 with 201 rules applied. Total rules applied 1446 place count 1162 transition count 6084
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1474 place count 1162 transition count 6056
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1493 place count 1143 transition count 6037
Iterating global reduction 2 with 19 rules applied. Total rules applied 1512 place count 1143 transition count 6037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1513 place count 1142 transition count 6036
Iterating global reduction 2 with 1 rules applied. Total rules applied 1514 place count 1142 transition count 6036
Applied a total of 1514 rules in 755 ms. Remains 1142 /1888 variables (removed 746) and now considering 6036/6804 (removed 768) transitions.
// Phase 1: matrix 6036 rows 1142 cols
[2024-06-01 02:34:22] [INFO ] Computed 19 invariants in 101 ms
[2024-06-01 02:34:22] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-06-01 02:34:22] [INFO ] Invariant cache hit.
[2024-06-01 02:34:26] [INFO ] Implicit Places using invariants and state equation in 3763 ms returned []
Implicit Place search using SMT with State Equation took 4469 ms to find 0 implicit places.
Running 6035 sub problems to find dead transitions.
[2024-06-01 02:34:26] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1141/7178 variables, and 19 constraints, problems are : Problem set: 0 solved, 6035 unsolved in 30154 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1142 constraints, PredecessorRefiner: 6035/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1141/7178 variables, and 19 constraints, problems are : Problem set: 0 solved, 6035 unsolved in 30088 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1142 constraints, PredecessorRefiner: 4096/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 144177ms problems are : Problem set: 0 solved, 6035 unsolved
Search for dead transitions found 0 dead transitions in 144304ms
Starting structural reductions in LTL mode, iteration 1 : 1142/1888 places, 6036/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149595 ms. Remains : 1142/1888 places, 6036/6804 transitions.
Support contains 57 out of 1142 places after structural reductions.
[2024-06-01 02:36:52] [INFO ] Flatten gal took : 1301 ms
[2024-06-01 02:36:53] [INFO ] Flatten gal took : 966 ms
[2024-06-01 02:36:55] [INFO ] Input system was already deterministic with 6036 transitions.
Support contains 55 out of 1142 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1974 ms. (20 steps per ms) remains 25/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
[2024-06-01 02:36:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 228/275 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 5059/5334 variables, 275/294 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5334 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 6 (OVERLAPS) 578/5912 variables, 243/537 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5912 variables, 0/537 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 534/6446 variables, 234/771 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6446 variables, 0/771 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 497/6943 variables, 230/1001 constraints. Problems are: Problem set: 15 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6943/7178 variables, and 1001 constraints, problems are : Problem set: 15 solved, 10 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 982/1142 constraints, PredecessorRefiner: 25/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 240/275 variables, 18/19 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5059/5334 variables, 275/294 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5334 variables, 1/295 constraints. Problems are: Problem set: 15 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5334 variables, 0/295 constraints. Problems are: Problem set: 15 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 7 (OVERLAPS) 578/5912 variables, 243/538 constraints. Problems are: Problem set: 16 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5912 variables, 8/546 constraints. Problems are: Problem set: 16 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5912 variables, 0/546 constraints. Problems are: Problem set: 16 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 534/6446 variables, 234/780 constraints. Problems are: Problem set: 16 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6446 variables, 0/780 constraints. Problems are: Problem set: 16 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 497/6943 variables, 230/1010 constraints. Problems are: Problem set: 16 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6943/7178 variables, and 1010 constraints, problems are : Problem set: 16 solved, 9 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 982/1142 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 10542ms problems are : Problem set: 16 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1146 edges and 1142 vertex of which 398 / 1142 are part of one of the 44 SCC in 17 ms
Free SCC test removed 354 places
Drop transitions (Empty/Sink Transition effects.) removed 4547 transitions
Reduce isomorphic transitions removed 4547 transitions.
Graph (complete) has 3195 edges and 788 vertex of which 755 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.6 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 755 transition count 1163
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 315 rules applied. Total rules applied 643 place count 448 transition count 1155
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 649 place count 442 transition count 1155
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 649 place count 442 transition count 1087
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 785 place count 374 transition count 1087
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 794 place count 365 transition count 1078
Iterating global reduction 3 with 9 rules applied. Total rules applied 803 place count 365 transition count 1078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 365 transition count 1077
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 804 place count 365 transition count 1070
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 818 place count 358 transition count 1070
Performed 101 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1020 place count 257 transition count 968
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1094 place count 220 transition count 1206
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 1136 place count 220 transition count 1164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1148 place count 214 transition count 1224
Drop transitions (Redundant composition of simpler transitions.) removed 152 transitions
Redundant transition composition rules discarded 152 transitions
Iterating global reduction 5 with 152 rules applied. Total rules applied 1300 place count 214 transition count 1072
Free-agglomeration rule applied 49 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 1349 place count 214 transition count 1016
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 47 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 138 transitions.
Iterating post reduction 5 with 187 rules applied. Total rules applied 1536 place count 165 transition count 878
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1542 place count 159 transition count 834
Iterating global reduction 6 with 6 rules applied. Total rules applied 1548 place count 159 transition count 834
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 1598 place count 159 transition count 784
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1599 place count 159 transition count 784
Applied a total of 1599 rules in 336 ms. Remains 159 /1142 variables (removed 983) and now considering 784/6036 (removed 5252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 159/1142 places, 784/6036 transitions.
RANDOM walk for 40000 steps (8 resets) in 977 ms. (40 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/7 properties
[2024-06-01 02:37:07] [INFO ] Flow matrix only has 480 transitions (discarded 304 similar events)
// Phase 1: matrix 480 rows 159 cols
[2024-06-01 02:37:07] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 02:37:07] [INFO ] State equation strengthened by 239 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/93 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 51/144 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 461/605 variables, 144/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 160/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 34/639 variables, 15/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 79/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/639 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/93 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 51/144 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 02:37:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
[2024-06-01 02:37:08] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 02:37:08] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 461/605 variables, 144/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 160/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/605 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 34/639 variables, 15/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 79/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/639 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2329ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 611 ms.
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 784/784 transitions.
Graph (trivial) has 62 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 157 transition count 776
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 156 transition count 776
Performed 3 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 153 transition count 789
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 153 transition count 786
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 1 with 51 rules applied. Total rules applied 63 place count 153 transition count 735
Free-agglomeration rule applied 8 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 153 transition count 723
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 125 place count 145 transition count 677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 143 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 143 transition count 657
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 143 transition count 655
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 167 place count 143 transition count 619
Applied a total of 167 rules in 85 ms. Remains 143 /159 variables (removed 16) and now considering 619/784 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 143/159 places, 619/784 transitions.
RANDOM walk for 40000 steps (559 resets) in 394 ms. (101 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (30 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2024-06-01 02:37:10] [INFO ] Flow matrix only has 330 transitions (discarded 289 similar events)
// Phase 1: matrix 330 rows 143 cols
[2024-06-01 02:37:10] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 02:37:10] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/84 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/139 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 329/468 variables, 139/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 183/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/473 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 25/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/473 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 208/208 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/84 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/139 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 329/468 variables, 139/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 183/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/473 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 25/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/473 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 30 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 180 stabilizing places and 4754 stable transitions
Graph (complete) has 3775 edges and 1142 vertex of which 1109 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.41 ms
FORMULA CloudDeployment-PT-6b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(!p0)) U (p1||X(p0))))'
Support contains 6 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 1120 transition count 1932
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 1120 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1120 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1117 transition count 1928
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1117 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 1116 transition count 1926
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 1116 transition count 1926
Applied a total of 53 rules in 328 ms. Remains 1116 /1142 variables (removed 26) and now considering 1926/6036 (removed 4110) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2024-06-01 02:37:12] [INFO ] Computed 18 invariants in 8 ms
[2024-06-01 02:37:12] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 02:37:12] [INFO ] Invariant cache hit.
[2024-06-01 02:37:13] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-06-01 02:37:13] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1335 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1142 places, 1926/6036 transitions.
Applied a total of 0 rules in 29 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1692 ms. Remains : 1115/1142 places, 1926/6036 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), p0, true]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-01
Product exploration explored 100000 steps with 516 reset in 336 ms.
Product exploration explored 100000 steps with 519 reset in 351 ms.
Computed a total of 161 stabilizing places and 653 stable transitions
Graph (complete) has 3698 edges and 1115 vertex of which 1096 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.6 ms
Computed a total of 161 stabilizing places and 653 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 40000 steps (207 resets) in 182 ms. (218 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
// Phase 1: matrix 1926 rows 1115 cols
[2024-06-01 02:37:14] [INFO ] Computed 17 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 933/1170 variables, 237/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1170 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 579/1749 variables, 243/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1749 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 526/2275 variables, 232/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2275 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 514/2789 variables, 230/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2789 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/2985 variables, 139/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2985 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/3025 variables, 23/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3025 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/3041 variables, 11/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3041 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3041 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 1132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 976 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 1115/1115 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 933/1170 variables, 237/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1170 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 579/1749 variables, 243/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1749 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1749 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 526/2275 variables, 232/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2275 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 514/2789 variables, 230/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2789 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 196/2985 variables, 139/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2985 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/3025 variables, 23/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3025 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/3041 variables, 11/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3041 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/3041 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 1133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1439 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 1115/1115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2443ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 372 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-01 finished in 5731 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 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 220 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-06-01 02:37:17] [INFO ] Computed 18 invariants in 17 ms
[2024-06-01 02:37:18] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 02:37:18] [INFO ] Invariant cache hit.
[2024-06-01 02:37:19] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned [12, 20, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887]
[2024-06-01 02:37:19] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1421 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 27 ms. Remains 1116 /1116 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1668 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 568 ms.
Product exploration explored 100000 steps with 50000 reset in 530 ms.
Computed a total of 162 stabilizing places and 654 stable transitions
Graph (complete) has 3699 edges and 1116 vertex of which 1097 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.8 ms
Computed a total of 162 stabilizing places and 654 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-06 finished in 2903 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&&F(p1)))))'
Support contains 2 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 208 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-06-01 02:37:20] [INFO ] Computed 18 invariants in 13 ms
[2024-06-01 02:37:20] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 02:37:20] [INFO ] Invariant cache hit.
[2024-06-01 02:37:22] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 887]
[2024-06-01 02:37:22] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 24 ms. Remains 1116 /1116 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1582 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-07
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 3 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-07 finished in 1741 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(p0)||G(F(!p1))))'
Support contains 6 out of 1142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1162 edges and 1142 vertex of which 414 / 1142 are part of one of the 46 SCC in 5 ms
Free SCC test removed 368 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Graph (complete) has 3285 edges and 774 vertex of which 741 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.13 ms
Discarding 33 places :
Also discarding 4097 output transitions
Drop transitions (Output transitions of discarded places.) removed 4097 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 741 transition count 1216
Reduce places removed 302 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 305 rules applied. Total rules applied 609 place count 439 transition count 1213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 611 place count 437 transition count 1213
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 611 place count 437 transition count 1152
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 733 place count 376 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 737 place count 372 transition count 1148
Iterating global reduction 3 with 4 rules applied. Total rules applied 741 place count 372 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 742 place count 372 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 743 place count 371 transition count 1146
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 371 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 745 place count 370 transition count 1145
Iterating global reduction 4 with 1 rules applied. Total rules applied 746 place count 370 transition count 1145
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 982 place count 252 transition count 1027
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -54
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 1030 place count 228 transition count 1081
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1036 place count 228 transition count 1075
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1048 place count 222 transition count 1135
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 1096 place count 222 transition count 1087
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1098 place count 221 transition count 1093
Applied a total of 1098 rules in 200 ms. Remains 221 /1142 variables (removed 921) and now considering 1093/6036 (removed 4943) transitions.
[2024-06-01 02:37:22] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
// Phase 1: matrix 874 rows 221 cols
[2024-06-01 02:37:22] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 02:37:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 02:37:22] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:37:22] [INFO ] Invariant cache hit.
[2024-06-01 02:37:22] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-06-01 02:37:23] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-06-01 02:37:23] [INFO ] Redundant transitions in 797 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-06-01 02:37:23] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:37:23] [INFO ] Invariant cache hit.
[2024-06-01 02:37:23] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1095 variables, and 513 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1092/1605 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1095 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 64270ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 64281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/1142 places, 1093/6036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65948 ms. Remains : 221/1142 places, 1093/6036 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-13
Product exploration explored 100000 steps with 2184 reset in 525 ms.
Product exploration explored 100000 steps with 2197 reset in 465 ms.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
RANDOM walk for 40000 steps (938 resets) in 1508 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (41 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 776174 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 776174 steps, saw 127538 distinct states, run finished after 3005 ms. (steps per millisecond=258 ) properties seen :0
[2024-06-01 02:38:33] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:38:33] [INFO ] Invariant cache hit.
[2024-06-01 02:38:33] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1095 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1094 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1095 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1048ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 123 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 35350 steps (591 resets) in 202 ms. (174 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 66 ms :[p1, p1]
Support contains 5 out of 221 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Applied a total of 0 rules in 27 ms. Remains 221 /221 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-06-01 02:38:34] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:38:34] [INFO ] Invariant cache hit.
[2024-06-01 02:38:34] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 02:38:34] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:38:34] [INFO ] Invariant cache hit.
[2024-06-01 02:38:35] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-06-01 02:38:35] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-06-01 02:38:36] [INFO ] Redundant transitions in 916 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-06-01 02:38:36] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:38:36] [INFO ] Invariant cache hit.
[2024-06-01 02:38:36] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1095 variables, and 513 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1092/1605 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1095 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 64567ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 64579ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66185 ms. Remains : 221/221 places, 1093/1093 transitions.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p1, p1]
RANDOM walk for 40000 steps (936 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (40 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 752231 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 752231 steps, saw 123743 distinct states, run finished after 3002 ms. (steps per millisecond=250 ) properties seen :0
[2024-06-01 02:39:44] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-06-01 02:39:44] [INFO ] Invariant cache hit.
[2024-06-01 02:39:44] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1095 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1094 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1095 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 109 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 33743 steps (559 resets) in 191 ms. (175 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p1, p1]
Stuttering acceptance computed with spot in 66 ms :[p1, p1]
Stuttering acceptance computed with spot in 130 ms :[p1, p1]
Product exploration explored 100000 steps with 2226 reset in 440 ms.
Product exploration explored 100000 steps with 2210 reset in 451 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 1092
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 219 transition count 1090
Applied a total of 5 rules in 33 ms. Remains 219 /221 variables (removed 2) and now considering 1090/1093 (removed 3) transitions.
[2024-06-01 02:39:46] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
// Phase 1: matrix 871 rows 219 cols
[2024-06-01 02:39:46] [INFO ] Computed 6 invariants in 8 ms
[2024-06-01 02:39:46] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 02:39:46] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-06-01 02:39:46] [INFO ] Invariant cache hit.
[2024-06-01 02:39:46] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-06-01 02:39:47] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-06-01 02:39:48] [INFO ] Redundant transitions in 737 ms returned []
Running 1089 sub problems to find dead transitions.
[2024-06-01 02:39:48] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-06-01 02:39:48] [INFO ] Invariant cache hit.
[2024-06-01 02:39:48] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 870/1088 variables, 218/224 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 287/511 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1090 variables, and 511 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 218/219 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 870/1088 variables, 218/224 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 287/511 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1089/1600 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1090 variables, and 1600 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 218/219 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 0/0 constraints]
After SMT, in 64953ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 64964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 219/221 places, 1090/1093 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66475 ms. Remains : 219/221 places, 1090/1093 transitions.
Treatment of property CloudDeployment-PT-6b-LTLFireability-13 finished in 211984 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(p1) U p2)&&p0))))'
Support contains 4 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 1122 transition count 1934
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 1122 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1122 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1120 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1120 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1120 transition count 1930
Applied a total of 45 rules in 179 ms. Remains 1120 /1142 variables (removed 22) and now considering 1930/6036 (removed 4106) transitions.
// Phase 1: matrix 1930 rows 1120 cols
[2024-06-01 02:40:54] [INFO ] Computed 18 invariants in 15 ms
[2024-06-01 02:40:54] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 02:40:54] [INFO ] Invariant cache hit.
[2024-06-01 02:40:56] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-06-01 02:40:56] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1597 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1142 places, 1930/6036 transitions.
Applied a total of 0 rules in 23 ms. Remains 1119 /1119 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1802 ms. Remains : 1119/1142 places, 1930/6036 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-15 finished in 2068 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(p0)||G(F(!p1))))'
[2024-06-01 02:40:57] [INFO ] Flatten gal took : 944 ms
[2024-06-01 02:40:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 02:40:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1142 places, 6036 transitions and 90224 arcs took 62 ms.
Total runtime 397312 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CloudDeployment-PT-6b-LTLFireability-13

BK_STOP 1717212628923

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CloudDeployment-PT-6b-LTLFireability-13
ltl formula formula --ltl=/tmp/949/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1142 places, 6036 transitions and 90224 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.320 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/949/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/949/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/949/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/949/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1144 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1143, there are 6044 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~405 levels ~10000 states ~30508 transitions
pnml2lts-mc( 0/ 4): ~486 levels ~20000 states ~54484 transitions
pnml2lts-mc( 2/ 4): ~1262 levels ~40000 states ~122040 transitions
pnml2lts-mc( 2/ 4): ~1814 levels ~80000 states ~262696 transitions
pnml2lts-mc( 2/ 4): ~1815 levels ~160000 states ~524636 transitions
pnml2lts-mc( 3/ 4): ~679 levels ~320000 states ~1113400 transitions
pnml2lts-mc( 3/ 4): ~679 levels ~640000 states ~2103916 transitions
pnml2lts-mc( 3/ 4): ~679 levels ~1280000 states ~4096388 transitions
pnml2lts-mc( 3/ 4): ~679 levels ~2560000 states ~9444696 transitions
pnml2lts-mc( 3/ 4): ~679 levels ~5120000 states ~20189736 transitions
pnml2lts-mc( 3/ 4): ~17663 levels ~10240000 states ~43437616 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1753889
pnml2lts-mc( 0/ 4): unique states count: 15629524
pnml2lts-mc( 0/ 4): unique transitions count: 73049542
pnml2lts-mc( 0/ 4): - self-loop count: 18923
pnml2lts-mc( 0/ 4): - claim dead count: 28824426
pnml2lts-mc( 0/ 4): - claim found count: 28365656
pnml2lts-mc( 0/ 4): - claim success count: 15629536
pnml2lts-mc( 0/ 4): - cum. max stack depth: 550962
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15629536 states 73049571 transitions, fanout: 4.674
pnml2lts-mc( 0/ 4): Total exploration time 2969.000 sec (2968.990 sec minimum, 2968.993 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5264, Transitions per second: 24604
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 183.4MB, 12.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 6155 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 183.4MB (~256.0MB paged-in)

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-6b"
export BK_EXAMINATION="LTLFireability"
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-6b, examination is LTLFireability"
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-171620506200612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;