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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.2K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 11:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 21:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 21:04 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-32000-00
FORMULA_NAME HouseConstruction-PT-32000-01
FORMULA_NAME HouseConstruction-PT-32000-02
FORMULA_NAME HouseConstruction-PT-32000-03
FORMULA_NAME HouseConstruction-PT-32000-04
FORMULA_NAME HouseConstruction-PT-32000-05
FORMULA_NAME HouseConstruction-PT-32000-06
FORMULA_NAME HouseConstruction-PT-32000-07
FORMULA_NAME HouseConstruction-PT-32000-08
FORMULA_NAME HouseConstruction-PT-32000-09
FORMULA_NAME HouseConstruction-PT-32000-10
FORMULA_NAME HouseConstruction-PT-32000-11
FORMULA_NAME HouseConstruction-PT-32000-12
FORMULA_NAME HouseConstruction-PT-32000-13
FORMULA_NAME HouseConstruction-PT-32000-14
FORMULA_NAME HouseConstruction-PT-32000-15

=== Now, execution of the tool begins

BK_START 1620818093129

Running Version 0
[2021-05-12 11:14:55] [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 11:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 11:14:55] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-12 11:14:55] [INFO ] Transformed 26 places.
[2021-05-12 11:14:55] [INFO ] Transformed 18 transitions.
[2021-05-12 11:14:55] [INFO ] Parsed PT model containing 26 places and 18 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 12 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:14:55] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-12 11:14:55] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:14:55] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-12 11:14:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:14:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 11:14:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
[2021-05-12 11:14:55] [INFO ] Flatten gal took : 18 ms
[2021-05-12 11:14:55] [INFO ] Flatten gal took : 6 ms
[2021-05-12 11:14:55] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 128006 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=1910 ) properties (out of 21) seen :4
Running SMT prover for 17 properties.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:14:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 11:14:55] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 11:14:55] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-12 11:14:55] [INFO ] Added : 7 causal constraints over 2 iterations in 32 ms. Result :sat
[2021-05-12 11:14:55] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 11:14:55] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:55] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 10 causal constraints over 2 iterations in 36 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 11:14:56] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 11:14:56] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-12 11:14:56] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 4 causal constraints over 1 iterations in 26 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 11:14:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 11:14:56] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 11:14:56] [INFO ] Added : 16 causal constraints over 4 iterations in 17 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
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 20511 ms. Remains 5 /26 variables (removed 21) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 11:15:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Implicit Places using invariants in 13 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-12 11:15:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 11:15:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 3/26 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 1 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 11:15:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:15:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 403 reset in 152 ms.
Product exploration explored 100000 steps with 269 reset in 144 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 p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-32000-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-32000-00 finished in 21099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||(p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:15:17] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Implicit Places using invariants in 24 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:15:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:15:17] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:15:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 11:15:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (GEQ s11 1) (GEQ s13 1) (GEQ s14 1)), p0:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1282 reset in 275 ms.
Product exploration explored 100000 steps with 1238 reset in 183 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 p1))), (F (G p0)), (NOT p1), p0]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1267 reset in 125 ms.
Product exploration explored 100000 steps with 1246 reset in 139 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 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 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 20 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 20 transition count 16
Performed 1 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 1 rules applied. Total rules applied 14 place count 20 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 4 ms. Remains 20 /22 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-12 11:15:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2021-05-12 11:15:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:15:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/22 places, 16/18 transitions.
Product exploration explored 100000 steps with 3487 reset in 230 ms.
Product exploration explored 100000 steps with 3505 reset in 155 ms.
[2021-05-12 11:15:19] [INFO ] Flatten gal took : 3 ms
[2021-05-12 11:15:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 11:15:19] [INFO ] Time to serialize gal into /tmp/LTL5930642647089657558.gal : 1 ms
[2021-05-12 11:15:19] [INFO ] Time to serialize properties into /tmp/LTL7390982837019373605.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/LTL5930642647089657558.gal, -t, CGAL, -LTL, /tmp/LTL7390982837019373605.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/LTL5930642647089657558.gal -t CGAL -LTL /tmp/LTL7390982837019373605.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(p16<1)"))||(("(p16<1)")&&(F("(((p17>=1)&&(p19>=1))&&(p20>=1))"))))))))
Formula 0 simplified : !XXX(G"(p16<1)" | ("(p16<1)" & F"(((p17>=1)&&(p19>=1))&&(p20>=1))"))
Detected timeout of ITS tools.
[2021-05-12 11:15:34] [INFO ] Flatten gal took : 16 ms
[2021-05-12 11:15:34] [INFO ] Applying decomposition
[2021-05-12 11:15:34] [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/graph3400154296908078861.txt, -o, /tmp/graph3400154296908078861.bin, -w, /tmp/graph3400154296908078861.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/graph3400154296908078861.bin, -l, -1, -v, -w, /tmp/graph3400154296908078861.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 11:15:35] [INFO ] Decomposing Gal with order
[2021-05-12 11:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 11:15:35] [INFO ] Flatten gal took : 48 ms
[2021-05-12 11:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 11:15:35] [INFO ] Time to serialize gal into /tmp/LTL5086212041529721300.gal : 1 ms
[2021-05-12 11:15:35] [INFO ] Time to serialize properties into /tmp/LTL10431363331872244654.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/LTL5086212041529721300.gal, -t, CGAL, -LTL, /tmp/LTL10431363331872244654.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/LTL5086212041529721300.gal -t CGAL -LTL /tmp/LTL10431363331872244654.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i4.u7.p16<1)"))||(("(i4.u7.p16<1)")&&(F("(((i1.u4.p17>=1)&&(u5.p19>=1))&&(u5.p20>=1))"))))))))
Formula 0 simplified : !XXX(G"(i4.u7.p16<1)" | ("(i4.u7.p16<1)" & F"(((i1.u4.p17>=1)&&(u5.p19>=1))&&(u5.p20>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12953462329727393853
[2021-05-12 11:15:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12953462329727393853
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/ltsmin12953462329727393853]
Compilation finished in 193 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12953462329727393853]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12953462329727393853]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.428: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.428: LTL layer: formula: X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 5/ 8), 0.429: "X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.429: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.446: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.436: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.449: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.437: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.436: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.450: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.436: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.453: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.532: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.532: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.532: State length is 23, there are 27 groups
pins2lts-mc-linux64( 0/ 8), 0.532: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.532: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.532: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.532: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.711: ~101 levels ~960 states ~6984 transitions
pins2lts-mc-linux64( 4/ 8), 0.714: ~211 levels ~1920 states ~15120 transitions
pins2lts-mc-linux64( 4/ 8), 0.715: ~428 levels ~3840 states ~32608 transitions
pins2lts-mc-linux64( 6/ 8), 0.719: ~897 levels ~7680 states ~74560 transitions
pins2lts-mc-linux64( 4/ 8), 0.740: ~1750 levels ~15360 states ~154184 transitions
pins2lts-mc-linux64( 2/ 8), 0.783: ~3521 levels ~30720 states ~326512 transitions
pins2lts-mc-linux64( 2/ 8), 0.852: ~7049 levels ~61440 states ~672608 transitions
pins2lts-mc-linux64( 5/ 8), 0.979: ~14176 levels ~122880 states ~1381816 transitions
pins2lts-mc-linux64( 3/ 8), 1.269: ~28453 levels ~245760 states ~2826592 transitions
pins2lts-mc-linux64( 5/ 8), 1.851: ~56800 levels ~491520 states ~5713632 transitions
pins2lts-mc-linux64( 0/ 8), 3.099: ~113862 levels ~983040 states ~11597024 transitions
pins2lts-mc-linux64( 0/ 8), 6.673: ~227933 levels ~1966080 states ~23349504 transitions
pins2lts-mc-linux64( 2/ 8), 8.068: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 8.330:
pins2lts-mc-linux64( 0/ 8), 8.330: mean standard work distribution: 4.6% (states) 4.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 8.330:
pins2lts-mc-linux64( 0/ 8), 8.330: Explored 1910720 states 22663178 transitions, fanout: 11.861
pins2lts-mc-linux64( 0/ 8), 8.330: Total exploration time 7.780 sec (7.510 sec minimum, 7.689 sec on average)
pins2lts-mc-linux64( 0/ 8), 8.330: States per second: 245594, Transitions per second: 2913005
pins2lts-mc-linux64( 0/ 8), 8.330:
pins2lts-mc-linux64( 0/ 8), 8.330: Progress states detected: 489
pins2lts-mc-linux64( 0/ 8), 8.330: Redundant explorations: -91.5688
pins2lts-mc-linux64( 0/ 8), 8.330:
pins2lts-mc-linux64( 0/ 8), 8.330: Queue width: 8B, total height: 1772159, memory: 13.52MB
pins2lts-mc-linux64( 0/ 8), 8.330: Tree memory: 428.9MB, 19.8 B/state, compr.: 21.1%
pins2lts-mc-linux64( 0/ 8), 8.330: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 8.330: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 8.330: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 8.330: Est. total memory use: 442.4MB (~1037.5MB 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(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12953462329727393853]
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(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12953462329727393853]
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)
Treatment of property HouseConstruction-PT-32000-01 finished in 40833 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(((p0 U p1) U p2))&&(!p2 U ((!p2&&G(p3))||G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 6 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 0 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 11:15:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 11:15:58] [INFO ] Implicit Places using invariants in 14 ms returned [3, 19]
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 11:15:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 11:15:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), true, true, true]
Running random walk in product with property : HouseConstruction-PT-32000-02 automaton TGBA [mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 5}], [{ cond=(AND p3 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 6}], [{ cond=(AND p3 p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=2 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=2 dest: 6}], [{ cond=(AND p3 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(OR (NOT p3) (AND (NOT p1) (NOT p0))), acceptance={0} source=3 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p3 (NOT p2) p1), acceptance={0} source=6 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(OR p2 (AND (NOT p1) (NOT p0))), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p3:(GEQ s14 1), p2:(GEQ s7 1), p1:(OR (LT s8 1) (LT s11 1) (LT s12 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-32000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-02 finished in 283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:15:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 11:15:59] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:15:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:15:59] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 11:15:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s13 1) (GEQ s14 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-32000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-03 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 11 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
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 7337 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:16:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:16:06] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:16:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:16:06] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-12 11:16:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:16:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:16:06] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-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 45 ms.
Product exploration explored 100000 steps with 50000 reset in 57 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 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
[2021-05-12 11:16:06] [INFO ] Flatten gal took : 0 ms
[2021-05-12 11:16:06] [INFO ] Flatten gal took : 0 ms
[2021-05-12 11:16:06] [INFO ] Time to serialize gal into /tmp/LTL2135391616573188366.gal : 1 ms
[2021-05-12 11:16:06] [INFO ] Time to serialize properties into /tmp/LTL13586861373566057886.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/LTL2135391616573188366.gal, -t, CGAL, -LTL, /tmp/LTL13586861373566057886.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/LTL2135391616573188366.gal -t CGAL -LTL /tmp/LTL13586861373566057886.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 11:16:21] [INFO ] Flatten gal took : 0 ms
[2021-05-12 11:16:21] [INFO ] Applying decomposition
[2021-05-12 11:16:21] [INFO ] Flatten gal took : 0 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/graph1700771031983989392.txt, -o, /tmp/graph1700771031983989392.bin, -w, /tmp/graph1700771031983989392.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/graph1700771031983989392.bin, -l, -1, -v, -w, /tmp/graph1700771031983989392.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 11:16:21] [INFO ] Decomposing Gal with order
[2021-05-12 11:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 11:16:21] [INFO ] Flatten gal took : 0 ms
[2021-05-12 11:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 11:16:21] [INFO ] Time to serialize gal into /tmp/LTL8573530244235421042.gal : 0 ms
[2021-05-12 11:16:21] [INFO ] Time to serialize properties into /tmp/LTL315520326454230616.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/LTL8573530244235421042.gal, -t, CGAL, -LTL, /tmp/LTL315520326454230616.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/LTL8573530244235421042.gal -t CGAL -LTL /tmp/LTL315520326454230616.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/ltsmin10469088659075385997
[2021-05-12 11:16:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10469088659075385997
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/ltsmin10469088659075385997]
Compilation finished in 76 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10469088659075385997]
Link finished in 32 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/ltsmin10469088659075385997]
LTSmin run took 228 ms.
FORMULA HouseConstruction-PT-32000-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-32000-04 finished in 38117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 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 1 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 11:16:37] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 11:16:37] [INFO ] Implicit Places using invariants in 18 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 11:16:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 11:16:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 54 ms.
Product exploration explored 100000 steps with 25000 reset in 57 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-32000-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-32000-05 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G((!p1||(p0 U p2)))))], workingDir=/home/mcc/execution]
Support contains 5 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 1 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 11:16:37] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 11:16:37] [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 11:16:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 11:16:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-06 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s5 1), p2:(AND (GEQ s4 1) (GEQ s11 1)), p0:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1732 reset in 106 ms.
Product exploration explored 100000 steps with 1755 reset in 118 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 p1)), (F (G (NOT p2))), (F (G (NOT p0))), p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 1753 reset in 105 ms.
Product exploration explored 100000 steps with 1761 reset in 115 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0)]
Support contains 5 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-12 11:16:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-12 11:16:38] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 11:16:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/21 places, 15/18 transitions.
Product exploration explored 100000 steps with 3993 reset in 115 ms.
Product exploration explored 100000 steps with 3971 reset in 106 ms.
[2021-05-12 11:16:38] [INFO ] Flatten gal took : 2 ms
[2021-05-12 11:16:38] [INFO ] Flatten gal took : 2 ms
[2021-05-12 11:16:38] [INFO ] Time to serialize gal into /tmp/LTL9366593004186373365.gal : 1 ms
[2021-05-12 11:16:38] [INFO ] Time to serialize properties into /tmp/LTL8677776687669162417.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/LTL9366593004186373365.gal, -t, CGAL, -LTL, /tmp/LTL8677776687669162417.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/LTL9366593004186373365.gal -t CGAL -LTL /tmp/LTL8677776687669162417.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("((p21>=1)&&(p23>=1))")))||(G(("(p7>=1)")||(("((p21>=1)&&(p23>=1))")U("((p5>=1)&&(p17>=1))"))))))
Formula 0 simplified : !(XF"((p21>=1)&&(p23>=1))" | G("(p7>=1)" | ("((p21>=1)&&(p23>=1))" U "((p5>=1)&&(p17>=1))")))
Detected timeout of ITS tools.
[2021-05-12 11:16:54] [INFO ] Flatten gal took : 1 ms
[2021-05-12 11:16:54] [INFO ] Applying decomposition
[2021-05-12 11:16:54] [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/graph300426976229285638.txt, -o, /tmp/graph300426976229285638.bin, -w, /tmp/graph300426976229285638.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/graph300426976229285638.bin, -l, -1, -v, -w, /tmp/graph300426976229285638.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 11:16:54] [INFO ] Decomposing Gal with order
[2021-05-12 11:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 11:16:54] [INFO ] Flatten gal took : 2 ms
[2021-05-12 11:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 11:16:54] [INFO ] Time to serialize gal into /tmp/LTL9613743381789218617.gal : 0 ms
[2021-05-12 11:16:54] [INFO ] Time to serialize properties into /tmp/LTL18005122597932041286.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/LTL9613743381789218617.gal, -t, CGAL, -LTL, /tmp/LTL18005122597932041286.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/LTL9613743381789218617.gal -t CGAL -LTL /tmp/LTL18005122597932041286.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("((u5.p21>=1)&&(u6.p23>=1))")))||(G(("(i5.u3.p7>=1)")||(("((u5.p21>=1)&&(u6.p23>=1))")U("((u2.p5>=1)&&(u4.p17>=1))"))))))
Formula 0 simplified : !(XF"((u5.p21>=1)&&(u6.p23>=1))" | G("(i5.u3.p7>=1)" | ("((u5.p21>=1)&&(u6.p23>=1))" U "((u2.p5>=1)&&(u4.p17>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16276517952098883971
[2021-05-12 11:17:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16276517952098883971
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/ltsmin16276517952098883971]
Compilation finished in 125 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16276517952098883971]
Link finished in 32 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)||((LTLAPp0==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16276517952098883971]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: LTL layer: formula: (X(<>((LTLAPp0==true)))||[](((LTLAPp1==true)||((LTLAPp0==true) U (LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: "(X(<>((LTLAPp0==true)))||[](((LTLAPp1==true)||((LTLAPp0==true) U (LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.104: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.105: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.105: State length is 22, there are 28 groups
pins2lts-mc-linux64( 0/ 8), 0.105: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.105: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.105: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.105: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.244: ~112 levels ~960 states ~7288 transitions
pins2lts-mc-linux64( 0/ 8), 0.247: ~218 levels ~1920 states ~14848 transitions
pins2lts-mc-linux64( 2/ 8), 0.252: ~432 levels ~3840 states ~34552 transitions
pins2lts-mc-linux64( 2/ 8), 0.257: ~876 levels ~7680 states ~81128 transitions
pins2lts-mc-linux64( 2/ 8), 0.278: ~1768 levels ~15360 states ~177280 transitions
pins2lts-mc-linux64( 2/ 8), 0.311: ~3581 levels ~30720 states ~381288 transitions
pins2lts-mc-linux64( 0/ 8), 0.408: ~7189 levels ~61440 states ~830128 transitions
pins2lts-mc-linux64( 0/ 8), 0.582: ~14382 levels ~122880 states ~1703824 transitions
pins2lts-mc-linux64( 4/ 8), 0.931: ~28824 levels ~245760 states ~3500008 transitions
pins2lts-mc-linux64( 4/ 8), 1.659: ~57724 levels ~491520 states ~7093288 transitions
pins2lts-mc-linux64( 1/ 8), 3.229: ~115605 levels ~983040 states ~14367864 transitions
pins2lts-mc-linux64( 4/ 8), 7.902: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 8.193:
pins2lts-mc-linux64( 0/ 8), 8.194: mean standard work distribution: 6.6% (states) 6.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 8.194:
pins2lts-mc-linux64( 0/ 8), 8.194: Explored 1569788 states 23077488 transitions, fanout: 14.701
pins2lts-mc-linux64( 0/ 8), 8.194: Total exploration time 8.080 sec (7.790 sec minimum, 7.899 sec on average)
pins2lts-mc-linux64( 0/ 8), 8.194: States per second: 194281, Transitions per second: 2856125
pins2lts-mc-linux64( 0/ 8), 8.194:
pins2lts-mc-linux64( 0/ 8), 8.194: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 8.194: Redundant explorations: -93.1977
pins2lts-mc-linux64( 0/ 8), 8.194:
pins2lts-mc-linux64( 0/ 8), 8.194: Queue width: 8B, total height: 1475264, memory: 11.26MB
pins2lts-mc-linux64( 0/ 8), 8.194: Tree memory: 432.1MB, 19.6 B/state, compr.: 21.8%
pins2lts-mc-linux64( 0/ 8), 8.194: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 8.194: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 8.194: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 8.194: Est. total memory use: 443.3MB (~1035.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true)))||[](((LTLAPp1==true)||((LTLAPp0==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16276517952098883971]
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)))||[](((LTLAPp1==true)||((LTLAPp0==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16276517952098883971]
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)
Treatment of property HouseConstruction-PT-32000-06 finished in 39861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 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 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 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 10 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 23 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 23 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 27 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 31 place count 7 transition count 5
Applied a total of 31 rules in 2 ms. Remains 7 /26 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 11:17:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 11:17:17] [INFO ] Implicit Places using invariants in 20 ms returned [2, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-12 11:17:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 11:17:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:17:17] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 5/26 places, 5/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 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 11:17:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 11:17:17] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 11:17:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:17:17] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-32000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p0)))
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4/4 places, 4/4 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 7523 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:17:25] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:17:25] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:17:25] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:17:25] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
[2021-05-12 11:17:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 11:17:25] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 11:17:25] [INFO ] Dead Transitions using invariants and state equation in 4 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/4 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 68286 steps with 103 reset in 31 ms.
FORMULA HouseConstruction-PT-32000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-07 finished in 8182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G(p1)&&X(G(!p2))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 11:17:25] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 11:17:25] [INFO ] Implicit Places using invariants in 19 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 20 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:17:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:17:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 22/26 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 11:17:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 11:17:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (NOT p1) p2), true]
Running random walk in product with property : HouseConstruction-PT-32000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s14 1)), p1:(LT s21 1), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (F (G p2)), p0, p1, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G p2))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 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.
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 11:17:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:17:26] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:17:26] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 11:17:26] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:17:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 11:17:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 18
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 5 place count 22 transition count 20
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 22 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2021-05-12 11:17:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-12 11:17:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 11:17:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/22 places, 18/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Starting structural reductions, iteration 0 : 22/22 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 11:17:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:17:26] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:17:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 11:17:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 11:17:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 11:17:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620818248290

--------------------
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-32000"
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-32000, 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-162075406700245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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