About the Execution of ITS-Tools for CloudDeployment-PT-6b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10862.199 | 446543.00 | 581698.00 | 1504.00 | FFTFFFTFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-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 itstools
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 r070-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 1716332228245
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:57:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:57:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:57:09] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2024-05-21 22:57:09] [INFO ] Transformed 1888 places.
[2024-05-21 22:57:10] [INFO ] Transformed 6804 transitions.
[2024-05-21 22:57:10] [INFO ] Found NUPN structural information;
[2024-05-21 22:57:10] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 625 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 591 ms. Remains 1142 /1888 variables (removed 746) and now considering 6036/6804 (removed 768) transitions.
// Phase 1: matrix 6036 rows 1142 cols
[2024-05-21 22:57:11] [INFO ] Computed 19 invariants in 105 ms
[2024-05-21 22:57:11] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-21 22:57:11] [INFO ] Invariant cache hit.
[2024-05-21 22:57:15] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 4121 ms to find 0 implicit places.
Running 6035 sub problems to find dead transitions.
[2024-05-21 22:57:15] [INFO ] Invariant cache hit.
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 30214 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30139 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 142935ms problems are : Problem set: 0 solved, 6035 unsolved
Search for dead transitions found 0 dead transitions in 143040ms
Starting structural reductions in LTL mode, iteration 1 : 1142/1888 places, 6036/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147846 ms. Remains : 1142/1888 places, 6036/6804 transitions.
Support contains 57 out of 1142 places after structural reductions.
[2024-05-21 22:59:40] [INFO ] Flatten gal took : 1780 ms
[2024-05-21 22:59:41] [INFO ] Flatten gal took : 1048 ms
[2024-05-21 22:59:43] [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 (204 resets) in 3143 ms. (12 steps per ms) remains 26/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
[2024-05-21 22:59:44] [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, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 229/276 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 5062/5338 variables, 276/295 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5338 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 26 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) 583/5921 variables, 245/540 constraints. Problems are: Problem set: 15 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5921 variables, 0/540 constraints. Problems are: Problem set: 15 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 541/6462 variables, 237/777 constraints. Problems are: Problem set: 15 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6462 variables, 0/777 constraints. Problems are: Problem set: 15 solved, 11 unsolved
SMT process timed out in 5720ms, After SMT, problems are : Problem set: 15 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1135 edges and 1142 vertex of which 396 / 1142 are part of one of the 44 SCC in 9 ms
Free SCC test removed 352 places
Drop transitions (Empty/Sink Transition effects.) removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Graph (complete) has 3198 edges and 790 vertex of which 789 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 309 rules applied. Total rules applied 311 place count 789 transition count 5279
Reduce places removed 303 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 310 rules applied. Total rules applied 621 place count 486 transition count 5272
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 626 place count 481 transition count 5272
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 626 place count 481 transition count 5198
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 774 place count 407 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 776 place count 405 transition count 5196
Iterating global reduction 3 with 2 rules applied. Total rules applied 778 place count 405 transition count 5196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 778 place count 405 transition count 5195
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 780 place count 404 transition count 5195
Performed 107 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 107 places in 2 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 994 place count 297 transition count 5087
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1068 place count 260 transition count 5325
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1110 place count 260 transition count 5283
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1122 place count 254 transition count 5343
Drop transitions (Redundant composition of simpler transitions.) removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 4 with 153 rules applied. Total rules applied 1275 place count 254 transition count 5190
Free-agglomeration rule applied 54 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1329 place count 254 transition count 5124
Reduce places removed 54 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 1530 place count 200 transition count 4977
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1535 place count 195 transition count 4940
Iterating global reduction 5 with 5 rules applied. Total rules applied 1540 place count 195 transition count 4940
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 5 with 69 rules applied. Total rules applied 1609 place count 195 transition count 4871
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1611 place count 195 transition count 4871
Applied a total of 1611 rules in 1458 ms. Remains 195 /1142 variables (removed 947) and now considering 4871/6036 (removed 1165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1460 ms. Remains : 195/1142 places, 4871/6036 transitions.
RANDOM walk for 40000 steps (633 resets) in 4057 ms. (9 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (101 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (53 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (49 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (53 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
[2024-05-21 22:59:53] [INFO ] Flow matrix only has 4556 transitions (discarded 315 similar events)
// Phase 1: matrix 4556 rows 195 cols
[2024-05-21 22:59:53] [INFO ] Computed 25 invariants in 112 ms
[2024-05-21 22:59:54] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 163/194 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4556/4750 variables, 194/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4750 variables, 224/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4750 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/4751 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4751 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/4751 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4751/4751 variables, and 444 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2766 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 195/195 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 163/194 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4556/4750 variables, 194/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4750 variables, 224/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4750 variables, 6/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4750 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/4751 variables, 1/450 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4751 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/4751 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4751/4751 variables, and 450 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4588 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 195/195 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7644ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 632 ms.
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 4871/4871 transitions.
Graph (trivial) has 85 edges and 195 vertex of which 6 / 195 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4102 transitions
Reduce isomorphic transitions removed 4102 transitions.
Graph (complete) has 1583 edges and 192 vertex of which 163 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 16 place count 163 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 162 transition count 755
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 162 transition count 753
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 160 transition count 753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 159 transition count 746
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 159 transition count 746
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 151 transition count 738
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 2 with 6 rules applied. Total rules applied 45 place count 148 transition count 751
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 148 transition count 748
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 99 place count 148 transition count 697
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 148 transition count 692
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 144 place count 143 transition count 657
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 141 transition count 637
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 141 transition count 637
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 141 transition count 635
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 168 place count 141 transition count 617
Applied a total of 168 rules in 153 ms. Remains 141 /195 variables (removed 54) and now considering 617/4871 (removed 4254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 141/195 places, 617/4871 transitions.
RANDOM walk for 40000 steps (565 resets) in 348 ms. (114 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (36 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (30 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-21 23:00:02] [INFO ] Flow matrix only has 328 transitions (discarded 289 similar events)
// Phase 1: matrix 328 rows 141 cols
[2024-05-21 23:00:02] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 23:00:02] [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) 53/137 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 327/464 variables, 137/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 183/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/469 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 25/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/469 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 371 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 141/141 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) 53/137 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 327/464 variables, 137/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 183/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/469 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 25/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/469 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 141/141 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 97 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 27 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.67 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 443 ms. Remains 1116 /1142 variables (removed 26) and now considering 1926/6036 (removed 4110) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2024-05-21 23:00:05] [INFO ] Computed 18 invariants in 6 ms
[2024-05-21 23:00:06] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-21 23:00:06] [INFO ] Invariant cache hit.
[2024-05-21 23:00:07] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-05-21 23:00:07] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1786 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 26 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 2256 ms. Remains : 1115/1142 places, 1926/6036 transitions.
Stuttering acceptance computed with spot in 222 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 299 ms.
Product exploration explored 100000 steps with 509 reset in 245 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.20 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 174 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 127 ms :[true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 40000 steps (206 resets) in 283 ms. (140 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 415 ms. (96 steps per ms) remains 1/1 properties
// Phase 1: matrix 1926 rows 1115 cols
[2024-05-21 23:00:08] [INFO ] Computed 17 invariants in 5 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 1146 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 1389 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 2585ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 341 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 2 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 246 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 6565 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 366 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-21 23:00:11] [INFO ] Computed 18 invariants in 6 ms
[2024-05-21 23:00:12] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-21 23:00:12] [INFO ] Invariant cache hit.
[2024-05-21 23:00:13] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned [12, 20, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887]
[2024-05-21 23:00:13] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1583 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 1987 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 92 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 625 ms.
Product exploration explored 100000 steps with 50000 reset in 604 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.28 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 10 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 3371 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 221 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-21 23:00:14] [INFO ] Computed 18 invariants in 5 ms
[2024-05-21 23:00:15] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-21 23:00:15] [INFO ] Invariant cache hit.
[2024-05-21 23:00:16] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 887]
[2024-05-21 23:00:16] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1363 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 23 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 1607 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 112 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 340 steps with 0 reset in 5 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-07 finished in 1746 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 2 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 0 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 0 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 287 ms. Remains 221 /1142 variables (removed 921) and now considering 1093/6036 (removed 4943) transitions.
[2024-05-21 23:00:16] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
// Phase 1: matrix 874 rows 221 cols
[2024-05-21 23:00:16] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 23:00:17] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-21 23:00:17] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:00:17] [INFO ] Invariant cache hit.
[2024-05-21 23:00:17] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 23:00:17] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-05-21 23:00:19] [INFO ] Redundant transitions in 1470 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-21 23:00:19] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:00:19] [INFO ] Invariant cache hit.
[2024-05-21 23:00:19] [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 30021 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 30027 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 65245ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 65254ms
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 68133 ms. Remains : 221/1142 places, 1093/6036 transitions.
Stuttering acceptance computed with spot in 110 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 2222 reset in 517 ms.
Product exploration explored 100000 steps with 2208 reset in 422 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 177 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 78 ms :[p1, p1]
RANDOM walk for 40000 steps (938 resets) in 825 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (43 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 704672 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 704672 steps, saw 117151 distinct states, run finished after 3004 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-21 23:01:29] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:01:29] [INFO ] Invariant cache hit.
[2024-05-21 23:01:29] [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 491 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 507 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 1033ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 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 1 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 1 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 102 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 102 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 39326 steps (651 resets) in 238 ms. (164 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 266 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 137 ms :[p1, p1]
Stuttering acceptance computed with spot in 85 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 55 ms. Remains 221 /221 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-05-21 23:01:31] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:01:31] [INFO ] Invariant cache hit.
[2024-05-21 23:01:31] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-21 23:01:31] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:01:31] [INFO ] Invariant cache hit.
[2024-05-21 23:01:31] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 23:01:32] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2024-05-21 23:01:33] [INFO ] Redundant transitions in 1442 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-21 23:01:33] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:01:33] [INFO ] Invariant cache hit.
[2024-05-21 23:01:33] [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 30023 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 30027 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 65238ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 65248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68091 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 114 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 69 ms :[p1, p1]
RANDOM walk for 40000 steps (938 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (42 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 731406 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 731406 steps, saw 120372 distinct states, run finished after 3002 ms. (steps per millisecond=243 ) properties seen :0
[2024-05-21 23:02:42] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 23:02:42] [INFO ] Invariant cache hit.
[2024-05-21 23:02:42] [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 491 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 1051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 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 1 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 1 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 182 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 182 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 39260 steps (668 resets) in 333 ms. (117 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 103 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 80 ms :[p1, p1]
Stuttering acceptance computed with spot in 79 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Product exploration explored 100000 steps with 2211 reset in 412 ms.
Product exploration explored 100000 steps with 2193 reset in 422 ms.
Built C files in :
/tmp/ltsmin10423553529108193885
[2024-05-21 23:02:45] [INFO ] Computing symmetric may disable matrix : 1093 transitions.
[2024-05-21 23:02:45] [INFO ] Computation of Complete disable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:02:45] [INFO ] Computing symmetric may enable matrix : 1093 transitions.
[2024-05-21 23:02:45] [INFO ] Computation of Complete enable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:02:45] [INFO ] Computing Do-Not-Accords matrix : 1093 transitions.
[2024-05-21 23:02:45] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:02:45] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10423553529108193885
Running compilation step : cd /tmp/ltsmin10423553529108193885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10423553529108193885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10423553529108193885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 1 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 31 ms. Remains 219 /221 variables (removed 2) and now considering 1090/1093 (removed 3) transitions.
[2024-05-21 23:02:48] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
// Phase 1: matrix 871 rows 219 cols
[2024-05-21 23:02:48] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 23:02:48] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 23:02:48] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-21 23:02:48] [INFO ] Invariant cache hit.
[2024-05-21 23:02:48] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 23:02:49] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-05-21 23:02:50] [INFO ] Redundant transitions in 717 ms returned []
Running 1089 sub problems to find dead transitions.
[2024-05-21 23:02:50] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-21 23:02:50] [INFO ] Invariant cache hit.
[2024-05-21 23:02:50] [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 30029 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
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 64175ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 64184ms
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 65731 ms. Remains : 219/221 places, 1090/1093 transitions.
Built C files in :
/tmp/ltsmin4684305127753856003
[2024-05-21 23:03:54] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-21 23:03:54] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:54] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-21 23:03:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:54] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-21 23:03:54] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:54] [INFO ] Built C files in 314ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4684305127753856003
Running compilation step : cd /tmp/ltsmin4684305127753856003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4684305127753856003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4684305127753856003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 23:03:58] [INFO ] Flatten gal took : 54 ms
[2024-05-21 23:03:58] [INFO ] Flatten gal took : 52 ms
[2024-05-21 23:03:58] [INFO ] Time to serialize gal into /tmp/LTL7960075149312308430.gal : 21 ms
[2024-05-21 23:03:58] [INFO ] Time to serialize properties into /tmp/LTL4043292185916137015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7960075149312308430.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13617825522413712405.hoa' '-atoms' '/tmp/LTL4043292185916137015.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4043292185916137015.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13617825522413712405.hoa
Detected timeout of ITS tools.
[2024-05-21 23:04:13] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:04:13] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:04:13] [INFO ] Time to serialize gal into /tmp/LTL158508410076080547.gal : 11 ms
[2024-05-21 23:04:13] [INFO ] Time to serialize properties into /tmp/LTL14372918279671409393.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL158508410076080547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14372918279671409393.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(p40==1)"))||(G(F("((((p355!=1)||(p396!=1))||((p568!=1)||(p1863!=1)))||(p1884!=1))")))))
Formula 0 simplified : F!"(p40==1)" & FG!"((((p355!=1)||(p396!=1))||((p568!=1)||(p1863!=1)))||(p1884!=1))"
Detected timeout of ITS tools.
[2024-05-21 23:04:29] [INFO ] Flatten gal took : 55 ms
[2024-05-21 23:04:29] [INFO ] Applying decomposition
[2024-05-21 23:04:29] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2654312475225868961.txt' '-o' '/tmp/graph2654312475225868961.bin' '-w' '/tmp/graph2654312475225868961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2654312475225868961.bin' '-l' '-1' '-v' '-w' '/tmp/graph2654312475225868961.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:04:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:04:29] [INFO ] Removed a total of 2289 redundant transitions.
[2024-05-21 23:04:30] [INFO ] Flatten gal took : 655 ms
[2024-05-21 23:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 67 ms.
[2024-05-21 23:04:30] [INFO ] Time to serialize gal into /tmp/LTL13640281963414229944.gal : 35 ms
[2024-05-21 23:04:30] [INFO ] Time to serialize properties into /tmp/LTL17461013574767963014.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13640281963414229944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17461013574767963014.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G("(i0.u0.p40==1)"))||(G(F("((((i1.u7.p355!=1)||(i1.u8.p396!=1))||((i1.u11.p568!=1)||(u45.p1863!=1)))||(u45.p1884!=1))")))))
Formula 0 simplified : F!"(i0.u0.p40==1)" & FG!"((((i1.u7.p355!=1)||(i1.u8.p396!=1))||((i1.u11.p568!=1)||(u45.p1863!=1)))||(u45.p1884!=1))"
Reverse transition relation is NOT exact ! Due to transitions t5952_t1168_t1161, t5941_t976, t5266_t1127_t937_t749_t560_t370_t180, u45.t3, i0.t1091_t1127, ...1799
Computing Next relation with stutter on 1.97973e+14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
155 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.61865,80048,1,0,89485,56960,6251,317531,2784,210689,90905
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6b-LTLFireability-13 finished in 256044 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 184 ms. Remains 1120 /1142 variables (removed 22) and now considering 1930/6036 (removed 4106) transitions.
// Phase 1: matrix 1930 rows 1120 cols
[2024-05-21 23:04:32] [INFO ] Computed 18 invariants in 11 ms
[2024-05-21 23:04:33] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-21 23:04:33] [INFO ] Invariant cache hit.
[2024-05-21 23:04:34] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-05-21 23:04:34] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1743 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 27 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 1954 ms. Remains : 1119/1142 places, 1930/6036 transitions.
Stuttering acceptance computed with spot in 193 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 2175 ms.
All properties solved by simple procedures.
Total runtime 445320 ms.
BK_STOP 1716332674788
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r070-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 '
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 ;