Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717258832041

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-00100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:20:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:20:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:20:34] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 16:20:34] [INFO ] Transformed 26 places.
[2024-06-01 16:20:34] [INFO ] Transformed 18 transitions.
[2024-06-01 16:20:34] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-00100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 19 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-06-01 16:20:35] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 16:20:35] [INFO ] Invariant cache hit.
[2024-06-01 16:20:35] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 588 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 471 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 1122ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1143ms
Finished structural reductions in LTL mode , in 1 iterations and 1618 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 26 out of 26 places after structural reductions.
[2024-06-01 16:20:37] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:20:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:20:37] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40016 steps (20 resets) in 478 ms. (83 steps per ms) remains 2/21 properties
BEST_FIRST walk for 551 steps (0 resets) in 18 ms. (29 steps per ms) remains 0/2 properties
FORMULA HouseConstruction-PT-00100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&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.
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 18 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:38] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:38] [INFO ] Implicit Places using invariants in 68 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:38] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 3 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:38] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:20:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 16:20:38] [INFO ] Invariant cache hit.
[2024-06-01 16:20:38] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-00
Product exploration explored 100000 steps with 2115 reset in 682 ms.
Product exploration explored 100000 steps with 2096 reset in 272 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 289 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 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40016 steps (20 resets) in 55 ms. (714 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
[2024-06-01 16:20:40] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 3/39 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 12 factoid took 851 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-06-01 16:20:41] [INFO ] Invariant cache hit.
[2024-06-01 16:20:41] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:41] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:20:41] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:20:41] [INFO ] Added : 17 causal constraints over 4 iterations in 49 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 12 factoid took 773 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-00 finished in 4490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 13 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 7 transition count 4
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 3 with 5 rules applied. Total rules applied 16 place count 4 transition count 4
Applied a total of 16 rules in 25 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:20:42] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 16:20:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 16:20:42] [INFO ] Invariant cache hit.
[2024-06-01 16:20:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 16:20:42] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 70 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-01
Product exploration explored 100000 steps with 249 reset in 370 ms.
Product exploration explored 100000 steps with 249 reset in 247 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-01 finished in 985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 6 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 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 5 transition count 4
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 4 transition count 4
Applied a total of 3 rules in 6 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:20:43] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 16:20:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 16:20:43] [INFO ] Invariant cache hit.
[2024-06-01 16:20:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 16:20:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-02
Product exploration explored 100000 steps with 1279 reset in 129 ms.
Product exploration explored 100000 steps with 1244 reset in 173 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 p1 p0), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (F (G p1)), (F (G 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))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-02 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 13 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 10 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 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 11 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 16 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 16 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 18 place count 2 transition count 2
Applied a total of 18 rules in 7 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 16:20:44] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 16:20:44] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 16:20:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 72ms
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 131 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-03
Product exploration explored 100000 steps with 497 reset in 87 ms.
Product exploration explored 100000 steps with 497 reset in 112 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-03 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(G((X(p0) U p1))))) U G(X(p2))))'
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.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:44] [INFO ] Implicit Places using invariants in 46 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 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 1 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 51 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-05
Stuttering criterion allowed to conclude after 1800 steps with 0 reset in 6 ms.
FORMULA HouseConstruction-PT-00100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLFireability-05 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 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 (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 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 3 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 3 with 1 rules applied. Total rules applied 17 place count 15 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 18 place count 14 transition count 8
Applied a total of 18 rules in 32 ms. Remains 14 /26 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-01 16:20:45] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/26 places, 8/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 13/26 places, 8/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-06
Stuttering criterion allowed to conclude after 800 steps with 0 reset in 3 ms.
FORMULA HouseConstruction-PT-00100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLFireability-06 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants in 57 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:45] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:45] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 16:20:45] [INFO ] Invariant cache hit.
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 386 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-07
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLFireability-07 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 13 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 7 transition count 4
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 3 with 5 rules applied. Total rules applied 16 place count 4 transition count 4
Applied a total of 16 rules in 10 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 16:20:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:20:45] [INFO ] Invariant cache hit.
[2024-06-01 16:20:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 16:20:45] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 16:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-08 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(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 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:46] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 16:20:46] [INFO ] Implicit Places using invariants in 52 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 24/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-09
Product exploration explored 100000 steps with 7405 reset in 171 ms.
Product exploration explored 100000 steps with 7469 reset in 196 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 9806 steps (4 resets) in 18 ms. (516 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 552 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
// Phase 1: matrix 18 rows 24 cols
[2024-06-01 16:20:48] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:20:48] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 16:20:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 16:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:48] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 16:20:48] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 16:20:48] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:20:48] [INFO ] Added : 17 causal constraints over 4 iterations in 39 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 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 13 transition count 8
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 12 transition count 8
Applied a total of 3 rules in 7 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 16:20:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 16:20:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 16:20:48] [INFO ] Invariant cache hit.
[2024-06-01 16:20:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 16:20:49] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 16:20:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 308ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 12/24 places, 8/18 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 531 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 3540 steps (2 resets) in 9 ms. (354 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 13 factoid took 961 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-06-01 16:20:51] [INFO ] Invariant cache hit.
[2024-06-01 16:20:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 16:20:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 16:20:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:20:51] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:20:51] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 13793 reset in 195 ms.
Product exploration explored 100000 steps with 13796 reset in 224 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
[2024-06-01 16:20:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
[2024-06-01 16:20:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 16:20:52] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 16:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 151 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property HouseConstruction-PT-00100-LTLFireability-09 finished in 6630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||X(F(p2))))'
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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 16:20:53] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13, 19]
[2024-06-01 16:20:53] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 16:20:53] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 16:20:53] [INFO ] Invariant cache hit.
[2024-06-01 16:20:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-10
Product exploration explored 100000 steps with 3204 reset in 146 ms.
Product exploration explored 100000 steps with 3255 reset in 167 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 262 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 3640 steps (0 resets) in 7 ms. (455 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 20 factoid took 338 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 16:20:54] [INFO ] Invariant cache hit.
[2024-06-01 16:20:55] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:55] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:20:55] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:20:55] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 16:20:55] [INFO ] Invariant cache hit.
[2024-06-01 16:20:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:20:55] [INFO ] Invariant cache hit.
[2024-06-01 16:20:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 376 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 338 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 748ms
Finished structural reductions in LTL mode , in 1 iterations and 848 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 : [(NOT p2), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4145 steps (0 resets) in 6 ms. (592 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 16:20:56] [INFO ] Invariant cache hit.
[2024-06-01 16:20:56] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 16:20:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:20:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:20:56] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 16:20:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:20:56] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:20:56] [INFO ] Added : 17 causal constraints over 4 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3227 reset in 152 ms.
Product exploration explored 100000 steps with 3250 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 1 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 10 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 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 10 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 9 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 9 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 8 ms. Remains 9 /21 variables (removed 12) and now considering 9/18 (removed 9) transitions.
[2024-06-01 16:20:57] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 16:20:57] [INFO ] Computed 1 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 10 constraints, problems are : Problem set: 5 solved, 3 unsolved in 98 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/18 variables, 3/13 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 13 constraints, problems are : Problem set: 5 solved, 3 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 5 solved, 3 unsolved
Search for dead transitions found 5 dead transitions in 191ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 4/18 transitions.
Graph (complete) has 5 edges and 9 vertex of which 5 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
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 4 transition count 4
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 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 2 ms. Remains 3 /9 variables (removed 6) and now considering 3/4 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/21 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 3/21 places, 3/18 transitions.
Support contains 1 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
[2024-06-01 16:20:58] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 324 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 308 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 640ms
Finished structural reductions in LTL mode , in 1 iterations and 730 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLFireability-10 finished in 5881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:20:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants in 42 ms returned [3, 9, 13]
[2024-06-01 16:20:58] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 16:20:58] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 16:20:59] [INFO ] Invariant cache hit.
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-11
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLFireability-11 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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 12 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 7
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 10 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 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 9 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 14 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 14 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 16 place count 2 transition count 2
Applied a total of 16 rules in 9 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 16:20:59] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 16:20:59] [INFO ] Invariant cache hit.
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 16:20:59] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 16:20:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 71ms
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 129 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 76 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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-00100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-13 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&(!p1||X(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 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-06-01 16:20:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants in 48 ms returned [3, 9, 13, 20]
[2024-06-01 16:20:59] [INFO ] Actually due to overlaps returned [3, 9, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 16:20:59] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:20:59] [INFO ] Invariant cache hit.
[2024-06-01 16:20:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-14
Product exploration explored 100000 steps with 15458 reset in 108 ms.
Product exploration explored 100000 steps with 15603 reset in 163 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 p0 p1 p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLFireability-14 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X(X(F(p2)))))))'
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.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 16:21:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 16:21:00] [INFO ] Implicit Places using invariants in 44 ms returned [3, 9, 13]
[2024-06-01 16:21:00] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 16:21:00] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 16:21:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 16:21:00] [INFO ] Invariant cache hit.
[2024-06-01 16:21:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-15
Product exploration explored 100000 steps with 21282 reset in 83 ms.
Product exploration explored 100000 steps with 21189 reset in 103 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 p2) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 661 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 12 factoid took 854 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 16:21:03] [INFO ] Invariant cache hit.
[2024-06-01 16:21:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 16:21:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:21:03] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
[2024-06-01 16:21:03] [INFO ] Invariant cache hit.
[2024-06-01 16:21:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 16:21:03] [INFO ] Invariant cache hit.
[2024-06-01 16:21:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 16:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 361 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 681ms
Finished structural reductions in LTL mode , in 1 iterations and 772 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 : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 16:21:05] [INFO ] Invariant cache hit.
[2024-06-01 16:21:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:21:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:21:05] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:21:05] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 21209 reset in 75 ms.
Product exploration explored 100000 steps with 21295 reset in 100 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 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 23 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 5 ms. Remains 2 /22 variables (removed 20) and now considering 2/18 (removed 16) transitions.
[2024-06-01 16:21:06] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 16:21:06] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 2/22 places, 2/18 transitions.
Support contains 1 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.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 16:21:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 16:21:06] [INFO ] Implicit Places using invariants in 38 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 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 41 ms. Remains : 21/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLFireability-15 finished in 5943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLFireability-09
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 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 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 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 13 transition count 8
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 12 transition count 8
Applied a total of 3 rules in 5 ms. Remains 12 /26 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 16:21:06] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 16:21:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 16:21:06] [INFO ] Invariant cache hit.
[2024-06-01 16:21:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 16:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in LI_LTL mode, iteration 1 : 12/26 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 350 ms. Remains : 12/26 places, 8/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLFireability-09
Product exploration explored 100000 steps with 13764 reset in 165 ms.
Product exploration explored 100000 steps with 13812 reset in 194 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 3540 steps (2 resets) in 7 ms. (442 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 541 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-06-01 16:21:09] [INFO ] Invariant cache hit.
[2024-06-01 16:21:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:21:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 16:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:21:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 16:21:09] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:21:09] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 16:21:09] [INFO ] Invariant cache hit.
[2024-06-01 16:21:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:21:09] [INFO ] Invariant cache hit.
[2024-06-01 16:21:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 16:21:09] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 16:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 3238 steps (2 resets) in 7 ms. (404 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 13 factoid took 854 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-06-01 16:21:11] [INFO ] Invariant cache hit.
[2024-06-01 16:21:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 16:21:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 16:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 16:21:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 16:21:12] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:21:12] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 13784 reset in 184 ms.
Product exploration explored 100000 steps with 13804 reset in 199 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 16:21:12] [INFO ] Invariant cache hit.
[2024-06-01 16:21:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 16:21:12] [INFO ] Invariant cache hit.
[2024-06-01 16:21:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 16:21:12] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 16:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 144 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property HouseConstruction-PT-00100-LTLFireability-09 finished in 6580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||X(F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X(X(F(p2)))))))'
[2024-06-01 16:21:13] [INFO ] Flatten gal took : 6 ms
[2024-06-01 16:21:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 16:21:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 18 transitions and 51 arcs took 7 ms.
Total runtime 38915 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HouseConstruction-PT-00100-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HouseConstruction-PT-00100-LTLFireability-10
FORMULA HouseConstruction-PT-00100-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717258973339

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name HouseConstruction-PT-00100-LTLFireability-09
ltl formula formula --ltl=/tmp/1932/ltl_0_
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( 1/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 33 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~498 levels ~10000 states ~21644 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~20000 states ~39760 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~40000 states ~76752 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~80000 states ~151728 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~160000 states ~303576 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~320000 states ~609580 transitions
pnml2lts-mc( 3/ 4): ~497 levels ~640000 states ~1346192 transitions
pnml2lts-mc( 3/ 4): ~497 levels ~1280000 states ~2728844 transitions
pnml2lts-mc( 3/ 4): ~497 levels ~2560000 states ~5524300 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~5120000 states ~9971292 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~10240000 states ~20023204 transitions
pnml2lts-mc( 1/ 4): ~498 levels ~20480000 states ~40185056 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550709
pnml2lts-mc( 0/ 4): unique states count: 33552106
pnml2lts-mc( 0/ 4): unique transitions count: 71562990
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 38004187
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552114
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1998
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552114 states 71563062 transitions, fanout: 2.133
pnml2lts-mc( 0/ 4): Total exploration time 46.730 sec (46.690 sec minimum, 46.715 sec on average)
pnml2lts-mc( 0/ 4): States per second: 717999, Transitions per second: 1531416
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 275.0MB, 8.6 B/state, compr.: 7.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/29.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 275.0MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLFireability-10
ltl formula formula --ltl=/tmp/1932/ltl_1_
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
Warning: program compiled against libxml 210 using older 209
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( 3/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 26 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1102 levels ~10000 states ~22368 transitions
pnml2lts-mc( 1/ 4): ~1102 levels ~20000 states ~45284 transitions
pnml2lts-mc( 1/ 4): ~1102 levels ~40000 states ~95988 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~80000 states ~142756 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~160000 states ~301264 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~320000 states ~618240 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~640000 states ~1252156 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~1280000 states ~2520360 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~2560000 states ~5056192 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~5120000 states ~10620084 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~10240000 states ~23334348 transitions
pnml2lts-mc( 2/ 4): ~1098 levels ~20480000 states ~50808552 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28040086
pnml2lts-mc( 0/ 4): unique states count: 28043907
pnml2lts-mc( 0/ 4): unique transitions count: 81511269
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 53459561
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 28043917
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4394
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28043917 states 81511291 transitions, fanout: 2.907
pnml2lts-mc( 0/ 4): Total exploration time 51.390 sec (51.380 sec minimum, 51.388 sec on average)
pnml2lts-mc( 0/ 4): States per second: 545708, Transitions per second: 1586131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 278.0MB, 10.4 B/state, compr.: 9.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 83.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 278.0MB (~256.0MB paged-in)
ltl formula name HouseConstruction-PT-00100-LTLFireability-15
ltl formula formula --ltl=/tmp/1932/ltl_2_
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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 28 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 27, there are 39 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 132
pnml2lts-mc( 0/ 4): unique states count: 132
pnml2lts-mc( 0/ 4): unique transitions count: 191
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 102
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 220
pnml2lts-mc( 0/ 4): - cum. max stack depth: 72
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 220 states 402 transitions, fanout: 1.827
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.6 B/state, compr.: 16.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-00100"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is HouseConstruction-PT-00100, 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 r500-smll-171649587600188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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