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-162075406600197.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-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406600197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.3K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 4.2K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-00500-00
FORMULA_NAME HouseConstruction-PT-00500-01
FORMULA_NAME HouseConstruction-PT-00500-02
FORMULA_NAME HouseConstruction-PT-00500-03
FORMULA_NAME HouseConstruction-PT-00500-04
FORMULA_NAME HouseConstruction-PT-00500-05
FORMULA_NAME HouseConstruction-PT-00500-06
FORMULA_NAME HouseConstruction-PT-00500-07
FORMULA_NAME HouseConstruction-PT-00500-08
FORMULA_NAME HouseConstruction-PT-00500-09
FORMULA_NAME HouseConstruction-PT-00500-10
FORMULA_NAME HouseConstruction-PT-00500-11
FORMULA_NAME HouseConstruction-PT-00500-12
FORMULA_NAME HouseConstruction-PT-00500-13
FORMULA_NAME HouseConstruction-PT-00500-14
FORMULA_NAME HouseConstruction-PT-00500-15

=== Now, execution of the tool begins

BK_START 1620803618089

Running Version 0
[2021-05-12 07:13:39] [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 07:13:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 07:13:39] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 07:13:39] [INFO ] Transformed 26 places.
[2021-05-12 07:13:39] [INFO ] Transformed 18 transitions.
[2021-05-12 07:13:39] [INFO ] Parsed PT model containing 26 places and 18 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 07:13:39] [INFO ] Initial state test concluded for 1 properties.
FORMULA HouseConstruction-PT-00500-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 13 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 07:13:39] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-12 07:13:39] [INFO ] Implicit Places using invariants in 73 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 07:13:39] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-12 07:13:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 6 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 07:13:39] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 07:13:39] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 07:13:39] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 07:13:39] [INFO ] Flatten gal took : 18 ms
FORMULA HouseConstruction-PT-00500-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00500-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00500-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 07:13:39] [INFO ] Flatten gal took : 4 ms
[2021-05-12 07:13:40] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100211 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=2132 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 07:13:40] [INFO ] Computed 7 place invariants in 0 ms
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)&&(X(p1) U (X(p2)||F(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:13:40] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-12 07:13:40] [INFO ] Implicit Places using invariants in 20 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:13:40] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-12 07:13:40] [INFO ] Dead Transitions using invariants and state equation in 33 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 07:13:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:13:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : HouseConstruction-PT-00500-00 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=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s1 1), p3:(GEQ s11 1), p1:(GEQ s3 1), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11578 reset in 210 ms.
Product exploration explored 100000 steps with 11765 reset in 152 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 (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (NOT p0), (NOT p3), (NOT p1), (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p0)))
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
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, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:13:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:13:41] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:13:41] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 07:13:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:13:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:13:41] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 9062 steps with 6 reset in 20 ms.
FORMULA HouseConstruction-PT-00500-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00500-00 finished in 1308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||X(G(!p1))) U 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 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 07:13:41] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 07:13:41] [INFO ] Implicit Places using invariants in 19 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 07:13:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 07:13:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 07:13:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:13:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), p1, (AND p1 (NOT p0)), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00500-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} 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=[p2:(AND (GEQ s13 1) (GEQ s14 1)), p0:(GEQ s3 1), p1:(GEQ s11 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 40 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00500-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00500-01 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((!p0&&X(p0))||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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:13:41] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-12 07:13:41] [INFO ] Implicit Places using invariants in 17 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 07:13:41] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-12 07:13:41] [INFO ] Dead Transitions using invariants and state equation in 33 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 07:13:41] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 07:13:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00500-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 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 5515 reset in 87 ms.
Product exploration explored 100000 steps with 5552 reset in 95 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))), (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5476 reset in 86 ms.
Product exploration explored 100000 steps with 5537 reset in 98 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 43 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 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 10 ms. Remains 18 /23 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 07:13:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-12 07:13:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 07:13:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 10706 reset in 243 ms.
Product exploration explored 100000 steps with 10664 reset in 124 ms.
[2021-05-12 07:13:42] [INFO ] Flatten gal took : 3 ms
[2021-05-12 07:13:42] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:13:42] [INFO ] Time to serialize gal into /tmp/LTL13156382274872149131.gal : 1 ms
[2021-05-12 07:13:42] [INFO ] Time to serialize properties into /tmp/LTL9178151959922094690.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/LTL13156382274872149131.gal, -t, CGAL, -LTL, /tmp/LTL9178151959922094690.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/LTL13156382274872149131.gal -t CGAL -LTL /tmp/LTL9178151959922094690.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p12>=1)&&(p10>=1))&&(p13>=1))"))||((X("(((p12>=1)&&(p10>=1))&&(p13>=1))"))&&("(((p12<1)||(p10<1))||(p13<1))")))))
Formula 0 simplified : !F(G"(((p12>=1)&&(p10>=1))&&(p13>=1))" | ("(((p12<1)||(p10<1))||(p13<1))" & X"(((p12>=1)&&(p10>=1))&&(p13>=1))"))
Detected timeout of ITS tools.
[2021-05-12 07:13:57] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:13:57] [INFO ] Applying decomposition
[2021-05-12 07:13:57] [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/graph11234810171817501456.txt, -o, /tmp/graph11234810171817501456.bin, -w, /tmp/graph11234810171817501456.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/graph11234810171817501456.bin, -l, -1, -v, -w, /tmp/graph11234810171817501456.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 07:13:57] [INFO ] Decomposing Gal with order
[2021-05-12 07:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 07:13:57] [INFO ] Flatten gal took : 22 ms
[2021-05-12 07:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 07:13:57] [INFO ] Time to serialize gal into /tmp/LTL5497584577123557997.gal : 3 ms
[2021-05-12 07:13:57] [INFO ] Time to serialize properties into /tmp/LTL8119417639497934866.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/LTL5497584577123557997.gal, -t, CGAL, -LTL, /tmp/LTL8119417639497934866.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/LTL5497584577123557997.gal -t CGAL -LTL /tmp/LTL8119417639497934866.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i0.u1.p12>=1)&&(i1.u4.p10>=1))&&(i1.u2.p13>=1))"))||((X("(((i0.u1.p12>=1)&&(i1.u4.p10>=1))&&(i1.u2.p13>=1))"))&&("(((i0.u1.p12<1)||(i1.u4.p10<1))||(i1.u2.p13<1))")))))
Formula 0 simplified : !F(G"(((i0.u1.p12>=1)&&(i1.u4.p10>=1))&&(i1.u2.p13>=1))" | ("(((i0.u1.p12<1)||(i1.u4.p10<1))||(i1.u2.p13<1))" & X"(((i0.u1.p12>=1)&&(i1.u4.p10>=1))&&(i1.u2.p13>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4258003962590123348
[2021-05-12 07:14:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4258003962590123348
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/ltsmin4258003962590123348]
Compilation finished in 184 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4258003962590123348]
Link finished in 36 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))||(X((LTLAPp0==true))&&!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4258003962590123348]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00500-02 finished in 46308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:14:27] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 07:14:27] [INFO ] Implicit Places using invariants in 22 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:14:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:14:27] [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 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 07:14:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 07:14:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00500-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s2 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][false, false, false]]
Product exploration explored 100000 steps with 5550 reset in 109 ms.
Product exploration explored 100000 steps with 5481 reset in 169 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-00500-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00500-04 finished in 454 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:14:28] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 07:14:28] [INFO ] Implicit Places using invariants in 12 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 07:14:28] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-12 07:14:28] [INFO ] Dead Transitions using invariants and state equation in 23 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 07:14:28] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 07:14:28] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00500-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 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 5464 reset in 83 ms.
Product exploration explored 100000 steps with 5507 reset in 94 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))), (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5551 reset in 85 ms.
Product exploration explored 100000 steps with 5548 reset in 92 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 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 4 ms. Remains 18 /23 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 07:14:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-12 07:14:29] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 07:14:29] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 9113 reset in 149 ms.
Product exploration explored 100000 steps with 9048 reset in 155 ms.
[2021-05-12 07:14:29] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:14:29] [INFO ] Flatten gal took : 1 ms
[2021-05-12 07:14:29] [INFO ] Time to serialize gal into /tmp/LTL13858475227770630600.gal : 0 ms
[2021-05-12 07:14:29] [INFO ] Time to serialize properties into /tmp/LTL4426439104519594007.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/LTL13858475227770630600.gal, -t, CGAL, -LTL, /tmp/LTL4426439104519594007.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/LTL13858475227770630600.gal -t CGAL -LTL /tmp/LTL4426439104519594007.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p12>=1)&&(p10>=1))&&(p13>=1))"))))
Formula 0 simplified : !XF"(((p12>=1)&&(p10>=1))&&(p13>=1))"
Detected timeout of ITS tools.
[2021-05-12 07:14:44] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:14:44] [INFO ] Applying decomposition
[2021-05-12 07:14:44] [INFO ] Flatten gal took : 4 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/graph1600748177614333218.txt, -o, /tmp/graph1600748177614333218.bin, -w, /tmp/graph1600748177614333218.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/graph1600748177614333218.bin, -l, -1, -v, -w, /tmp/graph1600748177614333218.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 07:14:44] [INFO ] Decomposing Gal with order
[2021-05-12 07:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 07:14:44] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:14:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 07:14:44] [INFO ] Time to serialize gal into /tmp/LTL5907911732246799171.gal : 0 ms
[2021-05-12 07:14:44] [INFO ] Time to serialize properties into /tmp/LTL10487217127081046190.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/LTL5907911732246799171.gal, -t, CGAL, -LTL, /tmp/LTL10487217127081046190.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/LTL5907911732246799171.gal -t CGAL -LTL /tmp/LTL10487217127081046190.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(((i0.u1.p12>=1)&&(i2.u4.p10>=1))&&(i2.u2.p13>=1))"))))
Formula 0 simplified : !XF"(((i0.u1.p12>=1)&&(i2.u4.p10>=1))&&(i2.u2.p13>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9938927194897562423
[2021-05-12 07:14:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9938927194897562423
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/ltsmin9938927194897562423]
Compilation finished in 123 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9938927194897562423]
Link finished in 30 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(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9938927194897562423]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00500-05 finished in 46078 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F((p1||X(F((F(p3)&&p2))))))))], 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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:15:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 07:15:14] [INFO ] Implicit Places using invariants in 14 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 14 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 07:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:15:14] [INFO ] Dead Transitions using invariants and state equation in 15 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 07:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 07:15:14] [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 154 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00500-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s5 1) (GEQ s11 1)), p2:(AND (GEQ s5 1) (GEQ s11 1)), p3:(GEQ s14 1), p0:(OR (LT s17 1) (LT s18 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2252 reset in 144 ms.
Product exploration explored 100000 steps with 2271 reset in 165 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 (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G p0)), (NOT p1), (NOT p2), (NOT p3), p0]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 2277 reset in 140 ms.
Product exploration explored 100000 steps with 2245 reset in 158 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 5 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 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 4 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-12 07:15:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-12 07:15:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 07:15:15] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 5765 reset in 172 ms.
Product exploration explored 100000 steps with 5778 reset in 195 ms.
[2021-05-12 07:15:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 07:15:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 07:15:16] [INFO ] Time to serialize gal into /tmp/LTL6530938108833135595.gal : 0 ms
[2021-05-12 07:15:16] [INFO ] Time to serialize properties into /tmp/LTL6682937621794354293.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/LTL6530938108833135595.gal, -t, CGAL, -LTL, /tmp/LTL6682937621794354293.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/LTL6530938108833135595.gal -t CGAL -LTL /tmp/LTL6682937621794354293.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p21<1)||(p23<1))"))||(F(("((p7>=1)&&(p17>=1))")||(X(F(("((p7>=1)&&(p17>=1))")&&(F("(p18>=1)"))))))))))
Formula 0 simplified : !X(G"((p21<1)||(p23<1))" | F("((p7>=1)&&(p17>=1))" | XF("((p7>=1)&&(p17>=1))" & F"(p18>=1)")))
Detected timeout of ITS tools.
[2021-05-12 07:15:31] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:15:31] [INFO ] Applying decomposition
[2021-05-12 07:15:31] [INFO ] Flatten gal took : 1 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/graph6648354790305792910.txt, -o, /tmp/graph6648354790305792910.bin, -w, /tmp/graph6648354790305792910.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/graph6648354790305792910.bin, -l, -1, -v, -w, /tmp/graph6648354790305792910.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 07:15:31] [INFO ] Decomposing Gal with order
[2021-05-12 07:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 07:15:31] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 07:15:31] [INFO ] Time to serialize gal into /tmp/LTL18143218681946888364.gal : 0 ms
[2021-05-12 07:15:31] [INFO ] Time to serialize properties into /tmp/LTL17964201229667519936.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/LTL18143218681946888364.gal, -t, CGAL, -LTL, /tmp/LTL17964201229667519936.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/LTL18143218681946888364.gal -t CGAL -LTL /tmp/LTL17964201229667519936.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((u6.p21<1)||(u5.p23<1))"))||(F(("((i4.u1.p7>=1)&&(i0.u4.p17>=1))")||(X(F(("((i4.u1.p7>=1)&&(i0.u4.p17>=1))")&&(F("(u6.p18>=1)"))))))))))
Formula 0 simplified : !X(G"((u6.p21<1)||(u5.p23<1))" | F("((i4.u1.p7>=1)&&(i0.u4.p17>=1))" | XF("((i4.u1.p7>=1)&&(i0.u4.p17>=1))" & F"(u6.p18>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15511327605464949055
[2021-05-12 07:15:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15511327605464949055
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/ltsmin15511327605464949055]
Compilation finished in 129 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15511327605464949055]
Link finished in 30 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(([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X(<>((<>((LTLAPp3==true))&&(LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15511327605464949055]
LTSmin run took 329 ms.
FORMULA HouseConstruction-PT-00500-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00500-06 finished in 32446 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0 U p1)||G(F((p2||G(!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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 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 20 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 19 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 19 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 16 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 9
Applied a total of 15 rules in 24 ms. Remains 15 /25 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 15 cols
[2021-05-12 07:15:46] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 07:15:46] [INFO ] Implicit Places using invariants in 13 ms returned [0, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-12 07:15:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2021-05-12 07:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:15:46] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 13/25 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-12 07:15:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2021-05-12 07:15:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 07:15:46] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 69 ms :[false, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00500-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s9 1)), p0:(GEQ s11 1), p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11484 reset in 92 ms.
Product exploration explored 100000 steps with 11520 reset in 105 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
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 p1))), (F (G (NOT p0))), (F (G (NOT p2))), (NOT p1), (NOT p0), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
FORMULA HouseConstruction-PT-00500-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00500-07 finished in 391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||(p1&&(G((!p2&&X(p0)))||G(p3))))))], 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.
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 07:15:47] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 07:15:47] [INFO ] Implicit Places using invariants in 14 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 07:15:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 15 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 07:15:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p1))), true, (OR (NOT p1) (NOT p0) p2), (OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : HouseConstruction-PT-00500-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2 (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND p0 (NOT p1)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND p1 p2 p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND p1 p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5 1), p1:(GEQ s21 1), p2:(AND (GEQ s13 1) (GEQ s14 1)), p3:(AND (GEQ s8 1) (GEQ s9 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 7 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00500-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00500-08 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((p0||G(p1)))||X(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 0 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:15:47] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 07:15:47] [INFO ] Implicit Places using invariants in 11 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 07:15:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 16 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 07:15:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00500-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p2:(OR (LT s19 1) (LT s20 1)), p1:(OR (GEQ s1 1) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 54 ms.
Product exploration explored 100000 steps with 33333 reset in 63 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 p2)), (F (G (NOT p1))), (NOT p0), p2, p1]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 54 ms.
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 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 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 23 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 23 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 23 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 20 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 20 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-12 07:15:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-12 07:15:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 07:15:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 114 ms.
[2021-05-12 07:15:48] [INFO ] Flatten gal took : 1 ms
[2021-05-12 07:15:48] [INFO ] Flatten gal took : 1 ms
[2021-05-12 07:15:48] [INFO ] Time to serialize gal into /tmp/LTL1135869411509403787.gal : 0 ms
[2021-05-12 07:15:48] [INFO ] Time to serialize properties into /tmp/LTL17056945420463947129.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/LTL1135869411509403787.gal, -t, CGAL, -LTL, /tmp/LTL17056945420463947129.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/LTL1135869411509403787.gal -t CGAL -LTL /tmp/LTL17056945420463947129.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(("(((p12>=1)&&(p10>=1))&&(p13>=1))")||(G("((p2>=1)||(p1>=1))"))))||(X("((p21<1)||(p23<1))")))))
Formula 0 simplified : !X(F("(((p12>=1)&&(p10>=1))&&(p13>=1))" | G"((p2>=1)||(p1>=1))") | X"((p21<1)||(p23<1))")
Detected timeout of ITS tools.
[2021-05-12 07:16:03] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:16:03] [INFO ] Applying decomposition
[2021-05-12 07:16:03] [INFO ] Flatten gal took : 1 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/graph2284647451053004120.txt, -o, /tmp/graph2284647451053004120.bin, -w, /tmp/graph2284647451053004120.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/graph2284647451053004120.bin, -l, -1, -v, -w, /tmp/graph2284647451053004120.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 07:16:03] [INFO ] Decomposing Gal with order
[2021-05-12 07:16:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 07:16:03] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 07:16:03] [INFO ] Time to serialize gal into /tmp/LTL5691595518850242188.gal : 1 ms
[2021-05-12 07:16:03] [INFO ] Time to serialize properties into /tmp/LTL2185048028511365700.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/LTL5691595518850242188.gal, -t, CGAL, -LTL, /tmp/LTL2185048028511365700.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/LTL5691595518850242188.gal -t CGAL -LTL /tmp/LTL2185048028511365700.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(("(((i0.u3.p12>=1)&&(i2.u4.p10>=1))&&(i2.u1.p13>=1))")||(G("((i0.u0.p2>=1)||(i0.u0.p1>=1))"))))||(X("((i1.u7.p21<1)||(u6.p23<1))")))))
Formula 0 simplified : !X(F("(((i0.u3.p12>=1)&&(i2.u4.p10>=1))&&(i2.u1.p13>=1))" | G"((i0.u0.p2>=1)||(i0.u0.p1>=1))") | X"((i1.u7.p21<1)||(u6.p23<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11544552092784265137
[2021-05-12 07:16:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11544552092784265137
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/ltsmin11544552092784265137]
Compilation finished in 125 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11544552092784265137]
Link finished in 30 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((<>(((LTLAPp0==true)||[]((LTLAPp1==true))))||X((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11544552092784265137]
LTSmin run took 36 ms.
FORMULA HouseConstruction-PT-00500-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00500-11 finished in 31312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G(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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 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 20 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 19 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 19 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 19 place count 13 transition count 8
Applied a total of 19 rules in 4 ms. Remains 13 /25 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-12 07:16:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Implicit Places using invariants in 17 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-12 07:16:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 07:16:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 07:16:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 07:16:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00500-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (LT s1 1) (OR (LT s6 1) (LT s9 1) (LT s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA HouseConstruction-PT-00500-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00500-12 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 18 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 10 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 10 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 34 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 4 with 2 rules applied. Total rules applied 36 place count 2 transition count 2
Applied a total of 36 rules in 5 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 07:16:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 07:16:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Implicit Places using invariants and state equation in 5 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
[2021-05-12 07:16:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 07:16:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 07:16:18] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-00500-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 99 reset in 142 ms.
Product exploration explored 100000 steps with 99 reset in 201 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA HouseConstruction-PT-00500-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00500-14 finished in 438 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0&&X(X(F((!p1||G(p2))))))||G(F((!p1||G(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 07:16:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 07:16:19] [INFO ] Implicit Places using invariants in 11 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 07:16:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:16:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 07:16:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 07:16:19] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00500-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1)), p1:(GEQ s8 1), p2:(GEQ s21 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 33333 reset in 154 ms.
Product exploration explored 100000 steps with 33333 reset in 171 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 p0)), (F (G (NOT p1))), (F (G (NOT p2))), p0, (NOT p1), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
FORMULA HouseConstruction-PT-00500-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00500-15 finished in 554 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15576481122910891101
[2021-05-12 07:16:19] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 07:16:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 07:16:19] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 07:16:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 07:16:19] [INFO ] Applying decomposition
[2021-05-12 07:16:19] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 07:16:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 07:16:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15576481122910891101
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/ltsmin15576481122910891101]
[2021-05-12 07:16:19] [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/graph10342719956452575467.txt, -o, /tmp/graph10342719956452575467.bin, -w, /tmp/graph10342719956452575467.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/graph10342719956452575467.bin, -l, -1, -v, -w, /tmp/graph10342719956452575467.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 07:16:19] [INFO ] Decomposing Gal with order
[2021-05-12 07:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 07:16:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:16:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 07:16:19] [INFO ] Time to serialize gal into /tmp/LTLFireability16762177685574121509.gal : 1 ms
[2021-05-12 07:16:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14054487818397314069.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/LTLFireability16762177685574121509.gal, -t, CGAL, -LTL, /tmp/LTLFireability14054487818397314069.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/LTLFireability16762177685574121509.gal -t CGAL -LTL /tmp/LTLFireability14054487818397314069.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F((X("(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))"))U(((!("(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))"))&&(X("(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))")))||(G(X("(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))")))))))
Formula 0 simplified : !F(X"(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))" U ((!"(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))" & X"(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))") | GX"(((i2.u3.p12>=1)&&(i3.u4.p10>=1))&&(i3.u1.p13>=1))"))
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15576481122910891101]
Link finished in 31 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)&&X((LTLAPp0==true)))||[]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15576481122910891101]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: LTL layer: formula: <>(((!(LTLAPp0==true)&&X((LTLAPp0==true)))||[]((LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.001: "<>(((!(LTLAPp0==true)&&X((LTLAPp0==true)))||[]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.007: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.070: DFS-FIFO for weak LTL, using special progress label 20
pins2lts-mc-linux64( 0/ 8), 0.070: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.070: State length is 26, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.070: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.070: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.070: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.070: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.177: ~104 levels ~960 states ~5128 transitions
pins2lts-mc-linux64( 4/ 8), 0.177: ~202 levels ~1920 states ~10888 transitions
pins2lts-mc-linux64( 4/ 8), 0.179: ~414 levels ~3840 states ~24976 transitions
pins2lts-mc-linux64( 4/ 8), 0.182: ~836 levels ~7680 states ~55568 transitions
pins2lts-mc-linux64( 3/ 8), 0.202: ~1737 levels ~15360 states ~125832 transitions
pins2lts-mc-linux64( 3/ 8), 0.228: ~3470 levels ~30720 states ~255816 transitions
pins2lts-mc-linux64( 3/ 8), 0.251: ~4502 levels ~61440 states ~366752 transitions
pins2lts-mc-linux64( 3/ 8), 0.278: ~4502 levels ~122880 states ~515880 transitions
pins2lts-mc-linux64( 3/ 8), 0.345: ~4502 levels ~245760 states ~834736 transitions
pins2lts-mc-linux64( 3/ 8), 0.465: ~4502 levels ~491520 states ~1483016 transitions
pins2lts-mc-linux64( 6/ 8), 0.788: ~4501 levels ~983040 states ~2654664 transitions
pins2lts-mc-linux64( 3/ 8), 1.464: ~4502 levels ~1966080 states ~5513200 transitions
pins2lts-mc-linux64( 3/ 8), 2.633: ~4502 levels ~3932160 states ~10942504 transitions
pins2lts-mc-linux64( 3/ 8), 5.368: ~4502 levels ~7864320 states ~23115032 transitions
pins2lts-mc-linux64( 2/ 8), 10.864: ~4478 levels ~15728640 states ~44343536 transitions
pins2lts-mc-linux64( 2/ 8), 21.691: ~4478 levels ~31457280 states ~88296608 transitions
pins2lts-mc-linux64( 2/ 8), 44.496: ~4478 levels ~62914560 states ~182801288 transitions
pins2lts-mc-linux64( 6/ 8), 91.851: ~4501 levels ~125829120 states ~401902616 transitions
pins2lts-mc-linux64( 2/ 8), 119.220: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 119.237:
pins2lts-mc-linux64( 0/ 8), 119.237: mean standard work distribution: 5.2% (states) 3.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 119.237:
pins2lts-mc-linux64( 0/ 8), 119.237: Explored 133944895 states 442149370 transitions, fanout: 3.301
pins2lts-mc-linux64( 0/ 8), 119.237: Total exploration time 119.160 sec (119.120 sec minimum, 119.136 sec on average)
pins2lts-mc-linux64( 0/ 8), 119.237: States per second: 1124076, Transitions per second: 3710552
pins2lts-mc-linux64( 0/ 8), 119.237:
pins2lts-mc-linux64( 0/ 8), 119.237: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 119.237: Redundant explorations: -0.2030
pins2lts-mc-linux64( 0/ 8), 119.237:
pins2lts-mc-linux64( 0/ 8), 119.237: Queue width: 8B, total height: 35929, memory: 0.27MB
pins2lts-mc-linux64( 0/ 8), 119.237: Tree memory: 1166.7MB, 9.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 119.237: Tree fill ratio (roots/leafs): 99.0%/55.0%
pins2lts-mc-linux64( 0/ 8), 119.237: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 119.237: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 119.237: Est. total memory use: 1166.9MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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)&&X((LTLAPp0==true)))||[]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15576481122910891101]
255
java.lang.RuntimeException: Unexpected exception when executing 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)&&X((LTLAPp0==true)))||[]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15576481122910891101]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 07:37:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 07:37:13] [INFO ] Time to serialize gal into /tmp/LTLFireability2730568149398602756.gal : 1 ms
[2021-05-12 07:37:13] [INFO ] Time to serialize properties into /tmp/LTLFireability11084080469754320282.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/LTLFireability2730568149398602756.gal, -t, CGAL, -LTL, /tmp/LTLFireability11084080469754320282.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/LTLFireability2730568149398602756.gal -t CGAL -LTL /tmp/LTLFireability11084080469754320282.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F((X("(((p12>=1)&&(p10>=1))&&(p13>=1))"))U(((!("(((p12>=1)&&(p10>=1))&&(p13>=1))"))&&(X("(((p12>=1)&&(p10>=1))&&(p13>=1))")))||(G(X("(((p12>=1)&&(p10>=1))&&(p13>=1))")))))))
Formula 0 simplified : !F(X"(((p12>=1)&&(p10>=1))&&(p13>=1))" U ((!"(((p12>=1)&&(p10>=1))&&(p13>=1))" & X"(((p12>=1)&&(p10>=1))&&(p13>=1))") | GX"(((p12>=1)&&(p10>=1))&&(p13>=1))"))
Detected timeout of ITS tools.
[2021-05-12 07:58:11] [INFO ] Flatten gal took : 82 ms
[2021-05-12 07:58:11] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 07:58:11] [INFO ] Transformed 25 places.
[2021-05-12 07:58:11] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 07:58:11] [INFO ] Time to serialize gal into /tmp/LTLFireability397187401197934081.gal : 3 ms
[2021-05-12 07:58:11] [INFO ] Time to serialize properties into /tmp/LTLFireability5563880912406972320.ltl : 3 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/LTLFireability397187401197934081.gal, -t, CGAL, -LTL, /tmp/LTLFireability5563880912406972320.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability397187401197934081.gal -t CGAL -LTL /tmp/LTLFireability5563880912406972320.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("(((p12>=1)&&(p10>=1))&&(p13>=1))"))U(((!("(((p12>=1)&&(p10>=1))&&(p13>=1))"))&&(X("(((p12>=1)&&(p10>=1))&&(p13>=1))")))||(G(X("(((p12>=1)&&(p10>=1))&&(p13>=1))")))))))
Formula 0 simplified : !F(X"(((p12>=1)&&(p10>=1))&&(p13>=1))" U ((!"(((p12>=1)&&(p10>=1))&&(p13>=1))" & X"(((p12>=1)&&(p10>=1))&&(p13>=1))") | GX"(((p12>=1)&&(p10>=1))&&(p13>=1))"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ 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-00500"
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-00500, 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-162075406600197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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