About the Execution of 2023-gold for CloudDeployment-PT-2a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
364.483 | 17751.00 | 29418.00 | 493.90 | FFFFFFTFFFFFTFFF | 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.r087-tall-171620522000338.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 gold2023
Input is CloudDeployment-PT-2a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522000338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 15:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 15:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 51K 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-2a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-2a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716261501804
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:18:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:18:23] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-21 03:18:23] [INFO ] Transformed 69 places.
[2024-05-21 03:18:23] [INFO ] Transformed 174 transitions.
[2024-05-21 03:18:23] [INFO ] Found NUPN structural information;
[2024-05-21 03:18:23] [INFO ] Parsed PT model containing 69 places and 174 transitions and 821 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA CloudDeployment-PT-2a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 160/160 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 160
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 17 place count 65 transition count 147
Applied a total of 17 rules in 15 ms. Remains 65 /69 variables (removed 4) and now considering 147/160 (removed 13) transitions.
[2024-05-21 03:18:23] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
// Phase 1: matrix 100 rows 65 cols
[2024-05-21 03:18:23] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 03:18:23] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 03:18:23] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:23] [INFO ] Invariant cache hit.
[2024-05-21 03:18:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:23] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 03:18:23] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:23] [INFO ] Invariant cache hit.
[2024-05-21 03:18:23] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 147/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 65/69 places, 147/160 transitions.
Support contains 27 out of 65 places after structural reductions.
[2024-05-21 03:18:24] [INFO ] Flatten gal took : 33 ms
[2024-05-21 03:18:24] [INFO ] Flatten gal took : 15 ms
[2024-05-21 03:18:24] [INFO ] Input system was already deterministic with 147 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 27) seen :24
Finished Best-First random walk after 2943 steps, including 19 resets, run visited all 3 properties in 10 ms. (steps per millisecond=294 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1)||(X(G(p2))&&G(p3)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:25] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:25] [INFO ] Invariant cache hit.
[2024-05-21 03:18:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 03:18:25] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:25] [INFO ] Invariant cache hit.
[2024-05-21 03:18:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:25] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-21 03:18:25] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:25] [INFO ] Invariant cache hit.
[2024-05-21 03:18:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 65/65 places, 147/147 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 458 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s17 0) (EQ s12 0)), p3:(EQ s48 0), p1:(EQ s11 0), p2:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 31 stabilizing places and 79 stable transitions
Detected a total of 31/65 stabilizing places and 79/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p0), (X p1), true, (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p3 p2))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 159 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 649 steps, including 20 resets, run visited all 11 properties in 31 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p0), (X p1), true, (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p3 p2))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND p1 p3 (NOT p0))), (F (AND p1 (NOT p3) (NOT p0))), (F (NOT p0)), (F (AND p3 (NOT p0))), (F (AND (NOT p3) (NOT p0))), (F (NOT (AND p2 p3))), (F (AND (NOT p1) p2 p3)), (F (OR (NOT p2) (NOT p3))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 23 factoid took 531 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 157 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:27] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:27] [INFO ] Invariant cache hit.
[2024-05-21 03:18:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 03:18:27] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:27] [INFO ] Invariant cache hit.
[2024-05-21 03:18:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:27] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-21 03:18:27] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:27] [INFO ] Invariant cache hit.
[2024-05-21 03:18:27] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 65/65 places, 147/147 transitions.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 31 stabilizing places and 79 stable transitions
Detected a total of 31/65 stabilizing places and 79/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 160 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 2480 steps, including 80 resets, run visited all 11 properties in 20 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) p3 p1)), (F (AND (NOT p0) (NOT p3) p1)), (F (NOT p0)), (F (AND (NOT p0) p3)), (F (AND (NOT p0) (NOT p3))), (F (NOT (AND p3 p2))), (F (AND p3 (NOT p1) p2)), (F (OR (NOT p3) (NOT p2))), (F (OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 495 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 206 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 183 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Applying partial POR strategy [true, false, false, true, false]
Stuttering acceptance computed with spot in 189 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 64 edges and 65 vertex of which 12 / 65 are part of one of the 4 SCC in 5 ms
Free SCC test removed 8 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 56 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 56 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 56 transition count 146
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 35 place count 56 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 56 transition count 120
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 37 rules in 32 ms. Remains 56 /65 variables (removed 9) and now considering 120/147 (removed 27) transitions.
[2024-05-21 03:18:29] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-21 03:18:29] [INFO ] Flow matrix only has 74 transitions (discarded 46 similar events)
// Phase 1: matrix 74 rows 56 cols
[2024-05-21 03:18:29] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 03:18:29] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/65 places, 120/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 56/65 places, 120/147 transitions.
Built C files in :
/tmp/ltsmin2932628457036560527
[2024-05-21 03:18:29] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2932628457036560527
Running compilation step : cd /tmp/ltsmin2932628457036560527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin2932628457036560527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2932628457036560527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13664855931007307756.hoa' '--buchi-type=spotba'
LTSmin run took 228 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2a-LTLFireability-00 finished in 5538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(p1)||G(p2))))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:30] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
// Phase 1: matrix 100 rows 65 cols
[2024-05-21 03:18:30] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 03:18:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 03:18:30] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:30] [INFO ] Invariant cache hit.
[2024-05-21 03:18:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-21 03:18:30] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:30] [INFO ] Invariant cache hit.
[2024-05-21 03:18:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s63 1), p1:(EQ s15 1), p2:(AND (EQ s2 1) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-01 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X((p1 U X(G(!p1))))) U X(p2)))'
Support contains 9 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:30] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:30] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), p1, p1]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s14 1) (EQ s58 1) (EQ s63 1)), p2:(AND (EQ s27 1) (EQ s28 1) (EQ s41 1) (EQ s58 1) (EQ s63 1)), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-02 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(G(p0))||X(G(X(p1)))) U p2)))'
Support contains 5 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 68 edges and 65 vertex of which 15 / 65 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 54 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 122
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 48 transition count 128
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 36 place count 48 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 47 transition count 106
Applied a total of 38 rules in 33 ms. Remains 47 /65 variables (removed 18) and now considering 106/147 (removed 41) transitions.
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
// Phase 1: matrix 58 rows 47 cols
[2024-05-21 03:18:31] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-21 03:18:31] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/65 places, 106/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 47/65 places, 106/147 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s2 1) (EQ s11 1) (EQ s40 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-03 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||F(p1)))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 78 edges and 65 vertex of which 18 / 65 are part of one of the 5 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 45 transition count 118
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 45 transition count 98
Applied a total of 35 rules in 18 ms. Remains 45 /65 variables (removed 20) and now considering 98/147 (removed 49) transitions.
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 53 transitions (discarded 45 similar events)
// Phase 1: matrix 53 rows 45 cols
[2024-05-21 03:18:31] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 53 transitions (discarded 45 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-21 03:18:31] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-21 03:18:31] [INFO ] Flow matrix only has 53 transitions (discarded 45 similar events)
[2024-05-21 03:18:31] [INFO ] Invariant cache hit.
[2024-05-21 03:18:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/65 places, 98/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 45/65 places, 98/147 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s4 1), p0:(AND (EQ s1 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-04 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 77 edges and 65 vertex of which 20 / 65 are part of one of the 6 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 49 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 49 transition count 107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 15 place count 44 transition count 112
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 44 transition count 96
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 44 transition count 96
Applied a total of 33 rules in 22 ms. Remains 44 /65 variables (removed 21) and now considering 96/147 (removed 51) transitions.
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 53 transitions (discarded 43 similar events)
// Phase 1: matrix 53 rows 44 cols
[2024-05-21 03:18:32] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 53 transitions (discarded 43 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-21 03:18:32] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 53 transitions (discarded 43 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/65 places, 96/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 44/65 places, 96/147 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s7 0)), p1:(AND (EQ s17 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-05 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
// Phase 1: matrix 100 rows 65 cols
[2024-05-21 03:18:32] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s63 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-08 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 03:18:32] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s6 1), p1:(AND (EQ s2 1) (EQ s4 1)), p2:(AND (EQ s27 1) (EQ s28 1) (EQ s52 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 31 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 294 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:18:33] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:33] [INFO ] Invariant cache hit.
[2024-05-21 03:18:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:18:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:18:33] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-21 03:18:33] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:18:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:33] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:18:33] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 03:18:33] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 76 edges and 65 vertex of which 18 / 65 are part of one of the 5 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 43 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 203 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 49 transition count 94
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 43 transition count 100
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 43 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 43 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 42 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 42 transition count 79
Applied a total of 41 rules in 25 ms. Remains 42 /65 variables (removed 23) and now considering 79/147 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 42/65 places, 79/147 transitions.
Finished random walk after 5628 steps, including 187 resets, run visited all 1 properties in 10 ms. (steps per millisecond=562 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 349 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:34] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:34] [INFO ] Invariant cache hit.
[2024-05-21 03:18:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 03:18:34] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:34] [INFO ] Invariant cache hit.
[2024-05-21 03:18:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:34] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 03:18:34] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:34] [INFO ] Invariant cache hit.
[2024-05-21 03:18:34] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 65/65 places, 147/147 transitions.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 31 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 313 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:18:35] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:35] [INFO ] Invariant cache hit.
[2024-05-21 03:18:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-21 03:18:35] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:18:35] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:18:35] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:18:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:35] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:18:35] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 03:18:35] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 147/147 transitions.
Graph (trivial) has 76 edges and 65 vertex of which 18 / 65 are part of one of the 5 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 43 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 203 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 49 transition count 94
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 43 transition count 100
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 43 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 43 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 42 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 42 transition count 79
Applied a total of 41 rules in 15 ms. Remains 42 /65 variables (removed 23) and now considering 79/147 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 42/65 places, 79/147 transitions.
Incomplete random walk after 10000 steps, including 333 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2313 steps, run visited all 1 properties in 10 ms. (steps per millisecond=231 )
Probabilistic random walk after 2313 steps, saw 627 distinct states, run finished after 11 ms. (steps per millisecond=210 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 488 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 37 ms.
Built C files in :
/tmp/ltsmin12344291646799122873
[2024-05-21 03:18:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12344291646799122873
Running compilation step : cd /tmp/ltsmin12344291646799122873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin12344291646799122873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12344291646799122873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2583939296525315344.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2a-LTLFireability-09 finished in 4080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:36] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:36] [INFO ] Invariant cache hit.
[2024-05-21 03:18:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 03:18:36] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:36] [INFO ] Invariant cache hit.
[2024-05-21 03:18:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:36] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 03:18:36] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:36] [INFO ] Invariant cache hit.
[2024-05-21 03:18:37] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s14 1) (EQ s27 1) (EQ s28 1) (EQ s40 1) (EQ s58 1) (EQ s64 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s14 1) (EQ s27 1) (EQ s28 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-11 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0||F(G(!p1)))&&F(!p1))||G(!p0))))'
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:37] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:37] [INFO ] Invariant cache hit.
[2024-05-21 03:18:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 03:18:37] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:37] [INFO ] Invariant cache hit.
[2024-05-21 03:18:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:37] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 03:18:37] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:37] [INFO ] Invariant cache hit.
[2024-05-21 03:18:37] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p0)]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s13 1) (EQ s58 1) (EQ s63 1)), p1:(AND (EQ s27 1) (EQ s28 1) (EQ s43 1) (EQ s58 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Computed a total of 31 stabilizing places and 79 stable transitions
Graph (complete) has 437 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 31 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2a-LTLFireability-12 finished in 1117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 03:18:38] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:38] [INFO ] Invariant cache hit.
[2024-05-21 03:18:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 03:18:38] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:38] [INFO ] Invariant cache hit.
[2024-05-21 03:18:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:18:38] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-21 03:18:38] [INFO ] Flow matrix only has 100 transitions (discarded 47 similar events)
[2024-05-21 03:18:38] [INFO ] Invariant cache hit.
[2024-05-21 03:18:38] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 65/65 places, 147/147 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s21 0), p0:(AND (EQ s27 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2a-LTLFireability-15 finished in 242 ms.
All properties solved by simple procedures.
Total runtime 15296 ms.
BK_STOP 1716261519555
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-2a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is CloudDeployment-PT-2a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620522000338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-2a.tgz
mv CloudDeployment-PT-2a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;