Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406600165.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HouseConstruction-PT-00020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406600165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 144K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 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-00020-00
FORMULA_NAME HouseConstruction-PT-00020-01
FORMULA_NAME HouseConstruction-PT-00020-02
FORMULA_NAME HouseConstruction-PT-00020-03
FORMULA_NAME HouseConstruction-PT-00020-04
FORMULA_NAME HouseConstruction-PT-00020-05
FORMULA_NAME HouseConstruction-PT-00020-06
FORMULA_NAME HouseConstruction-PT-00020-07
FORMULA_NAME HouseConstruction-PT-00020-08
FORMULA_NAME HouseConstruction-PT-00020-09
FORMULA_NAME HouseConstruction-PT-00020-10
FORMULA_NAME HouseConstruction-PT-00020-11
FORMULA_NAME HouseConstruction-PT-00020-12
FORMULA_NAME HouseConstruction-PT-00020-13
FORMULA_NAME HouseConstruction-PT-00020-14
FORMULA_NAME HouseConstruction-PT-00020-15

=== Now, execution of the tool begins

BK_START 1620795917095

Running Version 0
[2021-05-12 05:05:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 05:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 05:05:20] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-12 05:05:20] [INFO ] Transformed 26 places.
[2021-05-12 05:05:20] [INFO ] Transformed 18 transitions.
[2021-05-12 05:05:20] [INFO ] Parsed PT model containing 26 places and 18 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions, 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 37 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:05:20] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-12 05:05:20] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:05:20] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-12 05:05:20] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:05:20] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:05:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 05:05:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 05:05:20] [INFO ] Flatten gal took : 38 ms
FORMULA HouseConstruction-PT-00020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00020-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 05:05:20] [INFO ] Flatten gal took : 5 ms
[2021-05-12 05:05:20] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 1284 steps, including 3 resets, run visited all 21 properties in 18 ms. (steps per millisecond=71 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&X(X(X(G(p1))))))||(p0&&X(X(X(G((p1&&F(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:05:21] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-12 05:05:21] [INFO ] Implicit Places using invariants in 57 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:05:21] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:05:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1))), (AND p1 (NOT p2)), (NOT p2), (NOT p1), (OR (AND p1 (NOT p2) (NOT p0)) (AND p0 (NOT p1))), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00020-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 10}], [{ cond=p1, acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=p0, acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 2}, { cond=p1, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(LT s11 1), p1:(OR (LT s8 1) (LT s9 1)), p2:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-00 finished in 789 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:05:21] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:05:21] [INFO ] Implicit Places using invariants in 22 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:05:21] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:05:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s2 1), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-02 finished in 258 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:05:22] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:05:22] [INFO ] Implicit Places using invariants in 22 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:05:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:05:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:05:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:05:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-00020-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s21 1), p1:(AND (LT s21 1) (OR (LT s16 1) (LT s17 1) (LT s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-03 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:05:22] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:05:22] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:05:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:05:22] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-12 05:05:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. 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-00020-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-00020-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00020-04 finished in 940 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||X(F(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:05:23] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:05:23] [INFO ] Implicit Places using invariants in 160 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:05:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 05:05:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:05:23] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:05:23] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-00020-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s3 1) (GEQ s7 1)), p1:(OR (LT s9 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7817 reset in 418 ms.
Product exploration explored 100000 steps with 7845 reset in 310 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), p1]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7818 reset in 87 ms.
Product exploration explored 100000 steps with 7824 reset in 108 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 21 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 17
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 7 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-12 05:05:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-12 05:05:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:05:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/22 places, 14/18 transitions.
Product exploration explored 100000 steps with 9809 reset in 365 ms.
Product exploration explored 100000 steps with 9890 reset in 220 ms.
[2021-05-12 05:05:25] [INFO ] Flatten gal took : 5 ms
[2021-05-12 05:05:25] [INFO ] Flatten gal took : 6 ms
[2021-05-12 05:05:25] [INFO ] Time to serialize gal into /tmp/LTL9324476066647453649.gal : 18 ms
[2021-05-12 05:05:25] [INFO ] Time to serialize properties into /tmp/LTL7805255245568492235.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9324476066647453649.gal, -t, CGAL, -LTL, /tmp/LTL7805255245568492235.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9324476066647453649.gal -t CGAL -LTL /tmp/LTL7805255245568492235.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("((p8>=1)&&(p9>=1))")))||("((((p8>=1)&&(p9>=1))&&(p4>=1))&&(p15>=1))"))))))
Formula 0 simplified : !XXF("((((p8>=1)&&(p9>=1))&&(p4>=1))&&(p15>=1))" | XF"((p8>=1)&&(p9>=1))")
Detected timeout of ITS tools.
[2021-05-12 05:05:40] [INFO ] Flatten gal took : 17 ms
[2021-05-12 05:05:40] [INFO ] Applying decomposition
[2021-05-12 05:05:40] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14761627152570459546.txt, -o, /tmp/graph14761627152570459546.bin, -w, /tmp/graph14761627152570459546.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14761627152570459546.bin, -l, -1, -v, -w, /tmp/graph14761627152570459546.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:05:41] [INFO ] Decomposing Gal with order
[2021-05-12 05:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:05:41] [INFO ] Flatten gal took : 96 ms
[2021-05-12 05:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 05:05:41] [INFO ] Time to serialize gal into /tmp/LTL16095948720924114793.gal : 1 ms
[2021-05-12 05:05:41] [INFO ] Time to serialize properties into /tmp/LTL14260765640844280391.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16095948720924114793.gal, -t, CGAL, -LTL, /tmp/LTL14260765640844280391.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16095948720924114793.gal -t CGAL -LTL /tmp/LTL14260765640844280391.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("((i1.u2.p8>=1)&&(u3.p9>=1))")))||("((((i1.u2.p8>=1)&&(u3.p9>=1))&&(u7.p4>=1))&&(i1.u1.p15>=1))"))))))
Formula 0 simplified : !XXF("((((i1.u2.p8>=1)&&(u3.p9>=1))&&(u7.p4>=1))&&(i1.u1.p15>=1))" | XF"((i1.u2.p8>=1)&&(u3.p9>=1))")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2105974017326571462
[2021-05-12 05:05:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2105974017326571462
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2105974017326571462]
Compilation finished in 203 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2105974017326571462]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((X(<>((LTLAPp0==true)))||(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2105974017326571462]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00020-05 finished in 48025 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:06:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:06:11] [INFO ] Implicit Places using invariants in 18 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 19 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:06:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:06:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:06:11] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-12 05:06:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s14 1), p0:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-06 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1||X(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:06:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:06:11] [INFO ] Implicit Places using invariants in 19 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:06:11] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 05:06:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:06:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:06:11] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), false, false]
Running random walk in product with property : HouseConstruction-PT-00020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s10 1)), p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33205 reset in 68 ms.
Product exploration explored 100000 steps with 33088 reset in 65 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), false, false]
Product exploration explored 100000 steps with 33211 reset in 58 ms.
Product exploration explored 100000 steps with 33218 reset in 68 ms.
Applying partial POR strategy [true, true, true, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), false, false]
Support contains 5 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 23 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 23 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 20 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 5 ms. Remains 18 /23 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 05:06:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-12 05:06:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:06:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 30570 reset in 98 ms.
Product exploration explored 100000 steps with 30407 reset in 115 ms.
[2021-05-12 05:06:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:06:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:06:12] [INFO ] Time to serialize gal into /tmp/LTL4528594743431149374.gal : 0 ms
[2021-05-12 05:06:12] [INFO ] Time to serialize properties into /tmp/LTL17399594820475176961.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4528594743431149374.gal, -t, CGAL, -LTL, /tmp/LTL17399594820475176961.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4528594743431149374.gal -t CGAL -LTL /tmp/LTL17399594820475176961.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p8<1)||(p9<1))"))&&(F(G(("(((p12>=1)&&(p10>=1))&&(p13>=1))")||(X("(((p12<1)||(p10<1))||(p13<1))"))))))))
Formula 0 simplified : !G(F"((p8<1)||(p9<1))" & FG("(((p12>=1)&&(p10>=1))&&(p13>=1))" | X"(((p12<1)||(p10<1))||(p13<1))"))
Detected timeout of ITS tools.
[2021-05-12 05:06:27] [INFO ] Flatten gal took : 3 ms
[2021-05-12 05:06:27] [INFO ] Applying decomposition
[2021-05-12 05:06:27] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14306827536862292055.txt, -o, /tmp/graph14306827536862292055.bin, -w, /tmp/graph14306827536862292055.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14306827536862292055.bin, -l, -1, -v, -w, /tmp/graph14306827536862292055.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:06:27] [INFO ] Decomposing Gal with order
[2021-05-12 05:06:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:06:27] [INFO ] Flatten gal took : 3 ms
[2021-05-12 05:06:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 05:06:27] [INFO ] Time to serialize gal into /tmp/LTL1308907306902244984.gal : 3 ms
[2021-05-12 05:06:27] [INFO ] Time to serialize properties into /tmp/LTL14719468396587092369.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1308907306902244984.gal, -t, CGAL, -LTL, /tmp/LTL14719468396587092369.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1308907306902244984.gal -t CGAL -LTL /tmp/LTL14719468396587092369.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.u3.p8<1)||(i2.u3.p9<1))"))&&(F(G(("(((u4.p12>=1)&&(i2.u3.p10>=1))&&(i2.u1.p13>=1))")||(X("(((u4.p12<1)||(i2.u3.p10<1))||(i2.u1.p13<1))"))))))))
Formula 0 simplified : !G(F"((i2.u3.p8<1)||(i2.u3.p9<1))" & FG("(((u4.p12>=1)&&(i2.u3.p10>=1))&&(i2.u1.p13>=1))" | X"(((u4.p12<1)||(i2.u3.p10<1))||(i2.u1.p13<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3171955416221541039
[2021-05-12 05:06:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3171955416221541039
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3171955416221541039]
Compilation finished in 143 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3171955416221541039]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(!(LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3171955416221541039]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00020-07 finished in 46232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 18 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 18 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 19 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 11 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 10 transition count 5
Applied a total of 25 rules in 9 ms. Remains 10 /25 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 10 cols
[2021-05-12 05:06:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:06:57] [INFO ] Implicit Places using invariants in 12 ms returned [0, 5, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
[2021-05-12 05:06:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 05:06:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 7/25 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-12 05:06:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 05:06:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00020-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s5 1) (LT s2 1)), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-08 finished in 89 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:06:57] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:06:57] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 16 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:06:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:06:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-10 finished in 153 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(((X((p0 U p2))||p1) U G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:06:57] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:06:57] [INFO ] Implicit Places using invariants in 20 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:06:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:06:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:06:58] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p0), (NOT p3), (NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : HouseConstruction-PT-00020-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p3), acceptance={} source=7 dest: 2}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s0 1), p3:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(OR (LT s8 1) (LT s11 1) (LT s12 1)), p2:(AND (OR (LT s8 1) (LT s11 1) (LT s12 1)) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 119 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-11 finished in 353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(!p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 16 transition count 9
Applied a total of 16 rules in 3 ms. Remains 16 /25 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 16 cols
[2021-05-12 05:06:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:06:58] [INFO ] Implicit Places using invariants in 21 ms returned [1, 4, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
[2021-05-12 05:06:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2021-05-12 05:06:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:06:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 13/25 places, 9/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 05:06:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:06:58] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 05:06:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:06:58] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : HouseConstruction-PT-00020-12 automaton TGBA [mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s7 1) (OR (LT s10 1) (LT s11 1)))), p1:(AND (GEQ s3 1) (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 621 reset in 239 ms.
Product exploration explored 100000 steps with 621 reset in 294 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 621 reset in 123 ms.
Product exploration explored 100000 steps with 621 reset in 140 ms.
[2021-05-12 05:06:59] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:06:59] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:06:59] [INFO ] Time to serialize gal into /tmp/LTL10565724345446041040.gal : 0 ms
[2021-05-12 05:06:59] [INFO ] Time to serialize properties into /tmp/LTL13215215174870212139.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10565724345446041040.gal, -t, CGAL, -LTL, /tmp/LTL13215215174870212139.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10565724345446041040.gal -t CGAL -LTL /tmp/LTL13215215174870212139.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p12<1)||(p10<1))||(p13<1))"))&&("((p6<1)||((((p12>=1)&&(p10>=1))&&(p13>=1))&&((p21<1)||(p23<1))))"))))
Formula 0 simplified : !F("((p6<1)||((((p12>=1)&&(p10>=1))&&(p13>=1))&&((p21<1)||(p23<1))))" & G"(((p12<1)||(p10<1))||(p13<1))")
Reverse transition relation is NOT exact ! Due to transitions t16.t5.t7.t6.t17.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/7/1/8
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-12 05:07:14] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:07:14] [INFO ] Applying decomposition
[2021-05-12 05:07:14] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7590367487006649450.txt, -o, /tmp/graph7590367487006649450.bin, -w, /tmp/graph7590367487006649450.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7590367487006649450.bin, -l, -1, -v, -w, /tmp/graph7590367487006649450.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:07:14] [INFO ] Decomposing Gal with order
[2021-05-12 05:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:07:14] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 05:07:14] [INFO ] Time to serialize gal into /tmp/LTL15622685288502925989.gal : 1 ms
[2021-05-12 05:07:14] [INFO ] Time to serialize properties into /tmp/LTL12213073207329630335.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15622685288502925989.gal, -t, CGAL, -LTL, /tmp/LTL12213073207329630335.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15622685288502925989.gal -t CGAL -LTL /tmp/LTL12213073207329630335.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(((u0.p12<1)||(u2.p10<1))||(u1.p13<1))"))&&("((u0.p6<1)||((((u0.p12>=1)&&(u2.p10>=1))&&(u1.p13>=1))&&((u3.p21<1)||(u4.p23<1))))"))))
Formula 0 simplified : !F("((u0.p6<1)||((((u0.p12>=1)&&(u2.p10>=1))&&(u1.p13>=1))&&((u3.p21<1)||(u4.p23<1))))" & G"(((u0.p12<1)||(u2.p10<1))||(u1.p13<1))")
Reverse transition relation is NOT exact ! Due to transitions t16_t5_t7_t6_t17_t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/7/1/8
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5951004820787945701
[2021-05-12 05:07:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5951004820787945701
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5951004820787945701]
Compilation finished in 111 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5951004820787945701]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([]((LTLAPp0==true))&&(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5951004820787945701]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00020-12 finished in 46214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((X(!p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:07:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:07:44] [INFO ] Implicit Places using invariants in 16 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:44] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:44] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : HouseConstruction-PT-00020-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5177 reset in 95 ms.
Product exploration explored 100000 steps with 5239 reset in 110 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p0)))
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:07:45] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5502 reset in 87 ms.
Product exploration explored 100000 steps with 5439 reset in 102 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 23 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 23 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 20 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 5 ms. Remains 18 /23 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 05:07:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 10391 reset in 72 ms.
Product exploration explored 100000 steps with 10433 reset in 83 ms.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:45] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 05:07:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:07:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:07:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620796066895

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-00020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00020, 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 r121-tall-162075406600165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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