Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678643321638

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00200
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-12 17:48:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 17:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:48:45] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-12 17:48:45] [INFO ] Transformed 26 places.
[2023-03-12 17:48:45] [INFO ] Transformed 18 transitions.
[2023-03-12 17:48:45] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 27 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:48:46] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-12 17:48:46] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 17:48:46] [INFO ] Invariant cache hit.
[2023-03-12 17:48:46] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-12 17:48:46] [INFO ] Invariant cache hit.
[2023-03-12 17:48:46] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 22 out of 25 places after structural reductions.
[2023-03-12 17:48:46] [INFO ] Flatten gal took : 34 ms
[2023-03-12 17:48:46] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:48:46] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 21 out of 25 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10054 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=189 ) properties (out of 17) seen :16
Finished Best-First random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(((p2||X(p1)) U (p1&&(p2||X(p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 17:48:47] [INFO ] Invariant cache hit.
[2023-03-12 17:48:47] [INFO ] Implicit Places using invariants in 54 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 61 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 640 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s3 1), p0:(GEQ s7 1), p2:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-00 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 17:48:48] [INFO ] Invariant cache hit.
[2023-03-12 17:48:48] [INFO ] Implicit Places using invariants in 56 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 61 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-01 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 4
Applied a total of 4 rules in 27 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2023-03-12 17:48:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 17:48:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 17:48:48] [INFO ] Invariant cache hit.
[2023-03-12 17:48:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-12 17:48:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:48:48] [INFO ] Invariant cache hit.
[2023-03-12 17:48:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 7/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14310 reset in 484 ms.
Product exploration explored 100000 steps with 14196 reset in 316 ms.
Computed a total of 7 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 227 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 52 ms :[(NOT p0)]
Finished random walk after 403 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=201 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 242 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-12 17:48:50] [INFO ] Invariant cache hit.
[2023-03-12 17:48:50] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:48:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 17:48:50] [INFO ] Computed and/alt/rep : 2/5/2 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 17:48:50] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-12 17:48:50] [INFO ] Invariant cache hit.
[2023-03-12 17:48:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 17:48:50] [INFO ] Invariant cache hit.
[2023-03-12 17:48:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-12 17:48:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:48:50] [INFO ] Invariant cache hit.
[2023-03-12 17:48:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 7/7 places, 4/4 transitions.
Computed a total of 7 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 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 50 ms :[(NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=203 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 245 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-12 17:48:51] [INFO ] Invariant cache hit.
[2023-03-12 17:48:51] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:48:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 17:48:51] [INFO ] Computed and/alt/rep : 2/5/2 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 17:48:51] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14276 reset in 260 ms.
Product exploration explored 100000 steps with 14259 reset in 161 ms.
Built C files in :
/tmp/ltsmin2398657424337162675
[2023-03-12 17:48:51] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-12 17:48:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:51] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-12 17:48:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:51] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-12 17:48:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2398657424337162675
Running compilation step : cd /tmp/ltsmin2398657424337162675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin2398657424337162675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin2398657424337162675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased962532524225804239.hoa' '--buchi-type=spotba'
LTSmin run took 2052 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-LTLFireability-03 finished in 5792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:48:54] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:48:54] [INFO ] Implicit Places using invariants in 54 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 59 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 69 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 : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00200-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-04 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 8 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 8 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 12 place count 5 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 12 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 19 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-12 17:48:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 17:48:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 17:48:54] [INFO ] Invariant cache hit.
[2023-03-12 17:48:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-12 17:48:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:48:54] [INFO ] Invariant cache hit.
[2023-03-12 17:48:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-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:(AND (GEQ s2 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 800 steps with 0 reset in 5 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-05 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:48:54] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:48:54] [INFO ] Implicit Places using invariants in 49 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 59 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4639 reset in 165 ms.
Product exploration explored 100000 steps with 4613 reset in 171 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1408 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=469 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 232 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2023-03-12 17:48:56] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 17:48:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-12 17:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:48:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:48:56] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:48:56] [INFO ] Added : 17 causal constraints over 4 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 8 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 4 transition count 3
Applied a total of 7 rules in 8 ms. Remains 4 /22 variables (removed 18) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-12 17:48:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:48:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 17:48:56] [INFO ] Invariant cache hit.
[2023-03-12 17:48:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-12 17:48:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:48:56] [INFO ] Invariant cache hit.
[2023-03-12 17:48:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 4/22 places, 3/18 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 229 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 51 ms :[(NOT p0)]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 244 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-12 17:48:57] [INFO ] Invariant cache hit.
[2023-03-12 17:48:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:48:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 17:48:57] [INFO ] Computed and/alt/rep : 2/3/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:48:57] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25037 reset in 100 ms.
Product exploration explored 100000 steps with 24997 reset in 118 ms.
Built C files in :
/tmp/ltsmin9767328734984211796
[2023-03-12 17:48:57] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2023-03-12 17:48:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:57] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2023-03-12 17:48:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:57] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2023-03-12 17:48:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 17:48:57] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9767328734984211796
Running compilation step : cd /tmp/ltsmin9767328734984211796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin9767328734984211796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9767328734984211796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3962089718665832186.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-LTLFireability-07 finished in 2744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:48:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:48:57] [INFO ] Implicit Places using invariants in 58 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 59 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15139 reset in 86 ms.
Product exploration explored 100000 steps with 15101 reset in 130 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 403 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=201 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 234 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-12 17:48:58] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 17:48:58] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:48:58] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-12 17:48:58] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:48:58] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 4 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 5 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 17:48:58] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 17:48:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 17:48:58] [INFO ] Invariant cache hit.
[2023-03-12 17:48:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-12 17:48:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:48:58] [INFO ] Invariant cache hit.
[2023-03-12 17:48:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 2/21 places, 2/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00200-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-08 finished in 1436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)&&G(F(p0))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 10 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 7 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 8 transition count 5
Applied a total of 8 rules in 13 ms. Remains 8 /25 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-12 17:48:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 17:48:59] [INFO ] Implicit Places using invariants in 35 ms returned [2, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 4037 reset in 195 ms.
Product exploration explored 100000 steps with 4096 reset in 272 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 528 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00200-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-09 finished in 1371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 11 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 11 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 17:49:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 17:49:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 17:49:00] [INFO ] Invariant cache hit.
[2023-03-12 17:49:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-12 17:49:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:49:00] [INFO ] Invariant cache hit.
[2023-03-12 17:49:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 518 steps with 11 reset in 1 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-10 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(X(F(p1)))))||G(F(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:49:00] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 17:49:00] [INFO ] Implicit Places using invariants in 46 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 52 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s1 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29800 reset in 102 ms.
Product exploration explored 100000 steps with 29688 reset in 112 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 486 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 7 factoid took 480 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-12 17:49:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 17:49:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 17:49:02] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 17:49:02] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 17:49:02] [INFO ] Invariant cache hit.
[2023-03-12 17:49:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 17:49:03] [INFO ] Invariant cache hit.
[2023-03-12 17:49:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-12 17:49:03] [INFO ] Invariant cache hit.
[2023-03-12 17:49:03] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-12 17:49:04] [INFO ] Invariant cache hit.
[2023-03-12 17:49:04] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 17:49:04] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 17:49:04] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21239 reset in 81 ms.
Product exploration explored 100000 steps with 21280 reset in 92 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 2 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
[2023-03-12 17:49:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 17:49:05] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 17:49:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34 ms. Remains : 2/21 places, 2/18 transitions.
Built C files in :
/tmp/ltsmin15026553992098590370
[2023-03-12 17:49:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15026553992098590370
Running compilation step : cd /tmp/ltsmin15026553992098590370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin15026553992098590370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15026553992098590370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5412174150411045470.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-LTLFireability-11 finished in 4766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(F((!p1 U (G(!p1)||(!p1&&(X(!p3)||p2)))))))))&&p0)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:49:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:49:05] [INFO ] Implicit Places using invariants in 41 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1, p1, p1, (AND p1 p3)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p3), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1)), p1:(GEQ s1 1), p2:(OR (LT s16 1) (LT s17 1) (LT s20 1)), p3:(AND (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-12 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(!p0)||F(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 6 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 5 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-12 17:49:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 17:49:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 17:49:06] [INFO ] Invariant cache hit.
[2023-03-12 17:49:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-12 17:49:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:49:06] [INFO ] Invariant cache hit.
[2023-03-12 17:49:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10914 reset in 104 ms.
Product exploration explored 100000 steps with 10496 reset in 151 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 288 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-00200-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-13 finished in 788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)&&(p0||X(p0))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:49:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:49:06] [INFO ] Implicit Places using invariants in 52 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 58 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s12 1), p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3544 reset in 218 ms.
Product exploration explored 100000 steps with 3516 reset in 189 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 548 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2815 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=563 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 565 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-12 17:49:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 17:49:09] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 17:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:49:09] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:49:09] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 17:49:09] [INFO ] Added : 17 causal constraints over 4 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 17:49:09] [INFO ] Invariant cache hit.
[2023-03-12 17:49:09] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 17:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 17:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:49:09] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 17:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 17:49:09] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 17:49:09] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 10 transition count 6
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 11 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 15 place count 4 transition count 4
Applied a total of 15 rules in 8 ms. Remains 4 /21 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-12 17:49:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 17:49:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 17:49:09] [INFO ] Invariant cache hit.
[2023-03-12 17:49:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-12 17:49:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:49:09] [INFO ] Invariant cache hit.
[2023-03-12 17:49:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 4/21 places, 4/18 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 747 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 403 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 806 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 17:49:11] [INFO ] Invariant cache hit.
[2023-03-12 17:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 17:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 17:49:11] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:49:11] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 17:49:11] [INFO ] Invariant cache hit.
[2023-03-12 17:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 17:49:11] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 17:49:11] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 1031 steps with 12 reset in 3 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-14 finished in 5189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p1))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 17:49:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:49:12] [INFO ] Implicit Places using invariants in 59 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3600 steps with 0 reset in 14 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-15 finished in 210 ms.
All properties solved by simple procedures.
Total runtime 26791 ms.

BK_STOP 1678643353781

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-00200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-167840344400564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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