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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 201K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K 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 25K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620806650177

Running Version 0
[2021-05-12 08:04:11] [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 08:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 08:04:11] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 08:04:11] [INFO ] Transformed 26 places.
[2021-05-12 08:04:11] [INFO ] Transformed 18 transitions.
[2021-05-12 08:04:11] [INFO ] Parsed PT model containing 26 places and 18 transitions in 60 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 08:04:11] [INFO ] Initial state test concluded for 2 properties.
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 8 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:04:11] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-12 08:04:11] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:04:11] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 08:04:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:04:11] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 08:04:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 08:04:12] [INFO ] Flatten gal took : 17 ms
[2021-05-12 08:04:12] [INFO ] Flatten gal took : 5 ms
[2021-05-12 08:04:12] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 17017 steps, including 0 resets, run visited all 22 properties in 10 ms. (steps per millisecond=1701 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
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 3 with 13 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 8 transition count 5
Applied a total of 27 rules in 91 ms. Remains 8 /25 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 08:04:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:04:12] [INFO ] Implicit Places using invariants in 18 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
[2021-05-12 08:04:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 08:04:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:04:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-12 08:04:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 08:04:12] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 08:04:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-01000-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-01000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-00 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F((p1&&(p2 U (p3||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.
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 08:04:12] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 08:04:12] [INFO ] Implicit Places using invariants in 16 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:04:12] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 08:04:12] [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 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 08:04:12] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 08:04:12] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : HouseConstruction-PT-01000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s4 1), p3:(AND (LT s12 1) (LT s4 1)), p2:(LT s12 1), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-01 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&(p1||F(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.
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 08:04:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 08:04:12] [INFO ] Implicit Places using invariants in 19 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:04:12] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 08:04:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:04:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 08:04:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : HouseConstruction-PT-01000-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GEQ s14 1), p1:(GEQ s2 1), p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-02 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 32 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 08:04:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 08:04:12] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 08:04:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 08:04:12] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 08:04:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 08:04:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 08:04:13] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-03 finished in 95 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 11 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 2 transition count 2
Applied a total of 37 rules in 12 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 08:04:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:04:13] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:04:13] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-12 08:04:13] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 08:04:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:04:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:04:13] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 101 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)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
[2021-05-12 08:04:13] [INFO ] Flatten gal took : 0 ms
[2021-05-12 08:04:13] [INFO ] Flatten gal took : 0 ms
[2021-05-12 08:04:13] [INFO ] Time to serialize gal into /tmp/LTL15559070367001953763.gal : 1 ms
[2021-05-12 08:04:13] [INFO ] Time to serialize properties into /tmp/LTL8897943455876543438.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/LTL15559070367001953763.gal, -t, CGAL, -LTL, /tmp/LTL8897943455876543438.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/LTL15559070367001953763.gal -t CGAL -LTL /tmp/LTL8897943455876543438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p3>=1)")))
Formula 0 simplified : !F"(p3>=1)"
Detected timeout of ITS tools.
[2021-05-12 08:04:28] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:04:28] [INFO ] Applying decomposition
[2021-05-12 08:04:28] [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/graph15520721970891181000.txt, -o, /tmp/graph15520721970891181000.bin, -w, /tmp/graph15520721970891181000.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/graph15520721970891181000.bin, -l, -1, -v, -w, /tmp/graph15520721970891181000.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:04:28] [INFO ] Decomposing Gal with order
[2021-05-12 08:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:04:28] [INFO ] Flatten gal took : 0 ms
[2021-05-12 08:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:04:28] [INFO ] Time to serialize gal into /tmp/LTL18346135543958856384.gal : 1 ms
[2021-05-12 08:04:28] [INFO ] Time to serialize properties into /tmp/LTL10568066880747620734.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/LTL18346135543958856384.gal, -t, CGAL, -LTL, /tmp/LTL10568066880747620734.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/LTL18346135543958856384.gal -t CGAL -LTL /tmp/LTL10568066880747620734.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(u0.p3>=1)")))
Formula 0 simplified : !F"(u0.p3>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12989673777699145361
[2021-05-12 08:04:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12989673777699145361
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/ltsmin12989673777699145361]
Compilation finished in 139 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12989673777699145361]
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)), --buchi-type=spotba], workingDir=/tmp/ltsmin12989673777699145361]
LTSmin run took 125 ms.
FORMULA HouseConstruction-PT-01000-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-01000-04 finished in 31042 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 08:04:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 08:04:44] [INFO ] Implicit Places using invariants in 23 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:04:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:04:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 08:04:44] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 08:04:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Running random walk in product with property : HouseConstruction-PT-01000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA HouseConstruction-PT-01000-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-01000-05 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:04:44] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-12 08:04:44] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:04:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:04:44] [INFO ] Dead Transitions using invariants and state equation in 20 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 08:04:44] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 08:04:44] [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 80 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HouseConstruction-PT-01000-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s11 1), p1:(AND (LT s4 1) (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-06 finished in 153 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(G((p1 U p2))&&X(X(X(F(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 08:04:44] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 08:04:44] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:04:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:04:44] [INFO ] Dead Transitions using invariants and state equation in 25 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 08:04:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:04:44] [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 187 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HouseConstruction-PT-01000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s1 1), p2:(OR (LT s8 1) (LT s9 1)), p1:(GEQ s14 1), p3:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 68 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 p2)), (F (G (NOT p1))), (F (G (NOT p3))), (NOT p0), p2, (NOT p1), (NOT p3)]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Applying partial POR strategy [false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
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 21
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 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 19/18 (removed -1) transitions.
[2021-05-12 08:04:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 20 cols
[2021-05-12 08:04:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:04:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 19/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
[2021-05-12 08:04:46] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:04:46] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:04:46] [INFO ] Time to serialize gal into /tmp/LTL3684972296579466933.gal : 0 ms
[2021-05-12 08:04:46] [INFO ] Time to serialize properties into /tmp/LTL9518591688467983381.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/LTL3684972296579466933.gal, -t, CGAL, -LTL, /tmp/LTL9518591688467983381.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/LTL3684972296579466933.gal -t CGAL -LTL /tmp/LTL9518591688467983381.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p2>=1)")||((G(("(p18>=1)")U("((p8<1)||(p9<1))")))&&(X(X(X(F("(p11>=1)"))))))))))
Formula 0 simplified : !XF("(p2>=1)" | (G("(p18>=1)" U "((p8<1)||(p9<1))") & XXXF"(p11>=1)"))
Detected timeout of ITS tools.
[2021-05-12 08:05:01] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:05:01] [INFO ] Applying decomposition
[2021-05-12 08:05:01] [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/graph7811621247680972610.txt, -o, /tmp/graph7811621247680972610.bin, -w, /tmp/graph7811621247680972610.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/graph7811621247680972610.bin, -l, -1, -v, -w, /tmp/graph7811621247680972610.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:05:01] [INFO ] Decomposing Gal with order
[2021-05-12 08:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:05:01] [INFO ] Flatten gal took : 19 ms
[2021-05-12 08:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 08:05:01] [INFO ] Time to serialize gal into /tmp/LTL14209786867774608011.gal : 1 ms
[2021-05-12 08:05:01] [INFO ] Time to serialize properties into /tmp/LTL12408890739682934090.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/LTL14209786867774608011.gal, -t, CGAL, -LTL, /tmp/LTL12408890739682934090.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/LTL14209786867774608011.gal -t CGAL -LTL /tmp/LTL12408890739682934090.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i1.u0.p2>=1)")||((G(("(u5.p18>=1)")U("((i2.u1.p8<1)||(i1.u3.p9<1))")))&&(X(X(X(F("(i0.u2.p11>=1)"))))))))))
Formula 0 simplified : !XF("(i1.u0.p2>=1)" | (G("(u5.p18>=1)" U "((i2.u1.p8<1)||(i1.u3.p9<1))") & XXXF"(i0.u2.p11>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6637035357504886933
[2021-05-12 08:05:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6637035357504886933
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/ltsmin6637035357504886933]
Compilation finished in 122 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6637035357504886933]
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, X(<>(((LTLAPp0==true)||([](((LTLAPp1==true) U (LTLAPp2==true)))&&X(X(X(<>((LTLAPp3==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6637035357504886933]
LTSmin run took 37 ms.
FORMULA HouseConstruction-PT-01000-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-01000-07 finished in 31856 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:05:16] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 08:05:16] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 17 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:05:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:05:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:05:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:05:16] [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 69 ms :[true, p0, p0, p0]
Running random walk in product with property : HouseConstruction-PT-01000-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s5 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-01000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-08 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X((!p1 U p2))) U X(X(((p4 U !p1)||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 08:05:16] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 08:05:16] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:05:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:05:16] [INFO ] Dead Transitions using invariants and state equation in 13 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 08:05:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 08:05:16] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1]
Running random walk in product with property : HouseConstruction-PT-01000-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2 p1 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p4)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p3) p4), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p4)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3) p4), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p4)), acceptance={0} source=8 dest: 5}, { cond=(AND p1 p4), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s4 1), p2:(AND (GEQ s3 1) (GEQ s4 1)), p1:(LT s3 1), p3:(OR (LT s16 1) (LT s17 1) (LT s20 1)), p4:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G p3)), (F (G (NOT p4))), (NOT p0), (NOT p2), p1, p3, (NOT p4)]
Stuttering acceptance computed with spot in 238 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1]
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 985 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1]
Support contains 6 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 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 22 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 19 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 19 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 2 ms. Remains 19 /22 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-12 08:05:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-12 08:05:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:05:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/22 places, 15/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
[2021-05-12 08:05:19] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:05:19] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:05:19] [INFO ] Time to serialize gal into /tmp/LTL13094400193732481813.gal : 0 ms
[2021-05-12 08:05:19] [INFO ] Time to serialize properties into /tmp/LTL678148073581693381.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/LTL13094400193732481813.gal, -t, CGAL, -LTL, /tmp/LTL678148073581693381.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/LTL13094400193732481813.gal -t CGAL -LTL /tmp/LTL678148073581693381.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(p5>=1)")||(X(("(p6>=1)")U("((p6>=1)&&(p5>=1))"))))U(X(X(("(((p27<1)||(p26<1))||(p25<1))")||(("(p14>=1)")U("(p6>=1)")))))))
Formula 0 simplified : !(("(p5>=1)" | X("(p6>=1)" U "((p6>=1)&&(p5>=1))")) U XX("(((p27<1)||(p26<1))||(p25<1))" | ("(p14>=1)" U "(p6>=1)")))
Detected timeout of ITS tools.
[2021-05-12 08:05:34] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:05:34] [INFO ] Applying decomposition
[2021-05-12 08:05:34] [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/graph7233521282723582224.txt, -o, /tmp/graph7233521282723582224.bin, -w, /tmp/graph7233521282723582224.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/graph7233521282723582224.bin, -l, -1, -v, -w, /tmp/graph7233521282723582224.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:05:34] [INFO ] Decomposing Gal with order
[2021-05-12 08:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:05:34] [INFO ] Flatten gal took : 3 ms
[2021-05-12 08:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:05:34] [INFO ] Time to serialize gal into /tmp/LTL3643720269082086127.gal : 1 ms
[2021-05-12 08:05:34] [INFO ] Time to serialize properties into /tmp/LTL17759130481872364351.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/LTL3643720269082086127.gal, -t, CGAL, -LTL, /tmp/LTL17759130481872364351.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/LTL3643720269082086127.gal -t CGAL -LTL /tmp/LTL17759130481872364351.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("(i0.u3.p5>=1)")||(X(("(i1.u2.p6>=1)")U("((i1.u2.p6>=1)&&(i0.u3.p5>=1))"))))U(X(X(("(((u5.p27<1)||(i3.u7.p26<1))||(i4.u8.p25<1))")||(("(i1.u4.p14>=1)")U("(i1.u2.p6>=1)")))))))
Formula 0 simplified : !(("(i0.u3.p5>=1)" | X("(i1.u2.p6>=1)" U "((i1.u2.p6>=1)&&(i0.u3.p5>=1))")) U XX("(((u5.p27<1)||(i3.u7.p26<1))||(i4.u8.p25<1))" | ("(i1.u4.p14>=1)" U "(i1.u2.p6>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11441626561037240547
[2021-05-12 08:05:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11441626561037240547
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/ltsmin11441626561037240547]
Compilation finished in 128 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11441626561037240547]
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(((LTLAPp1==true) U (LTLAPp2==true)))) U X(X((((LTLAPp4==true) U (LTLAPp1==true))||(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11441626561037240547]
LTSmin run took 112 ms.
FORMULA HouseConstruction-PT-01000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-01000-09 finished in 32918 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 08:05:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Implicit Places using invariants in 31 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:05:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 13 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 08:05:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:05:49] [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 49 ms :[true, p0, p0]
Running random walk in product with property : HouseConstruction-PT-01000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-01000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-10 finished in 119 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.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 18 transition count 11
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 18 transition count 6
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 3 with 13 rules applied. Total rules applied 27 place count 10 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 10 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 7 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 7 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 40 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 41 place count 1 transition count 1
Applied a total of 41 rules in 3 ms. Remains 1 /25 variables (removed 24) and now considering 1/18 (removed 17) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-12 08:05:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-12 08:05:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 08:05:49] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 08:05:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-12 08:05:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/25 places, 1/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1000 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-01000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-11 finished in 73 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 20 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 19 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 17 place count 15 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 15 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 13 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 12 transition count 7
Applied a total of 21 rules in 53 ms. Remains 12 /25 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 12 cols
[2021-05-12 08:05:49] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Implicit Places using invariants in 10 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 10 ms to find 1 implicit places.
[2021-05-12 08:05:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 08:05:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 11/25 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-12 08:05:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 08:05:49] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s4 1) (GEQ s5 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7000 steps with 0 reset in 7 ms.
FORMULA HouseConstruction-PT-01000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-12 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p1||X(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:05:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Implicit Places using invariants in 14 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 14 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:05:49] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:05:49] [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 08:05:49] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-01000-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s14 1), p2:(GEQ s15 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4251 reset in 134 ms.
Stuttering criterion allowed to conclude after 62701 steps with 2325 reset in 115 ms.
FORMULA HouseConstruction-PT-01000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-13 finished in 402 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 18 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 18 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 23 place count 11 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 5 transition count 3
Applied a total of 32 rules in 28 ms. Remains 5 /25 variables (removed 20) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 08:05:50] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 08:05:50] [INFO ] Implicit Places using invariants in 8 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9 ms to find 2 implicit places.
[2021-05-12 08:05:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 08:05:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:05:50] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Starting structural reductions, iteration 1 : 3/25 places, 3/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:05:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:05:50] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:05:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:05:50] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 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-01000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2000 steps with 0 reset in 4 ms.
FORMULA HouseConstruction-PT-01000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-01000-14 finished in 96 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((!p0 U (p1||G(!p0)))))||(p2&&X(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 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:05:50] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 08:05:50] [INFO ] Implicit Places using invariants in 11 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:05:50] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-12 08:05:50] [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 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:05:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 08:05:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p3))]
Running random walk in product with property : HouseConstruction-PT-01000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(GEQ s8 1), p1:(AND (OR (LT s3 1) (LT s7 1)) (GEQ s17 1) (GEQ s18 1) (GEQ s21 1)), p0:(OR (LT s17 1) (LT s18 1) (LT s21 1)), p3:(OR (GEQ s8 1) (AND (GEQ s17 1) (GEQ s18 1) (GEQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1045 reset in 242 ms.
Product exploration explored 100000 steps with 1042 reset in 177 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 p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p3))), (NOT p2), (NOT p1), p0, (NOT p3)]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p3))]
Product exploration explored 100000 steps with 1053 reset in 162 ms.
Product exploration explored 100000 steps with 1074 reset in 182 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p3))]
Support contains 6 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 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 3 place count 23 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 23 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 22 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 22 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 22 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 20 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 20 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-12 08:05:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-12 08:05:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:05:51] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 15/18 transitions.
Product exploration explored 100000 steps with 1624 reset in 181 ms.
Product exploration explored 100000 steps with 1881 reset in 170 ms.
[2021-05-12 08:05:52] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:05:52] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:05:52] [INFO ] Time to serialize gal into /tmp/LTL16381972457484230937.gal : 0 ms
[2021-05-12 08:05:52] [INFO ] Time to serialize properties into /tmp/LTL6349437285143794027.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/LTL16381972457484230937.gal, -t, CGAL, -LTL, /tmp/LTL6349437285143794027.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/LTL16381972457484230937.gal -t CGAL -LTL /tmp/LTL6349437285143794027.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F(("(((p27>=1)&&(p26>=1))&&(p25>=1))")U(("(((((p4<1)||(p15<1))&&(p27>=1))&&(p26>=1))&&(p25>=1))")||(G("(((p27>=1)&&(p26>=1))&&(p25>=1))"))))))||(("(p11>=1)")&&(X("((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))"))))))
Formula 0 simplified : !X(GF("(((p27>=1)&&(p26>=1))&&(p25>=1))" U ("(((((p4<1)||(p15<1))&&(p27>=1))&&(p26>=1))&&(p25>=1))" | G"(((p27>=1)&&(p26>=1))&&(p25>=1))")) | ("(p11>=1)" & X"((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))"))
Detected timeout of ITS tools.
[2021-05-12 08:06:07] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:06:07] [INFO ] Applying decomposition
[2021-05-12 08:06:07] [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/graph5785986861847098800.txt, -o, /tmp/graph5785986861847098800.bin, -w, /tmp/graph5785986861847098800.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/graph5785986861847098800.bin, -l, -1, -v, -w, /tmp/graph5785986861847098800.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:06:07] [INFO ] Decomposing Gal with order
[2021-05-12 08:06:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:06:07] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:06:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:06:07] [INFO ] Time to serialize gal into /tmp/LTL8646679211363071167.gal : 0 ms
[2021-05-12 08:06:07] [INFO ] Time to serialize properties into /tmp/LTL4176849775488712974.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/LTL8646679211363071167.gal, -t, CGAL, -LTL, /tmp/LTL4176849775488712974.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/LTL8646679211363071167.gal -t CGAL -LTL /tmp/LTL4176849775488712974.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F(("(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1))")U(("(((((u8.p4<1)||(i2.u2.p15<1))&&(u5.p27>=1))&&(i5.u7.p26>=1))&&(u8.p25>=1))")||(G("(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1))"))))))||(("(i2.u2.p11>=1)")&&(X("((i2.u2.p11>=1)||(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1)))"))))))
Formula 0 simplified : !X(GF("(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1))" U ("(((((u8.p4<1)||(i2.u2.p15<1))&&(u5.p27>=1))&&(i5.u7.p26>=1))&&(u8.p25>=1))" | G"(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1))")) | ("(i2.u2.p11>=1)" & X"((i2.u2.p11>=1)||(((u5.p27>=1)&&(i5.u7.p26>=1))&&(u8.p25>=1)))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12623243151822444687
[2021-05-12 08:06:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12623243151822444687
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/ltsmin12623243151822444687]
Compilation finished in 131 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12623243151822444687]
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) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12623243151822444687]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-01000-15 finished in 46994 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16976942487523443718
[2021-05-12 08:06:37] [INFO ] Applying decomposition
[2021-05-12 08:06:37] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:06:37] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 08:06:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 08:06:37] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 08:06:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 08:06:37] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 08:06:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 08:06:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16976942487523443718
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/graph6315159133124585111.txt, -o, /tmp/graph6315159133124585111.bin, -w, /tmp/graph6315159133124585111.weights], workingDir=null]
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/ltsmin16976942487523443718]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6315159133124585111.bin, -l, -1, -v, -w, /tmp/graph6315159133124585111.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:06:37] [INFO ] Decomposing Gal with order
[2021-05-12 08:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:06:37] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:06:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 08:06:37] [INFO ] Time to serialize gal into /tmp/LTLFireability13071129584121737584.gal : 1 ms
[2021-05-12 08:06:37] [INFO ] Time to serialize properties into /tmp/LTLFireability7772044052265909644.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/LTLFireability13071129584121737584.gal, -t, CGAL, -LTL, /tmp/LTLFireability7772044052265909644.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/LTLFireability13071129584121737584.gal -t CGAL -LTL /tmp/LTLFireability7772044052265909644.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(u1.p11>=1)")&&(X("((u1.p11>=1)||(((u7.p27>=1)&&(i3.u8.p26>=1))&&(u9.p25>=1)))")))||(G(F((!("(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))"))U(("(((u9.p4<1)||(u1.p15<1))&&(!(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))))")||(G(!("(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))"))))))))))
Formula 0 simplified : !X(("(u1.p11>=1)" & X"((u1.p11>=1)||(((u7.p27>=1)&&(i3.u8.p26>=1))&&(u9.p25>=1)))") | GF(!"(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))" U ("(((u9.p4<1)||(u1.p15<1))&&(!(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))))" | G!"(((u7.p27<1)||(i3.u8.p26<1))||(u9.p25<1))")))
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16976942487523443718]
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) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16976942487523443718]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: X(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true)))))
pins2lts-mc-linux64( 1/ 8), 0.002: "X(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.083: State length is 26, there are 30 groups
pins2lts-mc-linux64( 0/ 8), 0.083: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.083: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.083: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.083: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.174: [Blue] ~87 levels ~960 states ~2736 transitions
pins2lts-mc-linux64( 0/ 8), 0.181: [Blue] ~239 levels ~1920 states ~9032 transitions
pins2lts-mc-linux64( 0/ 8), 0.183: [Blue] ~479 levels ~3840 states ~18632 transitions
pins2lts-mc-linux64( 0/ 8), 0.185: [Blue] ~959 levels ~7680 states ~37832 transitions
pins2lts-mc-linux64( 1/ 8), 0.190: [Blue] ~1920 levels ~15360 states ~69152 transitions
pins2lts-mc-linux64( 6/ 8), 0.197: [Blue] ~2693 levels ~30720 states ~112504 transitions
pins2lts-mc-linux64( 6/ 8), 0.228: [Blue] ~5457 levels ~61440 states ~257608 transitions
pins2lts-mc-linux64( 6/ 8), 0.261: [Blue] ~9456 levels ~122880 states ~425432 transitions
pins2lts-mc-linux64( 6/ 8), 0.357: [Blue] ~15968 levels ~245760 states ~809936 transitions
pins2lts-mc-linux64( 6/ 8), 0.519: [Blue] ~15968 levels ~491520 states ~1186040 transitions
pins2lts-mc-linux64( 2/ 8), 0.790: [Blue] ~17999 levels ~983040 states ~1838488 transitions
pins2lts-mc-linux64( 2/ 8), 1.313: [Blue] ~17999 levels ~1966080 states ~3314184 transitions
pins2lts-mc-linux64( 2/ 8), 2.422: [Blue] ~17999 levels ~3932160 states ~6265296 transitions
pins2lts-mc-linux64( 2/ 8), 4.955: [Blue] ~17999 levels ~7864320 states ~13305696 transitions
pins2lts-mc-linux64( 7/ 8), 11.641: [Blue] ~16002 levels ~15728640 states ~39520792 transitions
pins2lts-mc-linux64( 7/ 8), 17.804: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 23.732:
pins2lts-mc-linux64( 0/ 8), 23.732: Explored 17832222 states 46005122 transitions, fanout: 2.580
pins2lts-mc-linux64( 0/ 8), 23.732: Total exploration time 23.610 sec (17.700 sec minimum, 18.455 sec on average)
pins2lts-mc-linux64( 0/ 8), 23.732: States per second: 755283, Transitions per second: 1948544
pins2lts-mc-linux64( 0/ 8), 23.732:
pins2lts-mc-linux64( 0/ 8), 23.732: State space has 15852833 states, 7727520 are accepting
pins2lts-mc-linux64( 0/ 8), 23.732: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 23.732: blue states: 17832222 (112.49%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 23.732: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 23.732: all-red states: 10231288 (64.54%), bogus 708112 (4.47%)
pins2lts-mc-linux64( 0/ 8), 23.732:
pins2lts-mc-linux64( 0/ 8), 23.732: Total memory used for local state coloring: 2.1MB
pins2lts-mc-linux64( 0/ 8), 23.732:
pins2lts-mc-linux64( 0/ 8), 23.732: Queue width: 8B, total height: 135954, memory: 1.04MB
pins2lts-mc-linux64( 0/ 8), 23.732: Tree memory: 376.9MB, 24.9 B/state, compr.: 23.5%
pins2lts-mc-linux64( 0/ 8), 23.732: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 23.732: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 23.732: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 23.732: Est. total memory use: 378.0MB (~1025.0MB 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, X(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16976942487523443718]
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, X(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||((LTLAPp2==true)&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16976942487523443718]
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 08:27:26] [INFO ] Flatten gal took : 83 ms
[2021-05-12 08:27:26] [INFO ] Time to serialize gal into /tmp/LTLFireability4965312906937519573.gal : 30 ms
[2021-05-12 08:27:26] [INFO ] Time to serialize properties into /tmp/LTLFireability5379466176075345614.ltl : 19 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/LTLFireability4965312906937519573.gal, -t, CGAL, -LTL, /tmp/LTLFireability5379466176075345614.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/LTLFireability4965312906937519573.gal -t CGAL -LTL /tmp/LTLFireability5379466176075345614.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(p11>=1)")&&(X("((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))")))||(G(F((!("(((p27<1)||(p26<1))||(p25<1))"))U(("(((p4<1)||(p15<1))&&(!(((p27<1)||(p26<1))||(p25<1))))")||(G(!("(((p27<1)||(p26<1))||(p25<1))"))))))))))
Formula 0 simplified : !X(("(p11>=1)" & X"((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))") | GF(!"(((p27<1)||(p26<1))||(p25<1))" U ("(((p4<1)||(p15<1))&&(!(((p27<1)||(p26<1))||(p25<1))))" | G!"(((p27<1)||(p26<1))||(p25<1))")))
Detected timeout of ITS tools.
[2021-05-12 08:48:15] [INFO ] Flatten gal took : 59 ms
[2021-05-12 08:48:15] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 08:48:15] [INFO ] Transformed 25 places.
[2021-05-12 08:48:15] [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 08:48:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16010067314709144640.gal : 1 ms
[2021-05-12 08:48:15] [INFO ] Time to serialize properties into /tmp/LTLFireability18352423281071316261.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/LTLFireability16010067314709144640.gal, -t, CGAL, -LTL, /tmp/LTLFireability18352423281071316261.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/LTLFireability16010067314709144640.gal -t CGAL -LTL /tmp/LTLFireability18352423281071316261.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("(p11>=1)")&&(X("((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))")))||(G(F((!("(((p27<1)||(p26<1))||(p25<1))"))U(("(((p4<1)||(p15<1))&&(!(((p27<1)||(p26<1))||(p25<1))))")||(G(!("(((p27<1)||(p26<1))||(p25<1))"))))))))))
Formula 0 simplified : !X(("(p11>=1)" & X"((p11>=1)||(((p27>=1)&&(p26>=1))&&(p25>=1)))") | GF(!"(((p27<1)||(p26<1))||(p25<1))" U ("(((p4<1)||(p15<1))&&(!(((p27<1)||(p26<1))||(p25<1))))" | G!"(((p27<1)||(p26<1))||(p25<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-01000"
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-01000, 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-162075406600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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