Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095200068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudDeployment-PT-6a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095200068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Apr 30 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 11:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 11:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 317K May 10 09:33 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-6a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652558717994

Running Version 202205111006
[2022-05-14 20:05:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 20:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 20:05:21] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2022-05-14 20:05:21] [INFO ] Transformed 221 places.
[2022-05-14 20:05:21] [INFO ] Transformed 908 transitions.
[2022-05-14 20:05:21] [INFO ] Found NUPN structural information;
[2022-05-14 20:05:21] [INFO ] Parsed PT model containing 221 places and 908 transitions in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
FORMULA CloudDeployment-PT-6a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 794/794 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 209 transition count 794
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 205 transition count 790
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 205 transition count 790
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 202 transition count 787
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 202 transition count 787
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 200 transition count 785
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 200 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 784
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 1 with 75 rules applied. Total rules applied 107 place count 199 transition count 709
Applied a total of 107 rules in 145 ms. Remains 199 /221 variables (removed 22) and now considering 709/794 (removed 85) transitions.
[2022-05-14 20:05:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:21] [INFO ] Computed 24 place invariants in 38 ms
[2022-05-14 20:05:22] [INFO ] Implicit Places using invariants in 467 ms returned []
[2022-05-14 20:05:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:22] [INFO ] Computed 24 place invariants in 11 ms
[2022-05-14 20:05:22] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:05:22] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2022-05-14 20:05:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:22] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-14 20:05:23] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 709/794 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/221 places, 709/794 transitions.
Support contains 40 out of 199 places after structural reductions.
[2022-05-14 20:05:24] [INFO ] Flatten gal took : 218 ms
[2022-05-14 20:05:24] [INFO ] Flatten gal took : 135 ms
[2022-05-14 20:05:24] [INFO ] Input system was already deterministic with 709 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-14 20:05:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:25] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-14 20:05:25] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 20:05:25] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-14 20:05:26] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 20:05:26] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:05:26] [INFO ] After 111ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 20:05:26] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-14 20:05:26] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 237 edges and 199 vertex of which 58 / 199 are part of one of the 17 SCC in 16 ms
Free SCC test removed 41 places
Drop transitions removed 131 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 173 transitions.
Graph (complete) has 1055 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 152 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 152 transition count 501
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 24 place count 146 transition count 495
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 60 place count 128 transition count 561
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 168 place count 128 transition count 453
Applied a total of 168 rules in 198 ms. Remains 128 /199 variables (removed 71) and now considering 453/709 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/199 places, 453/709 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Finished Best-First random walk after 1704 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=340 )
FORMULA CloudDeployment-PT-6a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||p1))))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 9 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:05:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:27] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-14 20:05:27] [INFO ] Implicit Places using invariants in 214 ms returned []
[2022-05-14 20:05:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:27] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-14 20:05:27] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:05:28] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2022-05-14 20:05:28] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:28] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s79 1) (EQ s80 1) (EQ s82 1) (EQ s184 1) (EQ s197 1)), p1:(AND (EQ s45 0) (EQ s1 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-00 finished in 1730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F(G((F((F(p0)&&p1))&&p2)))))))'
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 17 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 550
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 550
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 45 place count 136 transition count 606
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 146 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2022-05-14 20:05:29] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:29] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:29] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-14 20:05:29] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:29] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:29] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:29] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2022-05-14 20:05:30] [INFO ] Redundant transitions in 741 ms returned []
[2022-05-14 20:05:30] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:30] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:05:30] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (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=[p2:(OR (EQ s61 0) (EQ s62 0) (EQ s76 0) (EQ s121 0) (EQ s134 0)), p0:(OR (EQ s61 0) (EQ s62 0) (EQ s64 0) (EQ s121 0) (EQ s134 0)), p1:(OR (EQ s1 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 781 ms.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Computed a total of 81 stabilizing places and 400 stable transitions
Graph (complete) has 1628 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 81 stabilizing places and 400 stable transitions
Detected a total of 81/136 stabilizing places and 400/510 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 450 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 158 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 5) seen :3
Finished Best-First random walk after 7235 steps, including 9 resets, run visited all 2 properties in 36 ms. (steps per millisecond=200 )
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 814 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 10 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 510/510 transitions.
Applied a total of 0 rules in 43 ms. Remains 136 /136 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2022-05-14 20:05:34] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:34] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-14 20:05:34] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:34] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-14 20:05:34] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:34] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2022-05-14 20:05:35] [INFO ] Redundant transitions in 628 ms returned []
[2022-05-14 20:05:35] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:35] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:35] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 510/510 transitions.
Computed a total of 81 stabilizing places and 400 stable transitions
Graph (complete) has 1628 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 81 stabilizing places and 400 stable transitions
Detected a total of 81/136 stabilizing places and 400/510 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 158 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-14 20:05:37] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2022-05-14 20:05:37] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:05:37] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-14 20:05:37] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-14 20:05:37] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-14 20:05:37] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:37] [INFO ] After 160ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-14 20:05:37] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-14 20:05:37] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 10 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 510/510 transitions.
Graph (complete) has 981 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 135 transition count 461
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 1 with 10 rules applied. Total rules applied 60 place count 130 transition count 456
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 130 transition count 455
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 130 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 129 transition count 454
Applied a total of 63 rules in 67 ms. Remains 129 /136 variables (removed 7) and now considering 454/510 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/136 places, 454/510 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :2
Finished Best-First random walk after 2647 steps, including 6 resets, run visited all 2 properties in 11 ms. (steps per millisecond=240 )
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 805 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 319 ms.
Built C files in :
/tmp/ltsmin3854700099780195306
[2022-05-14 20:05:40] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2022-05-14 20:05:40] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:05:40] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2022-05-14 20:05:40] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:05:40] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2022-05-14 20:05:40] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:05:40] [INFO ] Built C files in 248ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3854700099780195306
Running compilation step : cd /tmp/ltsmin3854700099780195306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2794 ms.
Running link step : cd /tmp/ltsmin3854700099780195306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin3854700099780195306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3920816016964978588.hoa' '--buchi-type=spotba'
LTSmin run took 1216 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-6a-LTLFireability-02 finished in 15691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U p2)||G(F((X(p1) U p3))))))'
Support contains 11 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 228 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 134 transition count 606
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 151 place count 134 transition count 502
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 134 transition count 502
Applied a total of 153 rules in 90 ms. Remains 134 /199 variables (removed 65) and now considering 502/709 (removed 207) transitions.
[2022-05-14 20:05:44] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:44] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:44] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-14 20:05:44] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:44] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-14 20:05:45] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:45] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2022-05-14 20:05:45] [INFO ] Redundant transitions in 517 ms returned []
[2022-05-14 20:05:45] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:45] [INFO ] Computed 24 place invariants in 6 ms
[2022-05-14 20:05:46] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/199 places, 502/709 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/199 places, 502/709 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s26 1)), p1:(AND (EQ s47 1) (EQ s48 1) (EQ s61 1) (EQ s130 1)), p3:(AND (EQ s47 1) (EQ s48 1) (EQ s56 1) (EQ s119 1) (EQ s132 1)), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-03 finished in 1923 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:05:46] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:46] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:46] [INFO ] Implicit Places using invariants in 125 ms returned []
[2022-05-14 20:05:46] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:46] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:46] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:05:47] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2022-05-14 20:05:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:47] [INFO ] Computed 24 place invariants in 6 ms
[2022-05-14 20:05:47] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s28 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3308 ms.
Product exploration explored 100000 steps with 50000 reset in 3035 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudDeployment-PT-6a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-04 finished in 7716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 236 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 49 place count 133 transition count 607
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 156 place count 133 transition count 500
Applied a total of 156 rules in 81 ms. Remains 133 /199 variables (removed 66) and now considering 500/709 (removed 209) transitions.
[2022-05-14 20:05:54] [INFO ] Flow matrix only has 201 transitions (discarded 299 similar events)
// Phase 1: matrix 201 rows 133 cols
[2022-05-14 20:05:54] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:54] [INFO ] Implicit Places using invariants in 188 ms returned []
[2022-05-14 20:05:54] [INFO ] Flow matrix only has 201 transitions (discarded 299 similar events)
// Phase 1: matrix 201 rows 133 cols
[2022-05-14 20:05:54] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:54] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:55] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2022-05-14 20:05:55] [INFO ] Redundant transitions in 661 ms returned []
[2022-05-14 20:05:55] [INFO ] Flow matrix only has 201 transitions (discarded 299 similar events)
// Phase 1: matrix 201 rows 133 cols
[2022-05-14 20:05:55] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:56] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/199 places, 500/709 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/199 places, 500/709 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-07 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}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s47 1) (EQ s57 1) (EQ s118 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-07 finished in 2015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))&&X(p1)))'
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:05:56] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:56] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:56] [INFO ] Implicit Places using invariants in 170 ms returned []
[2022-05-14 20:05:56] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:56] [INFO ] Computed 24 place invariants in 3 ms
[2022-05-14 20:05:56] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:05:57] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2022-05-14 20:05:57] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:05:57] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:57] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s27 0) (EQ s28 0) (EQ s50 0) (EQ s184 0) (EQ s197 0)) (EQ s131 1) (EQ s132 1) (EQ s147 1) (EQ s184 1) (EQ s197 1)), p1:(AND (EQ s1 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-6a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-08 finished in 1819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 237 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 134 transition count 606
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 151 place count 134 transition count 502
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 134 transition count 502
Applied a total of 153 rules in 88 ms. Remains 134 /199 variables (removed 65) and now considering 502/709 (removed 207) transitions.
[2022-05-14 20:05:58] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:58] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:05:58] [INFO ] Implicit Places using invariants in 176 ms returned []
[2022-05-14 20:05:58] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:58] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:58] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:05:58] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2022-05-14 20:05:59] [INFO ] Redundant transitions in 594 ms returned []
[2022-05-14 20:05:59] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:05:59] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:05:59] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/199 places, 502/709 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/199 places, 502/709 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s31 1) (NEQ s32 1) (NEQ s41 1) (NEQ s119 1) (NEQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 163 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Finished Best-First random walk after 4849 steps, including 6 resets, run visited all 1 properties in 9 ms. (steps per millisecond=538 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 23 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2022-05-14 20:06:01] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:01] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:01] [INFO ] Implicit Places using invariants in 185 ms returned []
[2022-05-14 20:06:01] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:01] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:01] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:06:01] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2022-05-14 20:06:02] [INFO ] Redundant transitions in 483 ms returned []
[2022-05-14 20:06:02] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:02] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:02] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 502/502 transitions.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 6143 steps, including 101 resets, run visited all 1 properties in 35 ms. (steps per millisecond=175 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 0 reset in 283 ms.
Built C files in :
/tmp/ltsmin7802437166717836637
[2022-05-14 20:06:04] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-14 20:06:04] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:04] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-14 20:06:04] [INFO ] Computation of Complete enable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:04] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-14 20:06:04] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:04] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7802437166717836637
Running compilation step : cd /tmp/ltsmin7802437166717836637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2308 ms.
Running link step : cd /tmp/ltsmin7802437166717836637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7802437166717836637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1974537089038575428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 15 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2022-05-14 20:06:19] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:19] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-14 20:06:19] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:19] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:19] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:06:19] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2022-05-14 20:06:20] [INFO ] Redundant transitions in 470 ms returned []
[2022-05-14 20:06:20] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2022-05-14 20:06:20] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:06:20] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin13730949975328422550
[2022-05-14 20:06:20] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2022-05-14 20:06:20] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:20] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2022-05-14 20:06:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:20] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2022-05-14 20:06:20] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:06:20] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13730949975328422550
Running compilation step : cd /tmp/ltsmin13730949975328422550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1959 ms.
Running link step : cd /tmp/ltsmin13730949975328422550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13730949975328422550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7771284576284441047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 20:06:35] [INFO ] Flatten gal took : 51 ms
[2022-05-14 20:06:35] [INFO ] Flatten gal took : 49 ms
[2022-05-14 20:06:35] [INFO ] Time to serialize gal into /tmp/LTL9503112494496753890.gal : 13 ms
[2022-05-14 20:06:35] [INFO ] Time to serialize properties into /tmp/LTL10513651810925016472.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9503112494496753890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10513651810925016472.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9503112...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(p219!=1))"))))
Formula 0 simplified : !FG"((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(p219!=1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...360
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2022-05-14 20:06:50] [INFO ] Flatten gal took : 41 ms
[2022-05-14 20:06:50] [INFO ] Applying decomposition
[2022-05-14 20:06:50] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14729026543048852415.txt' '-o' '/tmp/graph14729026543048852415.bin' '-w' '/tmp/graph14729026543048852415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14729026543048852415.bin' '-l' '-1' '-v' '-w' '/tmp/graph14729026543048852415.weights' '-q' '0' '-e' '0.001'
[2022-05-14 20:06:51] [INFO ] Decomposing Gal with order
[2022-05-14 20:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 20:06:51] [INFO ] Removed a total of 795 redundant transitions.
[2022-05-14 20:06:51] [INFO ] Flatten gal took : 225 ms
[2022-05-14 20:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 28 ms.
[2022-05-14 20:06:51] [INFO ] Time to serialize gal into /tmp/LTL15525857413774333438.gal : 8 ms
[2022-05-14 20:06:51] [INFO ] Time to serialize properties into /tmp/LTL966554631843116010.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15525857413774333438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL966554631843116010.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1552585...245
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i2.u15.p58!=1)||(u46.p60!=1))||((i2.u14.p78!=1)||(u46.p206!=1)))||(u46.p219!=1))"))))
Formula 0 simplified : !FG"((((i2.u15.p58!=1)||(u46.p60!=1))||((i2.u14.p78!=1)||(u46.p206!=1)))||(u46.p219!=1))"
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u46.t2, i0.t207, i0.i0.t204, i0.i0.u0.t183.t208, i0.i0.u3.t199, i1.t172, i1...522
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
84 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,0.88849,41908,1,0,47588,1246,3837,108836,1154,4992,111829
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-09 finished in 54414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(F(p1)&&G(p2))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:06:52] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:06:52] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:52] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-14 20:06:52] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:06:52] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:52] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:06:53] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2022-05-14 20:06:53] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:06:53] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:06:53] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s54 1) (EQ s67 1)), p0:(EQ s41 0), p1:(AND (EQ s53 1) (EQ s54 1) (EQ s74 1) (EQ s184 1) (EQ s197 1))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2905 ms.
Product exploration explored 100000 steps with 50000 reset in 2888 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 12 factoid took 181 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudDeployment-PT-6a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-10 finished in 7329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(X(!((p0 U !p1)&&p2))) U p2))))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:06:59] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:06:59] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:06:59] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-14 20:06:59] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:06:59] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:00] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:07:00] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2022-05-14 20:07:00] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:00] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:07:00] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 238 ms :[p2, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={1} source=2 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s89 1), p1:(AND (EQ s27 1) (EQ s28 1) (EQ s30 1) (EQ s184 1) (EQ s197 1)), p0:(AND (EQ s2 1) (EQ s132 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 20:07:02] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:02] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2022-05-14 20:07:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-14 20:07:02] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-14 20:07:02] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p2 p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND p2 (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F p2), (F (OR (AND p2 p0) (AND p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 546 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[p2, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 219 ms :[p2, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:07:03] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:03] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:04] [INFO ] Implicit Places using invariants in 130 ms returned []
[2022-05-14 20:07:04] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:04] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:04] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:07:04] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2022-05-14 20:07:04] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:04] [INFO ] Computed 24 place invariants in 3 ms
[2022-05-14 20:07:05] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-14 20:07:05] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:05] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:07:05] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-14 20:07:05] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 20:07:06] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-14 20:07:06] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:06] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:07:06] [INFO ] After 63ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:06] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-14 20:07:06] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 231 edges and 199 vertex of which 54 / 199 are part of one of the 16 SCC in 1 ms
Free SCC test removed 38 places
Drop transitions removed 125 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 1067 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 155 transition count 508
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 155 transition count 508
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 24 place count 149 transition count 502
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 60 place count 131 transition count 568
Drop transitions removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 169 place count 131 transition count 459
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 171 place count 130 transition count 458
Applied a total of 171 rules in 47 ms. Remains 130 /199 variables (removed 69) and now considering 458/709 (removed 251) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/199 places, 458/709 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641487 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641487 steps, saw 114707 distinct states, run finished after 3002 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 20:07:09] [INFO ] Flow matrix only has 200 transitions (discarded 258 similar events)
// Phase 1: matrix 200 rows 130 cols
[2022-05-14 20:07:09] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-14 20:07:09] [INFO ] [Real]Absence check using 6 positive and 18 generalized place invariants in 7 ms returned sat
[2022-05-14 20:07:09] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 20:07:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-14 20:07:09] [INFO ] [Nat]Absence check using 6 positive and 18 generalized place invariants in 7 ms returned sat
[2022-05-14 20:07:09] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:07:09] [INFO ] After 51ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:09] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-14 20:07:09] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 130/130 places, 458/458 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 458/458 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 130/130 places, 458/458 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2022-05-14 20:07:09] [INFO ] Flow matrix only has 200 transitions (discarded 258 similar events)
// Phase 1: matrix 200 rows 130 cols
[2022-05-14 20:07:09] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2022-05-14 20:07:10] [INFO ] Flow matrix only has 200 transitions (discarded 258 similar events)
// Phase 1: matrix 200 rows 130 cols
[2022-05-14 20:07:10] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:10] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-14 20:07:10] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2022-05-14 20:07:10] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-14 20:07:10] [INFO ] Flow matrix only has 200 transitions (discarded 258 similar events)
// Phase 1: matrix 200 rows 130 cols
[2022-05-14 20:07:10] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:10] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 458/458 transitions.
Graph (trivial) has 103 edges and 130 vertex of which 42 / 130 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 306 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 84 transition count 130
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 55 place count 62 transition count 130
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 55 place count 62 transition count 119
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 51 transition count 119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 46 transition count 114
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 46 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 41 transition count 84
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 41 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 41 transition count 79
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 35 transition count 109
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 162 place count 35 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 170 place count 31 transition count 57
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 28 transition count 36
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 28 transition count 36
Applied a total of 176 rules in 22 ms. Remains 28 /130 variables (removed 102) and now considering 36/458 (removed 422) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 28 cols
[2022-05-14 20:07:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-14 20:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 20:07:10] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-14 20:07:10] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 20:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 20:07:10] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-14 20:07:10] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-14 20:07:10] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:10] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-14 20:07:10] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-14 20:07:10] [INFO ] Flatten gal took : 3 ms
[2022-05-14 20:07:10] [INFO ] Flatten gal took : 2 ms
[2022-05-14 20:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8385023859991193520.gal : 1 ms
[2022-05-14 20:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5360621882341766035.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms750840932226919339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8385023859991193520.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5360621882341766035.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5360621882341766035.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 722
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1503,0.020528,3652,2,141,9,685,7,0,155,460,0
Total reachable state count : 1503

Verifying 1 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.021621,4076,2,29,9,685,7,0,166,460,0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Built C files in :
/tmp/ltsmin13838777527553536035
[2022-05-14 20:07:11] [INFO ] Computing symmetric may disable matrix : 709 transitions.
[2022-05-14 20:07:11] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:11] [INFO ] Computing symmetric may enable matrix : 709 transitions.
[2022-05-14 20:07:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:12] [INFO ] Computing Do-Not-Accords matrix : 709 transitions.
[2022-05-14 20:07:12] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:12] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13838777527553536035
Running compilation step : cd /tmp/ltsmin13838777527553536035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13838777527553536035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13838777527553536035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 231 edges and 199 vertex of which 54 / 199 are part of one of the 16 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 156 transition count 557
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 156 transition count 557
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 47 place count 138 transition count 623
Drop transitions removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 156 place count 138 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 137 transition count 513
Applied a total of 158 rules in 58 ms. Remains 137 /199 variables (removed 62) and now considering 513/709 (removed 196) transitions.
[2022-05-14 20:07:15] [INFO ] Flow matrix only has 208 transitions (discarded 305 similar events)
// Phase 1: matrix 208 rows 137 cols
[2022-05-14 20:07:15] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:07:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-14 20:07:15] [INFO ] Flow matrix only has 208 transitions (discarded 305 similar events)
// Phase 1: matrix 208 rows 137 cols
[2022-05-14 20:07:15] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:15] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-14 20:07:15] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-05-14 20:07:16] [INFO ] Redundant transitions in 481 ms returned []
[2022-05-14 20:07:16] [INFO ] Flow matrix only has 208 transitions (discarded 305 similar events)
// Phase 1: matrix 208 rows 137 cols
[2022-05-14 20:07:16] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:16] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/199 places, 513/709 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/199 places, 513/709 transitions.
Built C files in :
/tmp/ltsmin3381797483746425022
[2022-05-14 20:07:16] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-14 20:07:16] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:16] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-14 20:07:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:16] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-14 20:07:16] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 20:07:16] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3381797483746425022
Running compilation step : cd /tmp/ltsmin3381797483746425022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2148 ms.
Running link step : cd /tmp/ltsmin3381797483746425022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3381797483746425022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5880152942660768059.hoa' '--buchi-type=spotba'
LTSmin run took 967 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-6a-LTLFireability-11 finished in 19976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U X(p1)))'
Support contains 11 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2022-05-14 20:07:19] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:19] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:07:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2022-05-14 20:07:19] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:19] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-14 20:07:20] [INFO ] State equation strengthened by 172 read => feed constraints.
[2022-05-14 20:07:20] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2022-05-14 20:07:20] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2022-05-14 20:07:20] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-14 20:07:20] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s120 1) (AND (EQ s53 1) (EQ s54 1) (EQ s58 1) (EQ s184 1) (EQ s197 1)) (AND (EQ s79 1) (EQ s80 1) (EQ s104 1) (EQ s169 1))), p1:(OR (EQ s121 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-6a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-12 finished in 1330 ms.
All properties solved by simple procedures.
Total runtime 120692 ms.

BK_STOP 1652558841253

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-6a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-6a, 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 r042-smll-165252095200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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