Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840348000580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HouseConstruction-PT-01000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840348000580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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-01000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-01000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678811932766

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-01000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 16:38:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 16:38:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 16:38:55] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-14 16:38:55] [INFO ] Transformed 26 places.
[2023-03-14 16:38:55] [INFO ] Transformed 18 transitions.
[2023-03-14 16:38:55] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-01000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-01000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 14 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-14 16:38:55] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-14 16:38:56] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-14 16:38:56] [INFO ] Invariant cache hit.
[2023-03-14 16:38:56] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-14 16:38:56] [INFO ] Invariant cache hit.
[2023-03-14 16:38:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 24 out of 26 places after structural reductions.
[2023-03-14 16:38:56] [INFO ] Flatten gal took : 26 ms
[2023-03-14 16:38:56] [INFO ] Flatten gal took : 8 ms
[2023-03-14 16:38:56] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 16:38:56] [INFO ] Invariant cache hit.
[2023-03-14 16:38:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 52 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-14 16:38:57] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-14 16:38:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 16:38:57] [INFO ] Invariant cache hit.
[2023-03-14 16:38:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-14 16:38:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 16:38:57] [INFO ] Invariant cache hit.
[2023-03-14 16:38:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 142 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 : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-01000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-01000-LTLFireability-00 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(G(p1))) U (p0&&G(!p2)))))'
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
[2023-03-14 16:38:58] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-14 16:38:58] [INFO ] Implicit Places using invariants in 64 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 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 LTL mode , in 2 iterations and 70 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) p2), (NOT p1), (OR (NOT p0) p2), p2, (NOT p1), true, (AND (NOT p1) p2), p2]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2 p1), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s12 1), p2:(AND (LT s12 1) (GEQ s4 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-01 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(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.
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.
[2023-03-14 16:38:58] [INFO ] Invariant cache hit.
[2023-03-14 16:38:58] [INFO ] Implicit Places using invariants in 60 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 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 LTL mode , in 2 iterations and 64 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6379 reset in 248 ms.
Product exploration explored 100000 steps with 6368 reset in 252 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 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)), true, (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 5 factoid took 248 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 2) seen :0
Finished Best-First random walk after 108 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 16:39:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 16:39:00] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 16:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-14 16:39:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:39:00] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-14 16:39:00] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 16:39:00] [INFO ] Added : 17 causal constraints over 4 iterations in 37 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-14 16:39:00] [INFO ] Invariant cache hit.
[2023-03-14 16:39:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 16:39:00] [INFO ] Invariant cache hit.
[2023-03-14 16:39:00] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-14 16:39:00] [INFO ] Invariant cache hit.
[2023-03-14 16:39:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 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 (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2002 ) properties (out of 2) seen :0
Finished Best-First random walk after 118 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 8 factoid took 476 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-14 16:39:01] [INFO ] Invariant cache hit.
[2023-03-14 16:39:01] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-14 16:39:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:39:01] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-14 16:39:01] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 16:39:02] [INFO ] Added : 17 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 6399 reset in 77 ms.
Product exploration explored 100000 steps with 6354 reset in 193 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 9 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions removed 10 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 9 transition count 8
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 9 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 10 ms. Remains 8 /21 variables (removed 13) and now considering 7/18 (removed 11) transitions.
[2023-03-14 16:39:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 16:39:02] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 16:39:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 8/21 places, 7/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 16:39:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 16:39:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 16:39:02] [INFO ] Invariant cache hit.
[2023-03-14 16:39:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 16:39:02] [INFO ] Invariant cache hit.
[2023-03-14 16:39:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-01000-LTLFireability-02 finished in 4382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 6 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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-14 16:39:02] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 16:39:03] [INFO ] Implicit Places using invariants in 40 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 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 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1) (GEQ s4 1) (GEQ s7 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 889 reset in 197 ms.
Product exploration explored 100000 steps with 915 reset in 172 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 3) seen :1
Finished Best-First random walk after 451 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 16:39:04] [INFO ] Computed 4 place invariants in 0 ms
Proved EG (NOT p0)
[2023-03-14 16:39:04] [INFO ] Invariant cache hit.
[2023-03-14 16:39:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-14 16:39:04] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 16:39:04] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-01000-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-01000-LTLFireability-03 finished in 2007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(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.
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
[2023-03-14 16:39:04] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 16:39:05] [INFO ] Implicit Places using invariants in 34 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 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 LTL mode , in 2 iterations and 39 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(AND (GEQ s21 1) (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1623 reset in 184 ms.
Product exploration explored 100000 steps with 1636 reset in 168 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 2) seen :0
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 16:39:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 16:39:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-14 16:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 16:39:06] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 16:39:06] [INFO ] Added : 17 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
[2023-03-14 16:39:06] [INFO ] Invariant cache hit.
[2023-03-14 16:39:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 16:39:06] [INFO ] Invariant cache hit.
[2023-03-14 16:39:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-14 16:39:06] [INFO ] Invariant cache hit.
[2023-03-14 16:39:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 2) seen :0
Finished Best-First random walk after 88 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-14 16:39:07] [INFO ] Invariant cache hit.
[2023-03-14 16:39:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-14 16:39:07] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-14 16:39:07] [INFO ] Added : 17 causal constraints over 4 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1645 reset in 143 ms.
Product exploration explored 100000 steps with 1672 reset in 152 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 9 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions removed 10 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 9 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 9 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 9 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 9 rules in 7 ms. Remains 7 /22 variables (removed 15) and now considering 6/18 (removed 12) transitions.
[2023-03-14 16:39:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2023-03-14 16:39:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 16:39:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 7/22 places, 6/18 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 16:39:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 16:39:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 16:39:08] [INFO ] Invariant cache hit.
[2023-03-14 16:39:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-14 16:39:08] [INFO ] Invariant cache hit.
[2023-03-14 16:39:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-01000-LTLFireability-04 finished in 3360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p1&&X(G(p2)))))'
Support contains 4 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
[2023-03-14 16:39:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 16:39:08] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 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 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s2 1) (GEQ s16 1)), p2:(AND (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-08 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(!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
[2023-03-14 16:39:08] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-14 16:39:08] [INFO ] Implicit Places using invariants in 42 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 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 LTL mode , in 2 iterations and 49 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[p1, p1, p1]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33083 reset in 59 ms.
Product exploration explored 100000 steps with 32929 reset in 75 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 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 (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 10 factoid took 343 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-01000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-01000-LTLFireability-09 finished in 719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(!p2)&&p1))||p0)))'
Support contains 5 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.
[2023-03-14 16:39:09] [INFO ] Invariant cache hit.
[2023-03-14 16:39:09] [INFO ] Implicit Places using invariants in 40 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 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 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s17 1) (LT s18 1)), p1:(AND (GEQ s8 1) (GEQ s9 1) (LT s7 1)), p2:(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][false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-10 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p1))&&p0)))))'
Support contains 5 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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-14 16:39:09] [INFO ] Invariant cache hit.
[2023-03-14 16:39:09] [INFO ] Implicit Places using invariants in 32 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 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 LTL mode , in 2 iterations and 35 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (OR (LT s8 1) (LT s11 1) (LT s12 1))), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-11 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p1))&&F((p2&&F(!p2))))||p0)))'
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.
[2023-03-14 16:39:09] [INFO ] Invariant cache hit.
[2023-03-14 16:39:09] [INFO ] Implicit Places using invariants in 43 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 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 LTL mode , in 2 iterations and 48 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p1), true, p2, true]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s9 1)), p2:(GEQ s12 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 343 steps with 4 reset in 1 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-12 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 4 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 20 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-14 16:39:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 16:39:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-14 16:39:10] [INFO ] Invariant cache hit.
[2023-03-14 16:39:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-14 16:39:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 16:39:10] [INFO ] Invariant cache hit.
[2023-03-14 16:39:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 54 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 : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-01000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-01000-LTLFireability-13 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(!p1))))'
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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
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 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 16 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 15 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 15 transition count 8
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 19 place count 14 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 13 transition count 7
Applied a total of 20 rules in 90 ms. Remains 13 /26 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 13 cols
[2023-03-14 16:39:10] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-14 16:39:10] [INFO ] Implicit Places using invariants in 30 ms returned [0, 4, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/26 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 10/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23 reset in 152 ms.
Product exploration explored 100000 steps with 31 reset in 223 ms.
Computed a total of 10 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 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 p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5006 ) properties (out of 1) seen :0
Finished Best-First random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 10 cols
[2023-03-14 16:39:11] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 16:39:11] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 16:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 16:39:11] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 16:39:11] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 10 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 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-14 16:39:11] [INFO ] Invariant cache hit.
[2023-03-14 16:39:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 16:39:11] [INFO ] Invariant cache hit.
[2023-03-14 16:39:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-14 16:39:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 16:39:11] [INFO ] Invariant cache hit.
[2023-03-14 16:39:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 10/10 places, 7/7 transitions.
Computed a total of 10 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 1) seen :0
Finished Best-First random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-14 16:39:12] [INFO ] Invariant cache hit.
[2023-03-14 16:39:12] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 16:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 16:39:12] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 16:39:12] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5694 reset in 88 ms.
Product exploration explored 100000 steps with 5747 reset in 103 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 7/7 transitions.
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Applied a total of 3 rules in 43 ms. Remains 6 /10 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-14 16:39:12] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 16:39:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 16:39:12] [INFO ] Invariant cache hit.
[2023-03-14 16:39:12] [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.
[2023-03-14 16:39:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 16:39:12] [INFO ] Invariant cache hit.
[2023-03-14 16:39:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 6/10 places, 4/7 transitions.
Treatment of property HouseConstruction-PT-01000-LTLFireability-14 finished in 2539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0&&X((!p0 U (!p1||G(!p0)))))) U (p1&&G((!p0&&X((!p0 U (!p1||G(!p0))))))))))'
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
[2023-03-14 16:39:12] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-14 16:39:12] [INFO ] Implicit Places using invariants in 36 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 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 LTL mode , in 2 iterations and 41 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s14 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-LTLFireability-15 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Found a Lengthening insensitive property : HouseConstruction-PT-01000-LTLFireability-02
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_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.1 ms
Discarding 17 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 8 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 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 72 ms. Remains 6 /26 variables (removed 20) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-14 16:39:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 16:39:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 16:39:13] [INFO ] Invariant cache hit.
[2023-03-14 16:39:13] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-14 16:39:13] [INFO ] Invariant cache hit.
[2023-03-14 16:39:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/26 places, 5/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 145 ms. Remains : 6/26 places, 5/18 transitions.
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (GEQ s4 1) (GEQ s5 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20968 steps with 1319 reset in 14 ms.
Treatment of property HouseConstruction-PT-01000-LTLFireability-02 finished in 479 ms.
FORMULA HouseConstruction-PT-01000-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : HouseConstruction-PT-01000-LTLFireability-04
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_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.
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 8 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 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 5 transition count 4
Applied a total of 7 rules in 18 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-14 16:39:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 16:39:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 16:39:13] [INFO ] Invariant cache hit.
[2023-03-14 16:39:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-14 16:39:13] [INFO ] Invariant cache hit.
[2023-03-14 16:39:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 89 ms. Remains : 5/26 places, 4/18 transitions.
Running random walk in product with property : HouseConstruction-PT-01000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(AND (GEQ s4 1) (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9192 reset in 92 ms.
Product exploration explored 100000 steps with 9104 reset in 106 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1002 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1002 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-14 16:39:14] [INFO ] Invariant cache hit.
[2023-03-14 16:39:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 16:39:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 16:39:14] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-14 16:39:14] [INFO ] Invariant cache hit.
[2023-03-14 16:39:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 16:39:15] [INFO ] Invariant cache hit.
[2023-03-14 16:39:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-14 16:39:15] [INFO ] Invariant cache hit.
[2023-03-14 16:39:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1002 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1002 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-14 16:39:15] [INFO ] Invariant cache hit.
[2023-03-14 16:39:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 16:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:39:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 16:39:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 16:39:15] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9194 reset in 94 ms.
Product exploration explored 100000 steps with 9221 reset in 115 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-14 16:39:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 16:39:16] [INFO ] Invariant cache hit.
[2023-03-14 16:39:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 5/5 places, 4/4 transitions.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-14 16:39:16] [INFO ] Invariant cache hit.
[2023-03-14 16:39:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-14 16:39:16] [INFO ] Invariant cache hit.
[2023-03-14 16:39:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-14 16:39:16] [INFO ] Invariant cache hit.
[2023-03-14 16:39:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-01000-LTLFireability-04 finished in 3077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(!p1))))'
[2023-03-14 16:39:16] [INFO ] Flatten gal took : 4 ms
[2023-03-14 16:39:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 16:39:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 18 transitions and 51 arcs took 0 ms.
Total runtime 21420 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1804/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1804/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1804/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HouseConstruction-PT-01000-LTLFireability-02
Could not compute solution for formula : HouseConstruction-PT-01000-LTLFireability-04
Could not compute solution for formula : HouseConstruction-PT-01000-LTLFireability-14

BK_STOP 1678811958575

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name HouseConstruction-PT-01000-LTLFireability-02
ltl formula formula --ltl=/tmp/1804/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1804/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1804/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1804/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1804/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562f966003f4]
1: pnml2lts-mc(+0xa2496) [0x562f96600496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1fbaffc140]
3: pnml2lts-mc(+0x405b30) [0x562f96963b30]
4: pnml2lts-mc(+0x16b3f9) [0x562f966c93f9]
5: pnml2lts-mc(+0x164ac4) [0x562f966c2ac4]
6: pnml2lts-mc(+0x272e0a) [0x562f967d0e0a]
7: pnml2lts-mc(+0xb61f0) [0x562f966141f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1fbae4f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1fbae4f67a]
10: pnml2lts-mc(+0xa1581) [0x562f965ff581]
11: pnml2lts-mc(+0xa1910) [0x562f965ff910]
12: pnml2lts-mc(+0xa32a2) [0x562f966012a2]
13: pnml2lts-mc(+0xa50f4) [0x562f966030f4]
14: pnml2lts-mc(+0xa516b) [0x562f9660316b]
15: pnml2lts-mc(+0x3f34b3) [0x562f969514b3]
16: pnml2lts-mc(+0x7c63d) [0x562f965da63d]
17: pnml2lts-mc(+0x67d86) [0x562f965c5d86]
18: pnml2lts-mc(+0x60a8a) [0x562f965bea8a]
19: pnml2lts-mc(+0x5eb15) [0x562f965bcb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1fbae37d0a]
21: pnml2lts-mc(+0x6075e) [0x562f965be75e]
ltl formula name HouseConstruction-PT-01000-LTLFireability-04
ltl formula formula --ltl=/tmp/1804/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1804/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1804/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1804/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1804/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HouseConstruction-PT-01000-LTLFireability-14
ltl formula formula --ltl=/tmp/1804/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 26 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1804/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1804/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1804/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1804/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-01000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HouseConstruction-PT-01000, 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 r201-smll-167840348000580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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