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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K 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 50K 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.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 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 166K 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-2b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716323914269

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-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 20:38:35] [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 20:38:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:38:35] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-21 20:38:35] [INFO ] Transformed 556 places.
[2024-05-21 20:38:35] [INFO ] Transformed 684 transitions.
[2024-05-21 20:38:35] [INFO ] Found NUPN structural information;
[2024-05-21 20:38:35] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CloudDeployment-PT-2b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 553 transition count 684
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 129 place count 427 transition count 547
Iterating global reduction 1 with 126 rules applied. Total rules applied 255 place count 427 transition count 547
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 297 place count 385 transition count 505
Iterating global reduction 1 with 42 rules applied. Total rules applied 339 place count 385 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 341 place count 385 transition count 503
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 346 place count 380 transition count 498
Iterating global reduction 2 with 5 rules applied. Total rules applied 351 place count 380 transition count 498
Applied a total of 351 rules in 119 ms. Remains 380 /556 variables (removed 176) and now considering 498/684 (removed 186) transitions.
// Phase 1: matrix 498 rows 380 cols
[2024-05-21 20:38:36] [INFO ] Computed 6 invariants in 27 ms
[2024-05-21 20:38:36] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-21 20:38:36] [INFO ] Invariant cache hit.
[2024-05-21 20:38:36] [INFO ] Implicit Places using invariants and state equation in 296 ms returned [8, 16, 184, 192]
[2024-05-21 20:38:36] [INFO ] Actually due to overlaps returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 717 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 379/556 places, 498/684 transitions.
Applied a total of 0 rules in 11 ms. Remains 379 /379 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 863 ms. Remains : 379/556 places, 498/684 transitions.
Support contains 23 out of 379 places after structural reductions.
[2024-05-21 20:38:36] [INFO ] Flatten gal took : 79 ms
[2024-05-21 20:38:37] [INFO ] Flatten gal took : 41 ms
[2024-05-21 20:38:37] [INFO ] Input system was already deterministic with 498 transitions.
RANDOM walk for 40000 steps (621 resets) in 1138 ms. (35 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40003 steps (150 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (145 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (143 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (147 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (141 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (152 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (102 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (144 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
// Phase 1: matrix 498 rows 379 cols
[2024-05-21 20:38:38] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/253 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 215/468 variables, 91/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 180/648 variables, 80/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 160/808 variables, 76/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/808 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 53/861 variables, 38/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 12/873 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/877 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/877 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/877 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 384 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1072 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/253 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 215/468 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 180/648 variables, 80/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 160/808 variables, 76/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 53/861 variables, 38/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 12/873 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 4/877 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/877 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/877 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 393 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1956 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3103ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 5 properties in 1621 ms.
Support contains 9 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 380 edges and 379 vertex of which 129 / 379 are part of one of the 14 SCC in 4 ms
Free SCC test removed 115 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (complete) has 704 edges and 264 vertex of which 257 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 257 transition count 236
Reduce places removed 108 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 111 rules applied. Total rules applied 226 place count 149 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 228 place count 147 transition count 233
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 228 place count 147 transition count 213
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 268 place count 127 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 270 place count 125 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 125 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 272 place count 125 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 123 transition count 209
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 346 place count 88 transition count 174
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 376 place count 73 transition count 215
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 386 place count 73 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 406 place count 73 transition count 185
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 421 place count 73 transition count 170
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 447 place count 58 transition count 159
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 450 place count 55 transition count 152
Iterating global reduction 5 with 3 rules applied. Total rules applied 453 place count 55 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 455 place count 55 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 459 place count 55 transition count 146
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 461 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 464 place count 55 transition count 143
Applied a total of 464 rules in 96 ms. Remains 55 /379 variables (removed 324) and now considering 143/498 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 55/379 places, 143/498 transitions.
RANDOM walk for 40000 steps (1269 resets) in 579 ms. (68 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (177 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (257 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
[2024-05-21 20:38:43] [INFO ] Flow matrix only has 114 transitions (discarded 29 similar events)
// Phase 1: matrix 114 rows 55 cols
[2024-05-21 20:38:43] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:38:43] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/164 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/169 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 38/38 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:38:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 113/164 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 29/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/169 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/169 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 102 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 255 steps, including 21 resets, run visited all 1 properties in 1 ms. (steps per millisecond=255 )
Parikh walk visited 2 properties in 10 ms.
Computed a total of 59 stabilizing places and 111 stable transitions
Graph (complete) has 886 edges and 379 vertex of which 372 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 15 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-21 20:38:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:38:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 20:38:43] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [15, 181, 189]
[2024-05-21 20:38:44] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 15 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-00
Product exploration explored 100000 steps with 33371 reset in 260 ms.
Product exploration explored 100000 steps with 33388 reset in 190 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 872 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (629 resets) in 531 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (156 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (149 resets) in 92 ms. (430 steps per ms) remains 1/6 properties
// Phase 1: matrix 492 rows 372 cols
[2024-05-21 20:38:45] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/123 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/167 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/392 variables, 114/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 191/583 variables, 92/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 164/747 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/747 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 90/837 variables, 56/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/837 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/856 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/856 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 863/864 variables, and 375 constraints, problems are : Problem set: 1 solved, 0 unsolved in 292 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 371/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 492/492 transitions.
Graph (trivial) has 386 edges and 372 vertex of which 142 / 372 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 702 edges and 246 vertex of which 240 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 239 transition count 248
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 142 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 141 transition count 247
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 198 place count 141 transition count 226
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 240 place count 120 transition count 226
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 314 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 338 place count 71 transition count 223
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 350 place count 71 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 375 place count 71 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 70 transition count 185
Applied a total of 376 rules in 38 ms. Remains 70 /372 variables (removed 302) and now considering 185/492 (removed 307) transitions.
[2024-05-21 20:38:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 70 cols
[2024-05-21 20:38:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:38:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:38:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 20:38:46] [INFO ] Invariant cache hit.
[2024-05-21 20:38:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:38:46] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 20:38:46] [INFO ] Redundant transitions in 98 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-21 20:38:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 20:38:46] [INFO ] Invariant cache hit.
[2024-05-21 20:38:46] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 2/215 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 78 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3344 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/215 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 155/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4482 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 7969ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 7971ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/372 places, 185/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8320 ms. Remains : 70/372 places, 185/492 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (4134 resets) in 480 ms. (83 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (518 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-21 20:38:55] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 20:38:55] [INFO ] Invariant cache hit.
[2024-05-21 20:38:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/85 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/91 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 105/196 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 215/216 variables, and 74 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 2/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 315 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 9799 reset in 249 ms.
Product exploration explored 100000 steps with 9745 reset in 299 ms.
Built C files in :
/tmp/ltsmin7407375349638990605
[2024-05-21 20:38:56] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 20:38:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:56] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 20:38:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:56] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 20:38:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:56] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7407375349638990605
Running compilation step : cd /tmp/ltsmin7407375349638990605;'/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'
Compilation finished in 643 ms.
Running link step : cd /tmp/ltsmin7407375349638990605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7407375349638990605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased514316945484379355.hoa' '--buchi-type=spotba'
LTSmin run took 279 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-00 finished in 13836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G((p0||X(G(p1)))) U (p0&&G((p0||X(G(p1))))))))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 16 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-21 20:38:57] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 20:38:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 20:38:57] [INFO ] Invariant cache hit.
[2024-05-21 20:38:57] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [15, 181, 189]
[2024-05-21 20:38:57] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 6 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-02 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&F(p1))))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 14 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-21 20:38:58] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 20:38:58] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 20:38:58] [INFO ] Invariant cache hit.
[2024-05-21 20:38:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [15, 181, 189]
[2024-05-21 20:38:58] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 373 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 150 ms.
Product exploration explored 100000 steps with 20000 reset in 148 ms.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/373 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (627 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (142 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (138 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (149 resets) in 52 ms. (754 steps per ms) remains 1/3 properties
// Phase 1: matrix 493 rows 373 cols
[2024-05-21 20:38:59] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/145 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/376 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/572 variables, 93/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/744 variables, 74/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/744 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 95/839 variables, 60/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/839 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/858 variables, 12/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/858 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/865 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/866 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/866 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/866 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 373/373 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/145 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 231/376 variables, 116/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/572 variables, 93/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 172/744 variables, 74/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/744 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 95/839 variables, 60/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/858 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/858 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/865 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/865 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/866 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/866 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/866 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 493/493 transitions.
Graph (trivial) has 390 edges and 373 vertex of which 142 / 373 are part of one of the 16 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (complete) has 653 edges and 247 vertex of which 241 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 216 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 216 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 260 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 262 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 264 place count 113 transition count 193
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 268 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 332 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 360 place count 65 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 374 place count 65 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 406 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 426 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 43 rules applied. Total rules applied 469 place count 44 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 470 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 472 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 42 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 486 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 487 place count 41 transition count 87
Applied a total of 487 rules in 41 ms. Remains 41 /373 variables (removed 332) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 41/373 places, 87/493 transitions.
RANDOM walk for 663 steps (23 resets) in 5 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Applied a total of 0 rules in 7 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-21 20:39:00] [INFO ] Invariant cache hit.
[2024-05-21 20:39:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 20:39:00] [INFO ] Invariant cache hit.
[2024-05-21 20:39:01] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [180, 188]
[2024-05-21 20:39:01] [INFO ] Actually due to overlaps returned [180]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/373 places, 493/493 transitions.
Applied a total of 0 rules in 5 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 373 ms. Remains : 372/373 places, 493/493 transitions.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 865 edges and 372 vertex of which 367 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/372 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (629 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (136 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (144 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (138 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1242604 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :2 out of 3
Probabilistic random walk after 1242604 steps, saw 257202 distinct states, run finished after 3004 ms. (steps per millisecond=413 ) properties seen :2
// Phase 1: matrix 493 rows 372 cols
[2024-05-21 20:39:04] [INFO ] Computed 3 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/374 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 197/571 variables, 94/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/743 variables, 74/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/743 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 95/838 variables, 60/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/838 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/857 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/857 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/864 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/865 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/865 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/865 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 372/372 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/139 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 235/374 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 197/571 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 172/743 variables, 74/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 95/838 variables, 60/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/838 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/857 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/857 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/864 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/864 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/865 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 493/493 transitions.
Graph (trivial) has 389 edges and 372 vertex of which 142 / 372 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Graph (complete) has 645 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 215 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 215 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 259 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 263 place count 113 transition count 193
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 267 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 331 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 359 place count 65 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 373 place count 65 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 405 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 425 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 43 rules applied. Total rules applied 468 place count 44 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 469 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 471 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 473 place count 42 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 485 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 486 place count 41 transition count 87
Applied a total of 486 rules in 35 ms. Remains 41 /372 variables (removed 331) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 41/372 places, 87/493 transitions.
RANDOM walk for 137 steps (4 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 120 ms.
Product exploration explored 100000 steps with 20000 reset in 122 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 493/493 transitions.
Graph (trivial) has 385 edges and 372 vertex of which 133 / 372 are part of one of the 15 SCC in 1 ms
Free SCC test removed 118 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (complete) has 711 edges and 254 vertex of which 249 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 249 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 249 transition count 355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 108 place count 249 transition count 368
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 123 place count 249 transition count 368
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 179 place count 193 transition count 312
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 235 place count 193 transition count 312
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 276 place count 193 transition count 312
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 307 place count 162 transition count 281
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 338 place count 162 transition count 281
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 353 place count 162 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 355 place count 162 transition count 369
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 372 place count 145 transition count 315
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 389 place count 145 transition count 315
Deduced a syphon composed of 72 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 419 place count 145 transition count 285
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 423 place count 141 transition count 281
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 427 place count 141 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 429 place count 141 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 433 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 437 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 450 place count 137 transition count 282
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 450 rules in 64 ms. Remains 137 /372 variables (removed 235) and now considering 282/493 (removed 211) transitions.
[2024-05-21 20:39:06] [INFO ] Redundant transitions in 127 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-21 20:39:06] [INFO ] Flow matrix only has 248 transitions (discarded 34 similar events)
// Phase 1: matrix 248 rows 137 cols
[2024-05-21 20:39:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:39:06] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 2 (OVERLAPS) 247/383 variables, 136/138 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 28/166 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/166 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 1/384 variables, 1/167 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/167 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 1/385 variables, 1/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 168 constraints, problems are : Problem set: 90 solved, 191 unsolved in 8938 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 6/76 variables, 2/2 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 241/317 variables, 76/78 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 28/106 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 191/297 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/297 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 67/384 variables, 61/358 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/358 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/385 variables, 1/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 359 constraints, problems are : Problem set: 90 solved, 191 unsolved in 11680 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 191/281 constraints, Known Traps: 0/0 constraints]
After SMT, in 20803ms problems are : Problem set: 90 solved, 191 unsolved
Search for dead transitions found 90 dead transitions in 20807ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 137/372 places, 192/493 transitions.
Graph (complete) has 478 edges and 137 vertex of which 71 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.2 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 71 /137 variables (removed 66) and now considering 192/192 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/372 places, 192/493 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21020 ms. Remains : 71/372 places, 192/493 transitions.
Built C files in :
/tmp/ltsmin5124101944114629351
[2024-05-21 20:39:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5124101944114629351
Running compilation step : cd /tmp/ltsmin5124101944114629351;'/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'
Compilation finished in 823 ms.
Running link step : cd /tmp/ltsmin5124101944114629351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5124101944114629351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11981125772110217862.hoa' '--buchi-type=spotba'
LTSmin run took 241 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-05 finished in 30818 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)&&X(G(p1)))))'
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 16 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-21 20:39:28] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 20:39:29] [INFO ] Invariant cache hit.
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants and state equation in 273 ms returned [15, 181, 189]
[2024-05-21 20:39:29] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 358 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 5 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 379 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-08 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 22 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-21 20:39:29] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 20:39:29] [INFO ] Invariant cache hit.
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [15, 181, 189]
[2024-05-21 20:39:29] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 394 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 423 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-10
Product exploration explored 100000 steps with 33173 reset in 142 ms.
Product exploration explored 100000 steps with 33208 reset in 145 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (607 resets) in 69 ms. (571 steps per ms) remains 1/4 properties
BEST_FIRST walk for 1748 steps (2 resets) in 5 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Applied a total of 0 rules in 8 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
// Phase 1: matrix 493 rows 373 cols
[2024-05-21 20:39:31] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 20:39:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 20:39:31] [INFO ] Invariant cache hit.
[2024-05-21 20:39:31] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [180, 188]
[2024-05-21 20:39:31] [INFO ] Actually due to overlaps returned [180]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 347 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/373 places, 493/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 372/373 places, 493/493 transitions.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 865 edges and 372 vertex of which 367 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (618 resets) in 76 ms. (519 steps per ms) remains 1/4 properties
BEST_FIRST walk for 2372 steps (3 resets) in 5 ms. (395 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33222 reset in 136 ms.
Product exploration explored 100000 steps with 33383 reset in 137 ms.
Built C files in :
/tmp/ltsmin14645685248519114428
[2024-05-21 20:39:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14645685248519114428
Running compilation step : cd /tmp/ltsmin14645685248519114428;'/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'
Compilation finished in 844 ms.
Running link step : cd /tmp/ltsmin14645685248519114428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14645685248519114428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7062391044657855324.hoa' '--buchi-type=spotba'
LTSmin run took 186 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-10 finished in 4295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||G(p2)))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 17 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-21 20:39:33] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 20:39:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 20:39:33] [INFO ] Invariant cache hit.
[2024-05-21 20:39:34] [INFO ] Implicit Places using invariants and state equation in 302 ms returned [15, 181, 189]
[2024-05-21 20:39:34] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 401 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLFireability-11 finished in 960 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((p0&&G(F(p0))))))'
Support contains 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 18 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
[2024-05-21 20:39:34] [INFO ] Invariant cache hit.
[2024-05-21 20:39:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 20:39:34] [INFO ] Invariant cache hit.
[2024-05-21 20:39:35] [INFO ] Implicit Places using invariants and state equation in 282 ms returned [15, 181, 189]
[2024-05-21 20:39:35] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 383 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 407 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-12
Product exploration explored 100000 steps with 1555 reset in 114 ms.
Product exploration explored 100000 steps with 1543 reset in 122 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (628 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (146 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 169457 steps, run visited all 1 properties in 413 ms. (steps per millisecond=410 )
Probabilistic random walk after 169457 steps, saw 39867 distinct states, run finished after 417 ms. (steps per millisecond=406 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Graph (trivial) has 389 edges and 373 vertex of which 142 / 373 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 704 edges and 247 vertex of which 241 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 240 transition count 246
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 204 place count 139 transition count 246
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 204 place count 139 transition count 225
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 246 place count 118 transition count 225
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 320 place count 81 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 344 place count 69 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 69 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 381 place count 69 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 68 transition count 184
Applied a total of 382 rules in 32 ms. Remains 68 /373 variables (removed 305) and now considering 184/493 (removed 309) transitions.
[2024-05-21 20:39:36] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 68 cols
[2024-05-21 20:39:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:39:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:39:36] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 20:39:36] [INFO ] Invariant cache hit.
[2024-05-21 20:39:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:39:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:39:36] [INFO ] Redundant transitions in 97 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 20:39:36] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 20:39:36] [INFO ] Invariant cache hit.
[2024-05-21 20:39:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/212 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/213 variables, and 76 constraints, problems are : Problem set: 0 solved, 167 unsolved in 2962 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/212 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 156/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/213 variables, and 243 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4225 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 7284ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 7286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/373 places, 184/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7542 ms. Remains : 68/373 places, 184/493 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4152 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (543 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1943 steps, run visited all 1 properties in 6 ms. (steps per millisecond=323 )
Probabilistic random walk after 1943 steps, saw 613 distinct states, run finished after 6 ms. (steps per millisecond=323 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9709 reset in 131 ms.
Stuttering criterion allowed to conclude after 53593 steps with 5190 reset in 75 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-12 finished in 10063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 395 edges and 379 vertex of which 143 / 379 are part of one of the 16 SCC in 0 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 715 edges and 252 vertex of which 245 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 244 transition count 246
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 140 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 139 transition count 245
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 212 place count 139 transition count 226
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 250 place count 120 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 119 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 119 transition count 225
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 326 place count 82 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 350 place count 70 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 356 place count 70 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 70 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 69 transition count 184
Applied a total of 382 rules in 25 ms. Remains 69 /379 variables (removed 310) and now considering 184/498 (removed 314) transitions.
[2024-05-21 20:39:44] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 69 cols
[2024-05-21 20:39:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:39:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:39:44] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 20:39:44] [INFO ] Invariant cache hit.
[2024-05-21 20:39:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:39:45] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 20:39:45] [INFO ] Redundant transitions in 97 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 20:39:45] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 20:39:45] [INFO ] Invariant cache hit.
[2024-05-21 20:39:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/211 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/213 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/214 variables, and 77 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3019 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/211 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/213 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 155/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/214 variables, and 244 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4284 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 7411ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 7413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/379 places, 184/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7658 ms. Remains : 69/379 places, 184/498 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-13 finished in 7773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 385 edges and 379 vertex of which 134 / 379 are part of one of the 15 SCC in 1 ms
Free SCC test removed 119 places
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 731 edges and 260 vertex of which 253 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 253 transition count 254
Reduce places removed 106 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 109 rules applied. Total rules applied 217 place count 147 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 219 place count 145 transition count 251
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 219 place count 145 transition count 232
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 257 place count 126 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 125 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 125 transition count 231
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 339 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 363 place count 73 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 369 place count 73 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 388 place count 73 transition count 195
Applied a total of 388 rules in 16 ms. Remains 73 /379 variables (removed 306) and now considering 195/498 (removed 303) transitions.
[2024-05-21 20:39:52] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
// Phase 1: matrix 157 rows 73 cols
[2024-05-21 20:39:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:39:52] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 20:39:52] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:39:52] [INFO ] Invariant cache hit.
[2024-05-21 20:39:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:39:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-21 20:39:53] [INFO ] Redundant transitions in 140 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 20:39:53] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:39:53] [INFO ] Invariant cache hit.
[2024-05-21 20:39:53] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5732 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 194/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8999 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 14882ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 14884ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/379 places, 195/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15278 ms. Remains : 73/379 places, 195/498 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-14
Product exploration explored 100000 steps with 7482 reset in 161 ms.
Product exploration explored 100000 steps with 7500 reset in 162 ms.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3154 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (360 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2752984 steps, run timeout after 3001 ms. (steps per millisecond=917 ) properties seen :0 out of 1
Probabilistic random walk after 2752984 steps, saw 405212 distinct states, run finished after 3001 ms. (steps per millisecond=917 ) properties seen :0
[2024-05-21 20:40:11] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:40:11] [INFO ] Invariant cache hit.
[2024-05-21 20:40:11] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/230 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 63 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 195/195 transitions.
Applied a total of 0 rules in 6 ms. Remains 73 /73 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 20:40:11] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:40:11] [INFO ] Invariant cache hit.
[2024-05-21 20:40:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:40:11] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:40:11] [INFO ] Invariant cache hit.
[2024-05-21 20:40:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:40:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-21 20:40:12] [INFO ] Redundant transitions in 118 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 20:40:12] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:40:12] [INFO ] Invariant cache hit.
[2024-05-21 20:40:12] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5551 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 194/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8950 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 14630ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 14639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14904 ms. Remains : 73/73 places, 195/195 transitions.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3179 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (357 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2751266 steps, run timeout after 3001 ms. (steps per millisecond=916 ) properties seen :0 out of 1
Probabilistic random walk after 2751266 steps, saw 405062 distinct states, run finished after 3002 ms. (steps per millisecond=916 ) properties seen :0
[2024-05-21 20:40:30] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 20:40:30] [INFO ] Invariant cache hit.
[2024-05-21 20:40:30] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/230 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 474 steps, including 42 resets, run visited all 1 properties in 3 ms. (steps per millisecond=158 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7476 reset in 163 ms.
Product exploration explored 100000 steps with 7393 reset in 167 ms.
Built C files in :
/tmp/ltsmin16916253725021799605
[2024-05-21 20:40:30] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 20:40:30] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:40:30] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 20:40:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:40:30] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 20:40:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:40:30] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16916253725021799605
Running compilation step : cd /tmp/ltsmin16916253725021799605;'/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'
Compilation finished in 480 ms.
Running link step : cd /tmp/ltsmin16916253725021799605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16916253725021799605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5115964174839811516.hoa' '--buchi-type=spotba'
LTSmin run took 545 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-14 finished in 39291 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((F(G(p0))&&(X(p1)||G(p2))))))'
Support contains 7 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 20 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-21 20:40:31] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 20:40:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 20:40:32] [INFO ] Invariant cache hit.
[2024-05-21 20:40:32] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [15, 181, 189]
[2024-05-21 20:40:32] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 314 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-15
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-15 finished in 537 ms.
All properties solved by simple procedures.
Total runtime 117034 ms.

BK_STOP 1716324032541

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-2b"
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-2b, 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-171620506100548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-2b.tgz
mv CloudDeployment-PT-2b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;