fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r070-tall-171620506200587
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CloudDeployment-PT-5a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1435.823 487967.00 633709.00 1301.80 FFFFFFFFFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620506200587.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-5a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506200587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 230K 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-5a-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716328431152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 21:53:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:53:52] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-21 21:53:52] [INFO ] Transformed 180 places.
[2024-05-21 21:53:52] [INFO ] Transformed 675 transitions.
[2024-05-21 21:53:52] [INFO ] Found NUPN structural information;
[2024-05-21 21:53:52] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA CloudDeployment-PT-5a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 595/595 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 171 transition count 595
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 169 transition count 593
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 169 transition count 593
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 168 transition count 592
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 168 transition count 592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 167 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 167 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 72 place count 167 transition count 536
Applied a total of 72 rules in 71 ms. Remains 167 /180 variables (removed 13) and now considering 536/595 (removed 59) transitions.
[2024-05-21 21:53:52] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
// Phase 1: matrix 297 rows 167 cols
[2024-05-21 21:53:52] [INFO ] Computed 21 invariants in 18 ms
[2024-05-21 21:53:53] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 21:53:53] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2024-05-21 21:53:53] [INFO ] Invariant cache hit.
[2024-05-21 21:53:53] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-21 21:53:53] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-05-21 21:53:53] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2024-05-21 21:53:53] [INFO ] Invariant cache hit.
[2024-05-21 21:53:53] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 296/462 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 535 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (OVERLAPS) 1/464 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 316 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 167/167 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 296/462 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 535/849 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (OVERLAPS) 1/464 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 851 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 167/167 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60765ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60786ms
Starting structural reductions in LTL mode, iteration 1 : 167/180 places, 536/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61428 ms. Remains : 167/180 places, 536/595 transitions.
Support contains 24 out of 167 places after structural reductions.
[2024-05-21 21:54:54] [INFO ] Flatten gal took : 66 ms
[2024-05-21 21:54:54] [INFO ] Flatten gal took : 38 ms
[2024-05-21 21:54:54] [INFO ] Input system was already deterministic with 536 transitions.
RANDOM walk for 40000 steps (534 resets) in 1818 ms. (21 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40003 steps (72 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2024-05-21 21:54:55] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2024-05-21 21:54:55] [INFO ] Invariant cache hit.
[2024-05-21 21:54:55] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/166 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/462 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/463 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/464 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/464 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 167/167 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/166 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/462 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/463 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/464 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/464 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 167/167 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 536/536 transitions.
Graph (trivial) has 199 edges and 167 vertex of which 49 / 167 are part of one of the 15 SCC in 3 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 137 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 399
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 126 transition count 368
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 126 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 125 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 125 transition count 367
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 46 place count 110 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 126 place count 110 transition count 332
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 131 place count 110 transition count 358
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 136 place count 105 transition count 358
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 105 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 104 transition count 357
Applied a total of 138 rules in 105 ms. Remains 104 /167 variables (removed 63) and now considering 357/536 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 104/167 places, 357/536 transitions.
RANDOM walk for 40000 steps (703 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (101 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1360130 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1360130 steps, saw 226720 distinct states, run finished after 3005 ms. (steps per millisecond=452 ) properties seen :0
[2024-05-21 21:54:58] [INFO ] Flow matrix only has 181 transitions (discarded 176 similar events)
// Phase 1: matrix 181 rows 104 cols
[2024-05-21 21:54:58] [INFO ] Computed 20 invariants in 6 ms
[2024-05-21 21:54:58] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/104 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 181/285 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 104/104 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/104 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 181/285 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 104/104 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudDeployment-PT-5a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 366 stable transitions
Graph (complete) has 1524 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Graph (trivial) has 201 edges and 167 vertex of which 50 / 167 are part of one of the 15 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 124 transition count 404
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 124 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 123 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 403
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 45 place count 108 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 125 place count 108 transition count 368
Applied a total of 125 rules in 40 ms. Remains 108 /167 variables (removed 59) and now considering 368/536 (removed 168) transitions.
[2024-05-21 21:54:59] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 108 cols
[2024-05-21 21:54:59] [INFO ] Computed 20 invariants in 3 ms
[2024-05-21 21:54:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 21:54:59] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-21 21:54:59] [INFO ] Invariant cache hit.
[2024-05-21 21:54:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:54:59] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 21:54:59] [INFO ] Redundant transitions in 279 ms returned []
Running 337 sub problems to find dead transitions.
[2024-05-21 21:54:59] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-21 21:54:59] [INFO ] Invariant cache hit.
[2024-05-21 21:54:59] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 5/108 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 153/261 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 134 constraints, problems are : Problem set: 0 solved, 337 unsolved in 8026 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 5/108 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 153/261 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 337/471 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 471 constraints, problems are : Problem set: 0 solved, 337 unsolved in 11780 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints]
After SMT, in 20058ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 20062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/167 places, 368/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20601 ms. Remains : 108/167 places, 368/536 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-01 finished in 20907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Graph (trivial) has 196 edges and 167 vertex of which 47 / 167 are part of one of the 15 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 128 transition count 423
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 128 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 127 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 127 transition count 422
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 43 place count 112 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 124 place count 112 transition count 386
Applied a total of 124 rules in 41 ms. Remains 112 /167 variables (removed 55) and now considering 386/536 (removed 150) transitions.
[2024-05-21 21:55:20] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
// Phase 1: matrix 165 rows 112 cols
[2024-05-21 21:55:20] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 21:55:20] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 21:55:20] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:20] [INFO ] Invariant cache hit.
[2024-05-21 21:55:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:55:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-21 21:55:20] [INFO ] Redundant transitions in 275 ms returned []
Running 355 sub problems to find dead transitions.
[2024-05-21 21:55:20] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:20] [INFO ] Invariant cache hit.
[2024-05-21 21:55:20] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 138 constraints, problems are : Problem set: 0 solved, 355 unsolved in 8802 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 355/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 493 constraints, problems are : Problem set: 0 solved, 355 unsolved in 13058 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
After SMT, in 22131ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 22136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/167 places, 386/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22983 ms. Remains : 112/167 places, 386/536 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Computed a total of 63 stabilizing places and 289 stable transitions
Graph (complete) has 1232 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 289 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (750 resets) in 470 ms. (84 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (116 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (119 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (114 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2024-05-21 21:55:43] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:43] [INFO ] Invariant cache hit.
[2024-05-21 21:55:43] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/112 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 113 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/112 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 140 constraints, problems are : Problem set: 1 solved, 2 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 399 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 386/386 transitions.
Applied a total of 0 rules in 11 ms. Remains 112 /112 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2024-05-21 21:55:44] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:44] [INFO ] Invariant cache hit.
[2024-05-21 21:55:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:55:44] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:44] [INFO ] Invariant cache hit.
[2024-05-21 21:55:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:55:45] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 21:55:45] [INFO ] Redundant transitions in 247 ms returned []
Running 355 sub problems to find dead transitions.
[2024-05-21 21:55:45] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:55:45] [INFO ] Invariant cache hit.
[2024-05-21 21:55:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 138 constraints, problems are : Problem set: 0 solved, 355 unsolved in 8745 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 355/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 493 constraints, problems are : Problem set: 0 solved, 355 unsolved in 12916 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
After SMT, in 21933ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 21937ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22401 ms. Remains : 112/112 places, 386/386 transitions.
Computed a total of 63 stabilizing places and 289 stable transitions
Graph (complete) has 1232 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 63 stabilizing places and 289 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (741 resets) in 121 ms. (327 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (116 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (120 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
[2024-05-21 21:56:07] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:56:07] [INFO ] Invariant cache hit.
[2024-05-21 21:56:07] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/112 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 113 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/112 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 140 constraints, problems are : Problem set: 1 solved, 2 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 252ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 347 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Built C files in :
/tmp/ltsmin1577829573295337370
[2024-05-21 21:56:08] [INFO ] Computing symmetric may disable matrix : 386 transitions.
[2024-05-21 21:56:08] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:08] [INFO ] Computing symmetric may enable matrix : 386 transitions.
[2024-05-21 21:56:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:08] [INFO ] Computing Do-Not-Accords matrix : 386 transitions.
[2024-05-21 21:56:08] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:08] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1577829573295337370
Running compilation step : cd /tmp/ltsmin1577829573295337370;'/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 1312 ms.
Running link step : cd /tmp/ltsmin1577829573295337370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1577829573295337370;'/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/stateBased18236568832144284969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 386/386 transitions.
Applied a total of 0 rules in 19 ms. Remains 112 /112 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2024-05-21 21:56:23] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:56:23] [INFO ] Invariant cache hit.
[2024-05-21 21:56:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 21:56:23] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:56:23] [INFO ] Invariant cache hit.
[2024-05-21 21:56:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:56:24] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 21:56:24] [INFO ] Redundant transitions in 213 ms returned []
Running 355 sub problems to find dead transitions.
[2024-05-21 21:56:24] [INFO ] Flow matrix only has 165 transitions (discarded 221 similar events)
[2024-05-21 21:56:24] [INFO ] Invariant cache hit.
[2024-05-21 21:56:24] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 138 constraints, problems are : Problem set: 0 solved, 355 unsolved in 8854 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 164/276 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 355/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 493 constraints, problems are : Problem set: 0 solved, 355 unsolved in 13127 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
After SMT, in 22288ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 22292ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22738 ms. Remains : 112/112 places, 386/386 transitions.
Built C files in :
/tmp/ltsmin12963260075474221509
[2024-05-21 21:56:46] [INFO ] Computing symmetric may disable matrix : 386 transitions.
[2024-05-21 21:56:46] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:46] [INFO ] Computing symmetric may enable matrix : 386 transitions.
[2024-05-21 21:56:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:46] [INFO ] Computing Do-Not-Accords matrix : 386 transitions.
[2024-05-21 21:56:46] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:46] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12963260075474221509
Running compilation step : cd /tmp/ltsmin12963260075474221509;'/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 1076 ms.
Running link step : cd /tmp/ltsmin12963260075474221509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12963260075474221509;'/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/stateBased12915684007629999392.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:57:01] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:57:01] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:57:01] [INFO ] Time to serialize gal into /tmp/LTL8500635320498390778.gal : 6 ms
[2024-05-21 21:57:01] [INFO ] Time to serialize properties into /tmp/LTL6065807358602998529.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8500635320498390778.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7369106896308509736.hoa' '-atoms' '/tmp/LTL6065807358602998529.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6065807358602998529.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7369106896308509736.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t51, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t1...320
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
4 strongly connected components in search stack
8 transitions explored
5 items max in DFS search stack
805 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.13977,239000,1,0,676,831564,771,424,6960,1.17462e+06,1322
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-5a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudDeployment-PT-5a-LTLCardinality-03 finished in 111028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 164 transition count 534
Applied a total of 5 rules in 9 ms. Remains 164 /167 variables (removed 3) and now considering 534/536 (removed 2) transitions.
[2024-05-21 21:57:11] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2024-05-21 21:57:11] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 21:57:11] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 21:57:11] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:57:11] [INFO ] Invariant cache hit.
[2024-05-21 21:57:11] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-21 21:57:11] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2024-05-21 21:57:11] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:57:11] [INFO ] Invariant cache hit.
[2024-05-21 21:57:11] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (OVERLAPS) 1/459 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 843 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
After SMT, in 60613ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 164/167 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61013 ms. Remains : 164/167 places, 534/536 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-05 finished in 61151 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 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Graph (trivial) has 199 edges and 167 vertex of which 50 / 167 are part of one of the 15 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 125 transition count 405
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 125 transition count 405
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 39 place count 111 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 109 place count 111 transition count 372
Applied a total of 109 rules in 27 ms. Remains 111 /167 variables (removed 56) and now considering 372/536 (removed 164) transitions.
[2024-05-21 21:58:12] [INFO ] Flow matrix only has 158 transitions (discarded 214 similar events)
// Phase 1: matrix 158 rows 111 cols
[2024-05-21 21:58:12] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 21:58:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:58:12] [INFO ] Flow matrix only has 158 transitions (discarded 214 similar events)
[2024-05-21 21:58:12] [INFO ] Invariant cache hit.
[2024-05-21 21:58:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:58:12] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-21 21:58:12] [INFO ] Redundant transitions in 212 ms returned []
Running 341 sub problems to find dead transitions.
[2024-05-21 21:58:12] [INFO ] Flow matrix only has 158 transitions (discarded 214 similar events)
[2024-05-21 21:58:12] [INFO ] Invariant cache hit.
[2024-05-21 21:58:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 157/268 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 137 constraints, problems are : Problem set: 0 solved, 341 unsolved in 7980 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 111/111 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 157/268 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 341/478 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/269 variables, and 478 constraints, problems are : Problem set: 0 solved, 341 unsolved in 12575 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 111/111 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
After SMT, in 20772ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 20775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/167 places, 372/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21246 ms. Remains : 111/167 places, 372/536 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 67 ms.
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-06 finished in 21421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 164 transition count 534
Applied a total of 5 rules in 7 ms. Remains 164 /167 variables (removed 3) and now considering 534/536 (removed 2) transitions.
[2024-05-21 21:58:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2024-05-21 21:58:33] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 21:58:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 21:58:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:58:33] [INFO ] Invariant cache hit.
[2024-05-21 21:58:33] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-21 21:58:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2024-05-21 21:58:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:58:33] [INFO ] Invariant cache hit.
[2024-05-21 21:58:33] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (OVERLAPS) 1/459 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 843 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 164/167 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60877 ms. Remains : 164/167 places, 534/536 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
RANDOM walk for 368 steps (3 resets) in 9 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5a-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5a-LTLCardinality-09 finished in 61479 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(!p0) U p1))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Graph (trivial) has 196 edges and 167 vertex of which 50 / 167 are part of one of the 15 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 124 transition count 404
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 124 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 123 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 403
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 41 place count 110 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 0 with 69 rules applied. Total rules applied 110 place count 110 transition count 370
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 110 transition count 370
Applied a total of 111 rules in 28 ms. Remains 110 /167 variables (removed 57) and now considering 370/536 (removed 166) transitions.
[2024-05-21 21:59:35] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
// Phase 1: matrix 156 rows 110 cols
[2024-05-21 21:59:35] [INFO ] Computed 20 invariants in 3 ms
[2024-05-21 21:59:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 21:59:35] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
[2024-05-21 21:59:35] [INFO ] Invariant cache hit.
[2024-05-21 21:59:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:59:35] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-21 21:59:35] [INFO ] Redundant transitions in 215 ms returned []
Running 339 sub problems to find dead transitions.
[2024-05-21 21:59:35] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
[2024-05-21 21:59:35] [INFO ] Invariant cache hit.
[2024-05-21 21:59:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 155/265 variables, 110/130 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 136 constraints, problems are : Problem set: 0 solved, 339 unsolved in 8135 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 155/265 variables, 110/130 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 339/475 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 475 constraints, problems are : Problem set: 0 solved, 339 unsolved in 13023 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 0/0 constraints]
After SMT, in 21381ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 21386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/167 places, 370/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21855 ms. Remains : 110/167 places, 370/536 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), p0]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-10 finished in 21954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 164 transition count 534
Applied a total of 5 rules in 9 ms. Remains 164 /167 variables (removed 3) and now considering 534/536 (removed 2) transitions.
[2024-05-21 21:59:57] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2024-05-21 21:59:57] [INFO ] Computed 20 invariants in 3 ms
[2024-05-21 21:59:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:59:57] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:59:57] [INFO ] Invariant cache hit.
[2024-05-21 21:59:57] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-21 21:59:57] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2024-05-21 21:59:57] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 21:59:57] [INFO ] Invariant cache hit.
[2024-05-21 21:59:57] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (OVERLAPS) 1/459 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 843 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 164/167 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60843 ms. Remains : 164/167 places, 534/536 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-12 finished in 60973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!X(p1) U p2)&&p0))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 536/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 164 transition count 534
Applied a total of 5 rules in 7 ms. Remains 164 /167 variables (removed 3) and now considering 534/536 (removed 2) transitions.
[2024-05-21 22:00:58] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 22:00:58] [INFO ] Invariant cache hit.
[2024-05-21 22:00:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 22:00:58] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 22:00:58] [INFO ] Invariant cache hit.
[2024-05-21 22:00:58] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-21 22:00:58] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2024-05-21 22:00:58] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2024-05-21 22:00:58] [INFO ] Invariant cache hit.
[2024-05-21 22:00:58] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 8 (OVERLAPS) 1/459 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 843 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60509ms
Starting structural reductions in LTL mode, iteration 1 : 164/167 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 164/167 places, 534/536 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) p1)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-14 finished in 60991 ms.
All properties solved by simple procedures.
Total runtime 486749 ms.

BK_STOP 1716328919119

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-5a"
export BK_EXAMINATION="LTLCardinality"
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-5a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620506200587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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