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.r219-smll-171649598000142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HouseConstruction-PT-04000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598000142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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-04000-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-04000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716670572682

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-04000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 20:56:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 20:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:56:15] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-25 20:56:15] [INFO ] Transformed 26 places.
[2024-05-25 20:56:15] [INFO ] Transformed 18 transitions.
[2024-05-25 20:56:15] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-04000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 17 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 20:56:15] [INFO ] Computed 8 invariants in 6 ms
[2024-05-25 20:56:15] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-25 20:56:15] [INFO ] Invariant cache hit.
[2024-05-25 20:56:16] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-25 20:56:16] [INFO ] Invariant cache hit.
[2024-05-25 20:56:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 546 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 23 out of 26 places after structural reductions.
[2024-05-25 20:56:16] [INFO ] Flatten gal took : 25 ms
[2024-05-25 20:56:16] [INFO ] Flatten gal took : 6 ms
[2024-05-25 20:56:16] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 12005 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=363 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 32) seen :24
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 20:56:16] [INFO ] Invariant cache hit.
[2024-05-25 20:56:16] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 20:56:16] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 20:56:16] [INFO ] After 73ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-25 20:56:16] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 4 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 5 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 13 output transitions
Drop transitions removed 13 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 4 transition count 3
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 3 transition count 3
Applied a total of 3 rules in 252 ms. Remains 3 /26 variables (removed 23) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 20:56:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:56:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 20:56:17] [INFO ] Invariant cache hit.
[2024-05-25 20:56:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 20:56:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:56:17] [INFO ] Invariant cache hit.
[2024-05-25 20:56:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/26 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 3/26 places, 3/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3460 reset in 267 ms.
Product exploration explored 100000 steps with 3998 reset in 247 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 (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 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-04000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-00 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X((F(p1)&&G(p2)))&&F(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 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:56:18] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 20:56:18] [INFO ] Implicit Places using invariants in 120 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 123 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s15), p2:(LEQ s15 s5), p1:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 218 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLCardinality-01 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(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.
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.
[2024-05-25 20:56:19] [INFO ] Invariant cache hit.
[2024-05-25 20:56:19] [INFO ] Implicit Places using invariants in 42 ms returned [3, 13]
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.
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 47 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ s17 s8) (LEQ 1 s16)), p0:(GT s17 s8), p2:(LEQ s16 s14)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 19 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-04000-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-02 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||G(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:56:19] [INFO ] Invariant cache hit.
[2024-05-25 20:56:19] [INFO ] Implicit Places using invariants in 36 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s16 s4), p1:(GT s17 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 461 reset in 228 ms.
Product exploration explored 100000 steps with 445 reset in 207 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 329 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), false]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 4) seen :0
Finished Best-First random walk after 886 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 522 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), false]
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 20:56:21] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 20:56:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 20:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:56:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 20:56:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:56:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 20:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:56:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 20:56:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 20:56:22] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 15 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 15 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 7
Applied a total of 20 rules in 186 ms. Remains 11 /22 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-25 20:56:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 20:56:22] [INFO ] Implicit Places using invariants in 32 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 7/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 20:56:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 20:56:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 20:56:22] [INFO ] Invariant cache hit.
[2024-05-25 20:56:22] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/22 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 8/22 places, 6/18 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 246 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), false]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 4) seen :0
Finished Best-First random walk after 2752 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=344 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 549 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), false]
[2024-05-25 20:56:23] [INFO ] Invariant cache hit.
[2024-05-25 20:56:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 20:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:56:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 20:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:56:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 20:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:56:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 20:56:23] [INFO ] Computed and/alt/rep : 5/7/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 20:56:23] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 609 reset in 111 ms.
Product exploration explored 100000 steps with 341 reset in 146 ms.
Built C files in :
/tmp/ltsmin9489523048547074283
[2024-05-25 20:56:24] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:56:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:24] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:56:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:24] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:56:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9489523048547074283
Running compilation step : cd /tmp/ltsmin9489523048547074283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin9489523048547074283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9489523048547074283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12339117978408374463.hoa' '--buchi-type=spotba'
LTSmin run took 2535 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-04000-LTLCardinality-03 finished in 7389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1))&&(p0 U p2)))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 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 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 7
Applied a total of 7 rules in 3 ms. Remains 11 /26 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-25 20:56:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 20:56:27] [INFO ] Implicit Places using invariants in 26 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/26 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 9/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) p1), true, p1, (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p0 (AND p1 p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s5 s8), p2:(LEQ s2 s6), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 93 ms.
Product exploration explored 100000 steps with 3 reset in 134 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 21 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-04000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-04 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 15 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 15 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 5 transition count 5
Applied a total of 21 rules in 151 ms. Remains 5 /26 variables (removed 21) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-25 20:56:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 20:56:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 20:56:27] [INFO ] Invariant cache hit.
[2024-05-25 20:56:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 20:56:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:56:27] [INFO ] Invariant cache hit.
[2024-05-25 20:56:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 5/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s1) (LEQ s4 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 108 ms.
Product exploration explored 100000 steps with 4 reset in 284 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 17 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-04000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-05 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1)||(X(p2) U (p2||F(p3))))))'
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 6 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:56:28] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 20:56:28] [INFO ] Implicit Places using invariants in 55 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 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 72 ms. Remains : 24/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT s10 s15), p2:(LEQ 3 s3), p3:(LEQ s1 s18), p1:(GT 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15508 reset in 100 ms.
Product exploration explored 100000 steps with 15516 reset in 111 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p0) p1 (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-04000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-06 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (p1 U 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 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:56:29] [INFO ] Invariant cache hit.
[2024-05-25 20:56:29] [INFO ] Implicit Places using invariants in 43 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 45 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s16 s6), p1:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 756 reset in 181 ms.
Product exploration explored 100000 steps with 725 reset in 204 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 243 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Finished Best-First random walk after 899 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=449 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 540 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 15 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 15 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 12 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 22 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 23 place count 7 transition count 6
Applied a total of 23 rules in 670 ms. Remains 7 /21 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 20:56:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 20:56:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 20:56:31] [INFO ] Invariant cache hit.
[2024-05-25 20:56:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-25 20:56:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:56:31] [INFO ] Invariant cache hit.
[2024-05-25 20:56:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 770 ms. Remains : 7/21 places, 6/18 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Finished Best-First random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 412 reset in 91 ms.
Product exploration explored 100000 steps with 371 reset in 105 ms.
Built C files in :
/tmp/ltsmin2411072711184017333
[2024-05-25 20:56:32] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:56:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:32] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:56:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:32] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:56:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2411072711184017333
Running compilation step : cd /tmp/ltsmin2411072711184017333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin2411072711184017333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2411072711184017333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18118077451592753648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 20:56:47] [INFO ] Invariant cache hit.
[2024-05-25 20:56:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 20:56:47] [INFO ] Invariant cache hit.
[2024-05-25 20:56:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 20:56:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:56:48] [INFO ] Invariant cache hit.
[2024-05-25 20:56:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin17073724716827713182
[2024-05-25 20:56:48] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:56:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:48] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:56:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:48] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:56:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:56:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17073724716827713182
Running compilation step : cd /tmp/ltsmin17073724716827713182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin17073724716827713182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17073724716827713182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10182243244571596313.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:57:03] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:57:03] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:57:03] [INFO ] Time to serialize gal into /tmp/LTL9648368328777695588.gal : 1 ms
[2024-05-25 20:57:03] [INFO ] Time to serialize properties into /tmp/LTL3022935874297917733.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9648368328777695588.gal' '-t' 'CGAL' '-hoa' '/tmp/aut560472133979168097.hoa' '-atoms' '/tmp/LTL3022935874297917733.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3022935874297917733.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut560472133979168097.hoa
Detected timeout of ITS tools.
[2024-05-25 20:57:18] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:57:18] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:57:18] [INFO ] Time to serialize gal into /tmp/LTL8656887835088502218.gal : 1 ms
[2024-05-25 20:57:18] [INFO ] Time to serialize properties into /tmp/LTL8770290612526573532.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8656887835088502218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8770290612526573532.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(p26<=p15)"))U(("(p22>=2)")U("(p26<=p15)"))))))
Formula 0 simplified : GF(X!"(p26<=p15)" R (!"(p22>=2)" R !"(p26<=p15)"))
Detected timeout of ITS tools.
[2024-05-25 20:57:33] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:57:33] [INFO ] Applying decomposition
[2024-05-25 20:57:33] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18000406740496034356.txt' '-o' '/tmp/graph18000406740496034356.bin' '-w' '/tmp/graph18000406740496034356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18000406740496034356.bin' '-l' '-1' '-v' '-w' '/tmp/graph18000406740496034356.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:57:33] [INFO ] Decomposing Gal with order
[2024-05-25 20:57:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:57:33] [INFO ] Flatten gal took : 54 ms
[2024-05-25 20:57:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 20:57:33] [INFO ] Time to serialize gal into /tmp/LTL15827385950087908405.gal : 2 ms
[2024-05-25 20:57:33] [INFO ] Time to serialize properties into /tmp/LTL14131363781483726416.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15827385950087908405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14131363781483726416.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(gu1.p26<=gu1.p15)"))U(("(gu0.p22>=2)")U("(gu1.p26<=gu1.p15)"))))))
Formula 0 simplified : GF(X!"(gu1.p26<=gu1.p15)" R (!"(gu0.p22>=2)" R !"(gu1.p26<=gu1.p15)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6730064335224251441
[2024-05-25 20:57:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6730064335224251441
Running compilation step : cd /tmp/ltsmin6730064335224251441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin6730064335224251441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6730064335224251441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-04000-LTLCardinality-07 finished in 94646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:58:03] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:58:03] [INFO ] Implicit Places using invariants in 42 ms returned [13, 19]
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.
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 49 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ s9 s3), p0:(LEQ s16 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-04000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-08 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(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 22 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 17 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 7 place count 17 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 17 place count 11 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 8 transition count 6
Applied a total of 21 rules in 967 ms. Remains 8 /26 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 20:58:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 20:58:05] [INFO ] Implicit Places using invariants in 48 ms returned [0, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1027 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s2 s5), p0:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1055 reset in 65 ms.
Product exploration explored 100000 steps with 2272 reset in 144 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 548 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 8005 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2668 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 4 factoid took 570 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 20:58:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:58:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 20:58:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:58:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:58:06] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 20:58:06] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 20:58:06] [INFO ] Invariant cache hit.
[2024-05-25 20:58:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 20:58:06] [INFO ] Invariant cache hit.
[2024-05-25 20:58:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 20:58:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:58:06] [INFO ] Invariant cache hit.
[2024-05-25 20:58:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Finished random walk after 8005 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2668 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-05-25 20:58:07] [INFO ] Invariant cache hit.
[2024-05-25 20:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:58:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 20:58:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:58:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:58:07] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:58:07] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29419 reset in 88 ms.
Product exploration explored 100000 steps with 29567 reset in 69 ms.
Built C files in :
/tmp/ltsmin2308733163791355027
[2024-05-25 20:58:08] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:58:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:08] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:58:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:08] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:58:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2308733163791355027
Running compilation step : cd /tmp/ltsmin2308733163791355027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin2308733163791355027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2308733163791355027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased168183834479588406.hoa' '--buchi-type=spotba'
LTSmin run took 494 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-04000-LTLCardinality-09 finished in 4646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(X(F((p1&&G(p2)))))||G(p3)))&&p0)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:58:08] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:58:08] [INFO ] Implicit Places using invariants in 36 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(OR p0 p3), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={1} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={0} source=5 dest: 6}, { cond=(AND p3 p1 p2), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p3) p1 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={1} source=7 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GT s6 s9) (GT 3 s9)), p3:(GT s6 s9), p1:(GT 1 s3), p2:(GT s3 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 72000 steps with 0 reset in 170 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLCardinality-11 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&(p1||X(p2))) U 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.
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.
[2024-05-25 20:58:09] [INFO ] Invariant cache hit.
[2024-05-25 20:58:09] [INFO ] Implicit Places using invariants in 47 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s13 s12), p1:(LEQ 3 s3), p2:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLCardinality-12 finished in 300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||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.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 8 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 20:58:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 20:58:09] [INFO ] Implicit Places using invariants in 31 ms returned [3, 4, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 2 s4), p0:(GT s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 416 reset in 87 ms.
Product exploration explored 100000 steps with 269 reset in 99 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 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-04000-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-13 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p0||X(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:58:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:58:10] [INFO ] Implicit Places using invariants in 44 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s8 s20), p1:(GT s19 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLCardinality-14 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 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 23 place count 11 transition count 5
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 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
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 30 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 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 3 with 2 rules applied. Total rules applied 37 place count 2 transition count 2
Applied a total of 37 rules in 194 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 20:58:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:58:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 20:58:10] [INFO ] Invariant cache hit.
[2024-05-25 20:58:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 20:58:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:58:10] [INFO ] Invariant cache hit.
[2024-05-25 20:58:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12 reset in 47 ms.
Product exploration explored 100000 steps with 12 reset in 55 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 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 19 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-04000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLCardinality-15 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (p1 U p0)))))'
Found a Lengthening insensitive property : HouseConstruction-PT-04000-LTLCardinality-07
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 20 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 15 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 17 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 24 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 9 transition count 6
Applied a total of 25 rules in 787 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 20:58:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 20:58:12] [INFO ] Implicit Places using invariants in 34 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 825 ms. Remains : 7/26 places, 6/18 transitions.
Running random walk in product with property : HouseConstruction-PT-04000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s4 s1), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 405 reset in 82 ms.
Product exploration explored 100000 steps with 620 reset in 110 ms.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 294 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Finished Best-First random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 539 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 20:58:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 20:58:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 20:58:13] [INFO ] Invariant cache hit.
[2024-05-25 20:58:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 20:58:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:58:13] [INFO ] Invariant cache hit.
[2024-05-25 20:58:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Finished Best-First random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 417 reset in 150 ms.
Product exploration explored 100000 steps with 368 reset in 177 ms.
Built C files in :
/tmp/ltsmin16699566345711215169
[2024-05-25 20:58:15] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:58:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:15] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:58:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:15] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:58:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16699566345711215169
Running compilation step : cd /tmp/ltsmin16699566345711215169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin16699566345711215169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16699566345711215169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16569921946877020785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 20:58:30] [INFO ] Invariant cache hit.
[2024-05-25 20:58:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 20:58:30] [INFO ] Invariant cache hit.
[2024-05-25 20:58:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 20:58:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 20:58:30] [INFO ] Invariant cache hit.
[2024-05-25 20:58:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin14557684841148911859
[2024-05-25 20:58:30] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:58:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:30] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:58:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:30] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:58:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:58:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14557684841148911859
Running compilation step : cd /tmp/ltsmin14557684841148911859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin14557684841148911859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14557684841148911859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3111845069216562230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:58:45] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:58:45] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:58:45] [INFO ] Time to serialize gal into /tmp/LTL6481174765064526216.gal : 0 ms
[2024-05-25 20:58:45] [INFO ] Time to serialize properties into /tmp/LTL10586587822413766515.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6481174765064526216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5646942472227470701.hoa' '-atoms' '/tmp/LTL10586587822413766515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10586587822413766515.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5646942472227470701.hoa
Detected timeout of ITS tools.
[2024-05-25 20:59:00] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:59:00] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:59:00] [INFO ] Time to serialize gal into /tmp/LTL1767334262053530441.gal : 1 ms
[2024-05-25 20:59:00] [INFO ] Time to serialize properties into /tmp/LTL8835008229327110485.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1767334262053530441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8835008229327110485.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(p26<=p15)"))U(("(p22>=2)")U("(p26<=p15)"))))))
Formula 0 simplified : GF(X!"(p26<=p15)" R (!"(p22>=2)" R !"(p26<=p15)"))
Detected timeout of ITS tools.
[2024-05-25 20:59:15] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:59:15] [INFO ] Applying decomposition
[2024-05-25 20:59:15] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2491898185863169538.txt' '-o' '/tmp/graph2491898185863169538.bin' '-w' '/tmp/graph2491898185863169538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2491898185863169538.bin' '-l' '-1' '-v' '-w' '/tmp/graph2491898185863169538.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:59:15] [INFO ] Decomposing Gal with order
[2024-05-25 20:59:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:59:15] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 20:59:15] [INFO ] Time to serialize gal into /tmp/LTL14462173851621251877.gal : 1 ms
[2024-05-25 20:59:15] [INFO ] Time to serialize properties into /tmp/LTL10067475431253532876.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14462173851621251877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10067475431253532876.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(gu0.p26<=gu0.p15)"))U(("(gu1.p22>=2)")U("(gu0.p26<=gu0.p15)"))))))
Formula 0 simplified : GF(X!"(gu0.p26<=gu0.p15)" R (!"(gu1.p22>=2)" R !"(gu0.p26<=gu0.p15)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin659245877078610394
[2024-05-25 20:59:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin659245877078610394
Running compilation step : cd /tmp/ltsmin659245877078610394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin659245877078610394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin659245877078610394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-04000-LTLCardinality-07 finished in 94655 ms.
[2024-05-25 20:59:45] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2012532858020425304
[2024-05-25 20:59:45] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 20:59:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:59:45] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 20:59:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:59:45] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 20:59:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:59:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2012532858020425304
Running compilation step : cd /tmp/ltsmin2012532858020425304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 20:59:45] [INFO ] Applying decomposition
[2024-05-25 20:59:45] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16734479117159703906.txt' '-o' '/tmp/graph16734479117159703906.bin' '-w' '/tmp/graph16734479117159703906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16734479117159703906.bin' '-l' '-1' '-v' '-w' '/tmp/graph16734479117159703906.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:59:45] [INFO ] Decomposing Gal with order
[2024-05-25 20:59:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:59:45] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:59:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 20:59:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality3745016197620306944.gal : 2 ms
[2024-05-25 20:59:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality9713543801677148962.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3745016197620306944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9713543801677148962.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(gu7.p26<=gu7.p15)"))U(("(gi0.gi3.gu6.p22>=2)")U("(gu7.p26<=gu7.p15)"))))))
Formula 0 simplified : GF(X!"(gu7.p26<=gu7.p15)" R (!"(gi0.gi3.gu6.p22>=2)" R !"(gu7.p26<=gu7.p15)"))
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin2012532858020425304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2012532858020425304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: LTL layer: formula: <>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: "<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.023: State length is 27, there are 27 groups
pins2lts-mc-linux64( 0/ 8), 0.023: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.023: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.023: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.068: [Blue] ~118 levels ~960 states ~6072 transitions
pins2lts-mc-linux64( 2/ 8), 0.095: [Blue] ~234 levels ~1920 states ~9480 transitions
pins2lts-mc-linux64( 5/ 8), 0.178: [Blue] ~477 levels ~3840 states ~16504 transitions
pins2lts-mc-linux64( 3/ 8), 0.359: [Blue] ~942 levels ~7680 states ~30064 transitions
pins2lts-mc-linux64( 3/ 8), 0.721: [Blue] ~1902 levels ~15360 states ~49264 transitions
pins2lts-mc-linux64( 2/ 8), 1.255: [Blue] ~3829 levels ~30720 states ~161904 transitions
pins2lts-mc-linux64( 5/ 8), 1.859: [Blue] ~7677 levels ~61440 states ~263352 transitions
pins2lts-mc-linux64( 4/ 8), 2.429: [Blue] ~14734 levels ~122880 states ~485632 transitions
pins2lts-mc-linux64( 4/ 8), 2.860: [Blue] ~29241 levels ~245760 states ~786016 transitions
pins2lts-mc-linux64( 4/ 8), 3.378: [Blue] ~58254 levels ~491520 states ~1386752 transitions
pins2lts-mc-linux64( 4/ 8), 4.184: [Blue] ~72001 levels ~983040 states ~3773776 transitions
pins2lts-mc-linux64( 5/ 8), 5.845: [Blue] ~71996 levels ~1966080 states ~7661328 transitions
pins2lts-mc-linux64( 5/ 8), 8.778: [Blue] ~71996 levels ~3932160 states ~15518192 transitions
pins2lts-mc-linux64( 0/ 8), 15.798: [Blue] ~71989 levels ~7864320 states ~24929008 transitions
pins2lts-mc-linux64( 0/ 8), 29.741: [Blue] ~71989 levels ~15728640 states ~48907928 transitions
pins2lts-mc-linux64( 1/ 8), 81.263: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 81.332:
pins2lts-mc-linux64( 0/ 8), 81.332: Explored 27574198 states 182917548 transitions, fanout: 6.634
pins2lts-mc-linux64( 0/ 8), 81.332: Total exploration time 81.290 sec (81.220 sec minimum, 81.254 sec on average)
pins2lts-mc-linux64( 0/ 8), 81.333: States per second: 339208, Transitions per second: 2250185
pins2lts-mc-linux64( 0/ 8), 81.333:
pins2lts-mc-linux64( 0/ 8), 81.333: State space has 27809475 states, 5198258 are accepting
pins2lts-mc-linux64( 0/ 8), 81.333: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 81.333: blue states: 27574198 (99.15%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 81.333: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 81.333: all-red states: 5198258 (18.69%), bogus 18761 (0.07%)
pins2lts-mc-linux64( 0/ 8), 81.333:
pins2lts-mc-linux64( 0/ 8), 81.333: Total memory used for local state coloring: 8.8MB
pins2lts-mc-linux64( 0/ 8), 81.333:
pins2lts-mc-linux64( 0/ 8), 81.333: Queue width: 8B, total height: 575945, memory: 4.39MB
pins2lts-mc-linux64( 0/ 8), 81.333: Tree memory: 468.2MB, 17.7 B/state, compr.: 16.0%
pins2lts-mc-linux64( 0/ 8), 81.333: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 81.333: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 81.333: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 81.333: Est. total memory use: 472.6MB (~1028.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2012532858020425304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2012532858020425304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 21:20:56] [INFO ] Flatten gal took : 4 ms
[2024-05-25 21:20:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality6559046988257833181.gal : 1 ms
[2024-05-25 21:20:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality16521598273111461081.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6559046988257833181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16521598273111461081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(p26<=p15)"))U(("(p22>=2)")U("(p26<=p15)"))))))
Formula 0 simplified : GF(X!"(p26<=p15)" R (!"(p22>=2)" R !"(p26<=p15)"))
Detected timeout of ITS tools.
[2024-05-25 21:42:07] [INFO ] Flatten gal took : 10 ms
[2024-05-25 21:42:07] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 21:42:07] [INFO ] Transformed 26 places.
[2024-05-25 21:42:07] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 21:42:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality8355897595076184509.gal : 1 ms
[2024-05-25 21:42:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality8710472596693270567.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8355897595076184509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8710472596693270567.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((X("(p26<=p15)"))U(("(p22>=2)")U("(p26<=p15)"))))))
Formula 0 simplified : GF(X!"(p26<=p15)" R (!"(p22>=2)" R !"(p26<=p15)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3491176 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15746176 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-04000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HouseConstruction-PT-04000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r219-smll-171649598000142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-04000.tgz
mv HouseConstruction-PT-04000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;