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.r114-smll-165264477600372.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 HouseConstruction-PT-00010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477600372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.8K Apr 29 18:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 18:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 18:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 18:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K May 10 09:34 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 HouseConstruction-PT-00010-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652786068858

Running Version 202205111006
[2022-05-17 11:14:30] [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-17 11:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:14:31] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-05-17 11:14:31] [INFO ] Transformed 26 places.
[2022-05-17 11:14:31] [INFO ] Transformed 18 transitions.
[2022-05-17 11:14:31] [INFO ] Parsed PT model containing 26 places and 18 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-00010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 28 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 11:14:31] [INFO ] Computed 8 place invariants in 8 ms
[2022-05-17 11:14:31] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 11:14:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-17 11:14:31] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 11:14:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-17 11:14:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
Support contains 21 out of 26 places after structural reductions.
[2022-05-17 11:14:32] [INFO ] Flatten gal took : 25 ms
[2022-05-17 11:14:32] [INFO ] Flatten gal took : 8 ms
[2022-05-17 11:14:32] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10005 steps, including 50 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 17) seen :16
Finished Best-First random walk after 277 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 11:14:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 11:14:32] [INFO ] Implicit Places using invariants in 51 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-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: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s3 1) (GEQ s7 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-00 finished in 504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 11:14:33] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 11:14:33] [INFO ] Implicit Places using invariants in 48 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-01 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: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s3 1) (GEQ s7 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-01 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0))) U X(p1)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 11:14:33] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-17 11:14:33] [INFO ] Implicit Places using invariants in 50 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 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 2193 reset in 487 ms.
Product exploration explored 100000 steps with 2190 reset in 267 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 133 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 11:14:35] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 11:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 11:14:35] [INFO ] Computed and/alt/rep : 17/22/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 11:14:35] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 11:14:35] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 11:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 11:14:35] [INFO ] Computed and/alt/rep : 17/22/17 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 11:14:35] [INFO ] Added : 17 causal constraints over 4 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-17 11:14:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 11:14:35] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-17 11:14:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 453 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 133 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 526 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 11:14:37] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 11:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 11:14:37] [INFO ] Computed and/alt/rep : 17/22/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 11:14:37] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 11:14:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 11:14:37] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 11:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 11:14:37] [INFO ] Computed and/alt/rep : 17/22/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 11:14:37] [INFO ] Added : 17 causal constraints over 4 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2208 reset in 229 ms.
Product exploration explored 100000 steps with 2207 reset in 471 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 26 edges and 23 vertex of which 13 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 21 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2022-05-17 11:14:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-17 11:14:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 11:14:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/23 places, 9/18 transitions.
Product exploration explored 100000 steps with 4354 reset in 280 ms.
Product exploration explored 100000 steps with 4378 reset in 357 ms.
Built C files in :
/tmp/ltsmin2266283021761641115
[2022-05-17 11:14:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2266283021761641115
Running compilation step : cd /tmp/ltsmin2266283021761641115;'/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 281 ms.
Running link step : cd /tmp/ltsmin2266283021761641115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2266283021761641115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13367562529335620889.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00010-LTLFireability-03 finished in 6880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U F((F(X(p2))&&p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 11:14:40] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 11:14:40] [INFO ] Implicit Places using invariants in 37 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s14 1)), p2:(AND (GEQ s13 1) (GEQ s14 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2055 steps with 36 reset in 6 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-04 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 11 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 5 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:14:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 11:14:40] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:14:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 11:14:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 11:14:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:14:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 11:14:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-05 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:(GEQ s1 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 20 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-05 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U (!G(p2)&&!p0)))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 7
Applied a total of 5 rules in 4 ms. Remains 11 /26 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:14:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:14:40] [INFO ] Implicit Places using invariants in 32 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/26 places, 7/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR p2 p0), p2, (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1 1), p2:(AND (GEQ s7 1) (GEQ s8 1)), p1:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-06 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(!(p1 U p2))))'
Support contains 8 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 5 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 11:14:40] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 11:14:41] [INFO ] Implicit Places using invariants in 42 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1) (GEQ s17 1) (LT s5 1)), p2:(GEQ s17 1), p1:(AND (GEQ s18 1) (GEQ s19 1) (GEQ s22 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 9 factoid took 495 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00010-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-08 finished in 1066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&(F(X(p1))||p2)))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 11:14:42] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 11:14:42] [INFO ] Implicit Places using invariants in 69 ms returned [3, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s13 1), p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(AND (GEQ s15 1) (GEQ s16 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][false, false, false, false]]
Product exploration explored 100000 steps with 3003 reset in 162 ms.
Product exploration explored 100000 steps with 3016 reset in 194 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 648 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Finished random walk after 111 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2)]
Knowledge based reduction with 10 factoid took 717 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:14:44] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 11:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 11:14:44] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-17 11:14:44] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:14:44] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 11:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 11:14:44] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 11:14:44] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 11:14:44] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 11:14:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:14:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 18/18 transitions.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 663 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Finished random walk after 133 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2)]
Knowledge based reduction with 11 factoid took 764 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:14:47] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 11:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 11:14:47] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 11:14:47] [INFO ] Added : 10 causal constraints over 2 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:14:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:14:47] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 11:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:14:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 11:14:47] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 11:14:47] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3028 reset in 166 ms.
Product exploration explored 100000 steps with 3008 reset in 191 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 14 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 7 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2022-05-17 11:14:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2022-05-17 11:14:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:14:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 9/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/24 places, 9/18 transitions.
Product exploration explored 100000 steps with 4589 reset in 164 ms.
Product exploration explored 100000 steps with 4606 reset in 188 ms.
Built C files in :
/tmp/ltsmin12568016164696339441
[2022-05-17 11:14:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12568016164696339441
Running compilation step : cd /tmp/ltsmin12568016164696339441;'/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 167 ms.
Running link step : cd /tmp/ltsmin12568016164696339441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12568016164696339441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14758498929352360651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:15:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 11:15:03] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:15:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 11:15:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 11:15:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 11:15:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin11255496207577049143
[2022-05-17 11:15:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11255496207577049143
Running compilation step : cd /tmp/ltsmin11255496207577049143;'/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 95 ms.
Running link step : cd /tmp/ltsmin11255496207577049143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11255496207577049143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9372950790367021464.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 11:15:19] [INFO ] Flatten gal took : 5 ms
[2022-05-17 11:15:19] [INFO ] Flatten gal took : 9 ms
[2022-05-17 11:15:19] [INFO ] Time to serialize gal into /tmp/LTL9601022127770328529.gal : 1 ms
[2022-05-17 11:15:19] [INFO ] Time to serialize properties into /tmp/LTL4349608740276288155.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/LTL9601022127770328529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4349608740276288155.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/LTL9601022...266
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(p17>=1)"))&&((F(X("((p19>=1)&&(p20>=1))")))||("(((p12>=1)&&(p10>=1))&&(p13>=1))"))))))
Formula 0 simplified : !GX(F"(p17>=1)" & ("(((p12>=1)&&(p10>=1))&&(p13>=1))" | FX"((p19>=1)&&(p20>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-17 11:15:34] [INFO ] Flatten gal took : 4 ms
[2022-05-17 11:15:34] [INFO ] Applying decomposition
[2022-05-17 11:15:34] [INFO ] Flatten gal took : 3 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/graph13325297806003317847.txt' '-o' '/tmp/graph13325297806003317847.bin' '-w' '/tmp/graph13325297806003317847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13325297806003317847.bin' '-l' '-1' '-v' '-w' '/tmp/graph13325297806003317847.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:15:34] [INFO ] Decomposing Gal with order
[2022-05-17 11:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:15:34] [INFO ] Flatten gal took : 63 ms
[2022-05-17 11:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 11:15:34] [INFO ] Time to serialize gal into /tmp/LTL10519176746531340837.gal : 2 ms
[2022-05-17 11:15:34] [INFO ] Time to serialize properties into /tmp/LTL8583172120029118513.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/LTL10519176746531340837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8583172120029118513.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/LTL1051917...246
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(i3.u5.p17>=1)"))&&((F(X("((i3.u7.p19>=1)&&(i3.u7.p20>=1))")))||("(((i0.u1.p12>=1)&&(i2.u3.p10>=1))&&(i2.u4.p13>=1))"))))))
Formula 0 simplified : !GX(F"(i3.u5.p17>=1)" & ("(((i0.u1.p12>=1)&&(i2.u3.p10>=1))&&(i2.u4.p13>=1))" | FX"((i3.u7.p19>=1)&&(i3.u7.p20>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3089000001608767206
[2022-05-17 11:15:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3089000001608767206
Running compilation step : cd /tmp/ltsmin3089000001608767206;'/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 95 ms.
Running link step : cd /tmp/ltsmin3089000001608767206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3089000001608767206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))&&(<>(X((LTLAPp1==true)))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00010-LTLFireability-10 finished in 82506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U p1)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 11:16:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 11:16:04] [INFO ] Implicit Places using invariants in 57 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, p1, p1, (AND p1 p0), p0]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s0 1), p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-11 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((F(p1) U ((X(F(p2))&&F(p1))||G(F(p1)))))))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 8 transition count 6
Applied a total of 16 rules in 12 ms. Remains 8 /26 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-17 11:16:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 11:16:04] [INFO ] Implicit Places using invariants in 23 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4419 reset in 217 ms.
Product exploration explored 100000 steps with 4515 reset in 305 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-12 finished in 921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U (p0 U !p0))) U (!F(p1)&&!p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 13 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 4 transition count 4
Applied a total of 13 rules in 13 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 11:16:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 11:16:05] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 11:16:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 11:16:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-17 11:16:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 11:16:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 11:16:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR p0 p1), p0, p0, p1]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={0} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s1 1), p1:(GEQ s3 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 48 steps with 2 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-13 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U F(G(p0)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 4
Applied a total of 4 rules in 8 ms. Remains 7 /26 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2022-05-17 11:16:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2022-05-17 11:16:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-17 11:16:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2022-05-17 11:16:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-14 finished in 134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 9 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 7 transition count 3
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 2 transition count 2
Applied a total of 12 rules in 4 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:16:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:16:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-17 11:16:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 11:16:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 11:16:06] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 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 4761 reset in 50 ms.
Product exploration explored 100000 steps with 4761 reset in 65 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-15 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&(F(X(p1))||p2)))))'
Found a SL insensitive property : HouseConstruction-PT-00010-LTLFireability-10
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 11 transition count 7
Applied a total of 4 rules in 10 ms. Remains 11 /26 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 11/26 places, 7/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/26 places, 7/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s7 1), p2:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1)), p1:(AND (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6086 reset in 96 ms.
Product exploration explored 100000 steps with 6049 reset in 110 ms.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 433 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Finished random walk after 46 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2)]
Knowledge based reduction with 10 factoid took 647 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 11:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 11:16:08] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 11:16:08] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:16:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 11:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 11:16:09] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 11:16:09] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:16:09] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:16:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 7/7 transitions.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 449 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Finished random walk after 56 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2)]
Knowledge based reduction with 11 factoid took 648 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:16:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 11:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 11:16:10] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 11:16:10] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 11:16:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 11:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 11:16:10] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 11:16:10] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6082 reset in 145 ms.
Product exploration explored 100000 steps with 6079 reset in 166 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-17 11:16:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 11:16:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 11:16:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 7/7 transitions.
Product exploration explored 100000 steps with 5998 reset in 165 ms.
Product exploration explored 100000 steps with 6059 reset in 190 ms.
Built C files in :
/tmp/ltsmin6352598019273036242
[2022-05-17 11:16:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6352598019273036242
Running compilation step : cd /tmp/ltsmin6352598019273036242;'/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 133 ms.
Running link step : cd /tmp/ltsmin6352598019273036242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6352598019273036242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7408893438465400789.hoa' '--buchi-type=spotba'
LTSmin run took 1226 ms.
Treatment of property HouseConstruction-PT-00010-LTLFireability-10 finished in 7057 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-17 11:16:13] [INFO ] Flatten gal took : 4 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 102634 ms.

BK_STOP 1652786174042

--------------------
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="HouseConstruction-PT-00010"
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 HouseConstruction-PT-00010, 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 r114-smll-165264477600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00010.tgz
mv HouseConstruction-PT-00010 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 ;