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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620799388168

Running Version 0
[2021-05-12 06:03:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 06:03:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:03:09] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 06:03:09] [INFO ] Transformed 26 places.
[2021-05-12 06:03:09] [INFO ] Transformed 18 transitions.
[2021-05-12 06:03:09] [INFO ] Parsed PT model containing 26 places and 18 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 06:03:09] [INFO ] Initial state test concluded for 5 properties.
FORMULA HouseConstruction-PT-00100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 8 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 06:03:09] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-12 06:03:09] [INFO ] Implicit Places using invariants in 71 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:03:09] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 06:03:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:03:09] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:03:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 06:03:10] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 06:03:10] [INFO ] Flatten gal took : 18 ms
FORMULA HouseConstruction-PT-00100-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:03:10] [INFO ] Flatten gal took : 4 ms
[2021-05-12 06:03:10] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100044 steps, including 54 resets, run finished after 48 ms. (steps per millisecond=2084 ) properties (out of 14) seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 06:03:10] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-12 06:03:10] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-12 06:03:10] [INFO ] Initial state test concluded for 1 properties.
FORMULA HouseConstruction-PT-00100-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 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 20 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 19 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 19 transition count 10
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 9 transition count 7
Applied a total of 26 rules in 8 ms. Remains 9 /25 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 06:03:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 06:03:10] [INFO ] Implicit Places using invariants in 15 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-12 06:03:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 06:03:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 8/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-12 06:03:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 06:03:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-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:(OR (GT 1 s5) (LEQ s1 s3))], 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 3663 reset in 208 ms.
Product exploration explored 100000 steps with 3643 reset in 156 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
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-00100-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00100-00 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:03:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 06:03:10] [INFO ] Implicit Places using invariants in 15 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 16 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-02 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 15 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 13 transition count 8
Applied a total of 18 rules in 16 ms. Remains 13 /25 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-12 06:03:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 06:03:11] [INFO ] Implicit Places using invariants in 22 ms returned [2, 3, 6, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 22 ms to find 4 implicit places.
[2021-05-12 06:03:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 06:03:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 06:03:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 9/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 06:03:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 06:03:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 06:03:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s6 s2), p0:(OR (GT 2 s8) (GT 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2616 reset in 139 ms.
Product exploration explored 100000 steps with 2538 reset in 142 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (G p0)), (NOT p1), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-00100-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00100-04 finished in 486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:03:11] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 06:03:11] [INFO ] Implicit Places using invariants in 15 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:03:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 06:03:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:03:11] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 06:03:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HouseConstruction-PT-00100-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s7 s8)], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 63 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)), p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0), true]
Support contains 2 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 22 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 22 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 19 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 19 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 4 ms. Remains 19 /22 variables (removed 3) and now considering 17/18 (removed 1) transitions.
[2021-05-12 06:03:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-12 06:03:12] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-12 06:03:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/22 places, 17/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
[2021-05-12 06:03:12] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:03:12] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:03:12] [INFO ] Time to serialize gal into /tmp/LTL231098398642280218.gal : 1 ms
[2021-05-12 06:03:12] [INFO ] Time to serialize properties into /tmp/LTL8185465238335225490.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/LTL231098398642280218.gal, -t, CGAL, -LTL, /tmp/LTL8185465238335225490.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/LTL231098398642280218.gal -t CGAL -LTL /tmp/LTL8185465238335225490.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(p11<=p12)")))
Formula 0 simplified : !X"(p11<=p12)"
Detected timeout of ITS tools.
[2021-05-12 06:03:27] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:03:27] [INFO ] Applying decomposition
[2021-05-12 06:03:27] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10665737481218035344.txt, -o, /tmp/graph10665737481218035344.bin, -w, /tmp/graph10665737481218035344.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/graph10665737481218035344.bin, -l, -1, -v, -w, /tmp/graph10665737481218035344.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:03:29] [INFO ] Decomposing Gal with order
[2021-05-12 06:03:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:03:29] [INFO ] Flatten gal took : 23 ms
[2021-05-12 06:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 06:03:29] [INFO ] Time to serialize gal into /tmp/LTL62925662810922660.gal : 1 ms
[2021-05-12 06:03:29] [INFO ] Time to serialize properties into /tmp/LTL9938606261619979656.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/LTL62925662810922660.gal, -t, CGAL, -LTL, /tmp/LTL9938606261619979656.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/LTL62925662810922660.gal -t CGAL -LTL /tmp/LTL9938606261619979656.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(gu1.p11<=gu1.p12)")))
Formula 0 simplified : !X"(gu1.p11<=gu1.p12)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17035668650671555003
[2021-05-12 06:03:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17035668650671555003
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/ltsmin17035668650671555003]
Compilation finished in 182 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17035668650671555003]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin17035668650671555003]
LTSmin run took 120 ms.
FORMULA HouseConstruction-PT-00100-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00100-05 finished in 32926 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:03:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 06:03:44] [INFO ] Implicit Places using invariants in 20 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:03:44] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:03:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s13 s15) (LEQ s5 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-06 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 12
Reduce places removed 5 places and 0 transitions.
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 18 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 17 transition count 11
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 17 transition count 6
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 25 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 8 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 5 transition count 3
Applied a total of 31 rules in 4 ms. Remains 5 /25 variables (removed 20) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 06:03:44] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 06:03:44] [INFO ] Implicit Places using invariants in 13 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-12 06:03:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 06:03:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:44] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 3/25 places, 3/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 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 06:03:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:44] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:44] [INFO ] Implicit Places using invariants and state equation in 6 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 : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1)], 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 57 ms.
Product exploration explored 100000 steps with 50000 reset in 65 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 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 50 ms.
[2021-05-12 06:03:44] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:03:44] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:03:44] [INFO ] Time to serialize gal into /tmp/LTL4277954498334590014.gal : 0 ms
[2021-05-12 06:03:44] [INFO ] Time to serialize properties into /tmp/LTL10735878689469191691.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/LTL4277954498334590014.gal, -t, CGAL, -LTL, /tmp/LTL10735878689469191691.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/LTL4277954498334590014.gal -t CGAL -LTL /tmp/LTL10735878689469191691.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p20>=1)")))
Formula 0 simplified : !F"(p20>=1)"
Reverse transition relation is NOT exact ! Due to transitions t14.t12.t5.t7.t6.t17.t15.t16.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/1/2
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.340316,21112,1,0,15,16051,26,9,239,25947,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00100-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HouseConstruction-PT-00100-09 finished in 736 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 11
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 16 transition count 6
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 25 place count 9 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 9 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 6 transition count 4
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 34 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 2 transition count 2
Applied a total of 36 rules in 2 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 06:03:45] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:45] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 06:03:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:45] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 497 reset in 83 ms.
Product exploration explored 100000 steps with 497 reset in 112 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-00100-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00100-11 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 11
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 17 transition count 6
Deduced a syphon composed of 5 places in 1 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 25 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 7 transition count 5
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 30 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 31 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 35 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 36 place count 2 transition count 2
Applied a total of 36 rules in 3 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 06:03:45] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 06:03:45] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 06:03:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 06:03:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 06:03:45] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 497 reset in 70 ms.
Product exploration explored 100000 steps with 497 reset in 101 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-00100-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00100-13 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(X((G(!p0)||(!p0&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:03:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 06:03:45] [INFO ] Implicit Places using invariants in 12 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 06:03:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 06:03:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:03:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p1), p0, p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, p0, p0]
Running random walk in product with property : HouseConstruction-PT-00100-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 9}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 11}], [{ cond=true, acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 3}], [{ cond=(NOT p1), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=p0, acceptance={} source=11 dest: 12}], [{ cond=p0, acceptance={} source=12 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 4}], [{ cond=(NOT p0), acceptance={} source=13 dest: 7}, { cond=p0, acceptance={} source=13 dest: 14}], [{ cond=p0, acceptance={} source=14 dest: 5}, { cond=(NOT p0), acceptance={} source=14 dest: 6}]], initial=13, aps=[p1:(GT 1 s1), p0:(LEQ s19 s8)], 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 285 reset in 135 ms.
Product exploration explored 100000 steps with 297 reset in 147 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 (OR (G p0) (G (NOT p0)))), p1, p0]
Stuttering acceptance computed with spot in 9947 ms :[true, (NOT p1), p0, p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, p0, p0]
Product exploration explored 100000 steps with 294 reset in 133 ms.
Product exploration explored 100000 steps with 268 reset in 140 ms.
Applying partial POR strategy [true, true, false, true, true, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), p0, p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, p0, p0]
Support contains 3 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 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 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 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 19 transition count 16
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 16 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 16 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 3 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-12 06:03:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2021-05-12 06:03:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 06:03:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 13/18 transitions.
Product exploration explored 100000 steps with 491 reset in 255 ms.
Product exploration explored 100000 steps with 506 reset in 105 ms.
[2021-05-12 06:03:57] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:03:57] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:03:57] [INFO ] Time to serialize gal into /tmp/LTL15817786842018122292.gal : 1 ms
[2021-05-12 06:03:57] [INFO ] Time to serialize properties into /tmp/LTL1381151280634356998.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/LTL15817786842018122292.gal, -t, CGAL, -LTL, /tmp/LTL1381151280634356998.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/LTL15817786842018122292.gal -t CGAL -LTL /tmp/LTL1381151280634356998.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(p25<=p8)")U(X(X(X((G("(p25>p8)"))||(("(p25>p8)")&&(F("(p2<1)")))))))))
Formula 0 simplified : !("(p25<=p8)" U XXX(G"(p25>p8)" | ("(p25>p8)" & F"(p2<1)")))
Detected timeout of ITS tools.
[2021-05-12 06:04:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:04:12] [INFO ] Applying decomposition
[2021-05-12 06:04:12] [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/graph12963424733817631899.txt, -o, /tmp/graph12963424733817631899.bin, -w, /tmp/graph12963424733817631899.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/graph12963424733817631899.bin, -l, -1, -v, -w, /tmp/graph12963424733817631899.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:04:12] [INFO ] Decomposing Gal with order
[2021-05-12 06:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:04:12] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:04:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 06:04:12] [INFO ] Time to serialize gal into /tmp/LTL16535350945804406117.gal : 55 ms
[2021-05-12 06:04:12] [INFO ] Time to serialize properties into /tmp/LTL11664533132600742521.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/LTL16535350945804406117.gal, -t, CGAL, -LTL, /tmp/LTL11664533132600742521.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/LTL16535350945804406117.gal -t CGAL -LTL /tmp/LTL11664533132600742521.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(gu7.p25<=gu7.p8)")U(X(X(X((G("(gu7.p25>gu7.p8)"))||(("(gu7.p25>gu7.p8)")&&(F("(gi0.gi1.gi0.gu0.p2<1)")))))))))
Formula 0 simplified : !("(gu7.p25<=gu7.p8)" U XXX(G"(gu7.p25>gu7.p8)" | ("(gu7.p25>gu7.p8)" & F"(gi0.gi1.gi0.gu0.p2<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9160810829165555928
[2021-05-12 06:04:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9160810829165555928
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/ltsmin9160810829165555928]
Compilation finished in 200 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9160810829165555928]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9160810829165555928]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-14 finished in 58648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 06:04:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 06:04:46] [INFO ] Implicit Places using invariants in 11 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:04:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 06:04:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 06:04:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 06:04:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s14), p1:(LEQ s4 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22479 reset in 65 ms.
Product exploration explored 100000 steps with 22613 reset in 76 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), p1]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA HouseConstruction-PT-00100-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00100-15 finished in 2848 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-12 06:04:47] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin13696354996870598598
[2021-05-12 06:04:47] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 06:04:47] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:04:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 06:04:47] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 06:04:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 06:04:47] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 06:04:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph972664985979538449.txt, -o, /tmp/graph972664985979538449.bin, -w, /tmp/graph972664985979538449.weights], workingDir=null]
[2021-05-12 06:04:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13696354996870598598
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/ltsmin13696354996870598598]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph972664985979538449.bin, -l, -1, -v, -w, /tmp/graph972664985979538449.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:04:47] [INFO ] Decomposing Gal with order
[2021-05-12 06:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:04:47] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 06:04:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality15394525860798438699.gal : 1 ms
[2021-05-12 06:04:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality11923697356620555995.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/LTLCardinality15394525860798438699.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11923697356620555995.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/LTLCardinality15394525860798438699.gal -t CGAL -LTL /tmp/LTLCardinality11923697356620555995.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(gu8.p25<=gu8.p8)")U(X(X(X(("(gu8.p25>gu8.p8)")U((("(gu8.p25>gu8.p8)")&&(F("(gi0.gi0.gu0.p2<1)")))||(G("(gu8.p25>gu8.p8)")))))))))
Formula 0 simplified : !("(gu8.p25<=gu8.p8)" U XXX("(gu8.p25>gu8.p8)" U (("(gu8.p25>gu8.p8)" & F"(gi0.gi0.gu0.p2<1)") | G"(gu8.p25>gu8.p8)")))
Compilation finished in 149 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13696354996870598598]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13696354996870598598]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: ((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.001: "((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.056: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.056: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.056: State length is 26, there are 41 groups
pins2lts-mc-linux64( 0/ 8), 0.056: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.056: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.056: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.056: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.376: ~96 levels ~960 states ~9160 transitions
pins2lts-mc-linux64( 6/ 8), 0.376: ~223 levels ~1920 states ~19544 transitions
pins2lts-mc-linux64( 6/ 8), 0.379: ~463 levels ~3840 states ~43296 transitions
pins2lts-mc-linux64( 1/ 8), 0.385: ~959 levels ~7680 states ~101232 transitions
pins2lts-mc-linux64( 6/ 8), 0.404: ~1745 levels ~15360 states ~171096 transitions
pins2lts-mc-linux64( 1/ 8), 0.409: ~1738 levels ~30720 states ~216376 transitions
pins2lts-mc-linux64( 6/ 8), 0.419: ~1745 levels ~61440 states ~279920 transitions
pins2lts-mc-linux64( 1/ 8), 0.458: ~1742 levels ~122880 states ~461544 transitions
pins2lts-mc-linux64( 0/ 8), 0.528: ~1798 levels ~245760 states ~682344 transitions
pins2lts-mc-linux64( 0/ 8), 0.670: ~1798 levels ~491520 states ~1341184 transitions
pins2lts-mc-linux64( 0/ 8), 1.005: ~1798 levels ~983040 states ~2771768 transitions
pins2lts-mc-linux64( 0/ 8), 1.653: ~1798 levels ~1966080 states ~5617360 transitions
pins2lts-mc-linux64( 2/ 8), 3.086: ~1731 levels ~3932160 states ~11938160 transitions
pins2lts-mc-linux64( 2/ 8), 6.175: ~1731 levels ~7864320 states ~25122048 transitions
pins2lts-mc-linux64( 2/ 8), 12.433: ~1731 levels ~15728640 states ~50838632 transitions
pins2lts-mc-linux64( 2/ 8), 26.153: ~1731 levels ~31457280 states ~107854872 transitions
pins2lts-mc-linux64( 2/ 8), 54.916: ~1731 levels ~62914560 states ~226695432 transitions
pins2lts-mc-linux64( 1/ 8), 116.355: ~1742 levels ~125829120 states ~490736344 transitions
pins2lts-mc-linux64( 4/ 8), 162.069: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 162.075:
pins2lts-mc-linux64( 0/ 8), 162.075: mean standard work distribution: 37.8% (states) 37.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 162.075:
pins2lts-mc-linux64( 0/ 8), 162.075: Explored 134077784 states 543650062 transitions, fanout: 4.055
pins2lts-mc-linux64( 0/ 8), 162.075: Total exploration time 162.010 sec (161.970 sec minimum, 161.986 sec on average)
pins2lts-mc-linux64( 0/ 8), 162.075: States per second: 827590, Transitions per second: 3355658
pins2lts-mc-linux64( 0/ 8), 162.075:
pins2lts-mc-linux64( 0/ 8), 162.075: Progress states detected: 687
pins2lts-mc-linux64( 0/ 8), 162.075: Redundant explorations: -0.1038
pins2lts-mc-linux64( 0/ 8), 162.075:
pins2lts-mc-linux64( 0/ 8), 162.075: Queue width: 8B, total height: 12976, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 162.075: Tree memory: 1242.8MB, 9.7 B/state, compr.: 9.2%
pins2lts-mc-linux64( 0/ 8), 162.075: Tree fill ratio (roots/leafs): 99.0%/85.0%
pins2lts-mc-linux64( 0/ 8), 162.075: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 162.075: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 162.075: Est. total memory use: 1242.9MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13696354996870598598]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X(X(X(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13696354996870598598]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 06:25:21] [INFO ] Flatten gal took : 135 ms
[2021-05-12 06:25:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality5551778217835447900.gal : 30 ms
[2021-05-12 06:25:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality3850021892667778874.ltl : 9 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/LTLCardinality5551778217835447900.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3850021892667778874.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/LTLCardinality5551778217835447900.gal -t CGAL -LTL /tmp/LTLCardinality3850021892667778874.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(p25<=p8)")U(X(X(X(("(p25>p8)")U((("(p25>p8)")&&(F("(p2<1)")))||(G("(p25>p8)")))))))))
Formula 0 simplified : !("(p25<=p8)" U XXX("(p25>p8)" U (("(p25>p8)" & F"(p2<1)") | G"(p25>p8)")))
Detected timeout of ITS tools.
[2021-05-12 06:46:00] [INFO ] Flatten gal took : 37 ms
[2021-05-12 06:46:00] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 06:46:00] [INFO ] Transformed 25 places.
[2021-05-12 06:46:00] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 06:46:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality18063311877187941312.gal : 7 ms
[2021-05-12 06:46:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality3914504219181811808.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/LTLCardinality18063311877187941312.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3914504219181811808.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality18063311877187941312.gal -t CGAL -LTL /tmp/LTLCardinality3914504219181811808.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(p25<=p8)")U(X(X(X(("(p25>p8)")U((("(p25>p8)")&&(F("(p2<1)")))||(G("(p25>p8)")))))))))
Formula 0 simplified : !("(p25<=p8)" U XXX("(p25>p8)" U (("(p25>p8)" & F"(p2<1)") | G"(p25>p8)")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-00100"
export BK_EXAMINATION="LTLCardinality"
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-00100, examination is LTLCardinality"
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-162075406600180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00100.tgz
mv HouseConstruction-PT-00100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;