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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 11K 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.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 22K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620795567187

Running Version 0
[2021-05-12 04:59:28] [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 04:59:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 04:59:28] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 04:59:28] [INFO ] Transformed 26 places.
[2021-05-12 04:59:28] [INFO ] Transformed 18 transitions.
[2021-05-12 04:59:28] [INFO ] Parsed PT model containing 26 places and 18 transitions in 63 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 04:59:28] [INFO ] Initial state test concluded for 3 properties.
FORMULA HouseConstruction-PT-00010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 9 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 04:59:28] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-12 04:59:29] [INFO ] Implicit Places using invariants in 79 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:59:29] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:59:29] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 04:59:29] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-12 04:59:29] [INFO ] Flatten gal took : 20 ms
FORMULA HouseConstruction-PT-00010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 04:59:29] [INFO ] Flatten gal took : 4 ms
[2021-05-12 04:59:29] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 676 steps, including 3 resets, run visited all 18 properties in 4 ms. (steps per millisecond=169 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((X(p0) U (p1 U (p0||G(p1)))) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 04:59:29] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-12 04:59:29] [INFO ] Implicit Places using invariants in 32 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:59:29] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:59:29] [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 04:59:29] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-00010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s1 s4), p0:(LEQ 2 s9), p1:(LEQ s13 s0)], 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]]
Entered a terminal (fully accepting) state of product in 118 steps with 5 reset in 4 ms.
FORMULA HouseConstruction-PT-00010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-00 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 04:59:29] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 04:59:29] [INFO ] Implicit Places using invariants in 19 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:59:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 04:59:29] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-12 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, (NOT p0), true, true]
Running random walk in product with property : HouseConstruction-PT-00010-01 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s3 s15)], 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 15190 reset in 205 ms.
Product exploration explored 100000 steps with 15171 reset in 131 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[p0, (NOT p0), true, true]
Product exploration explored 100000 steps with 15151 reset in 86 ms.
Product exploration explored 100000 steps with 15039 reset in 116 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 94 ms :[p0, (NOT p0), true, true]
Support contains 2 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 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 21 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 21 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 21 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 19 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 19 transition count 18
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 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 16 transition count 15
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 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 10 ms. Remains 16 /21 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 04:59:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-12 04:59:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:59:30] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 15/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Product exploration explored 100000 steps with 33333 reset in 202 ms.
[2021-05-12 04:59:31] [INFO ] Flatten gal took : 4 ms
[2021-05-12 04:59:31] [INFO ] Flatten gal took : 2 ms
[2021-05-12 04:59:31] [INFO ] Time to serialize gal into /tmp/LTL10464352112559229450.gal : 1 ms
[2021-05-12 04:59:31] [INFO ] Time to serialize properties into /tmp/LTL2059436926398007115.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/LTL10464352112559229450.gal, -t, CGAL, -LTL, /tmp/LTL2059436926398007115.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/LTL10464352112559229450.gal -t CGAL -LTL /tmp/LTL2059436926398007115.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p6>p22)"))&&(F("(p6<=p22)")))))
Formula 0 simplified : !X(F"(p6>p22)" & F"(p6<=p22)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
171 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,1.7304,46340,1,0,132,157749,71,81,727,166058,245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00010-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HouseConstruction-PT-00010-01 finished in 3423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X((G(F(p0))&&F((p1 U (p2||G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 04:59:33] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 04:59:33] [INFO ] Implicit Places using invariants in 25 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:59:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:59:33] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:59:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:59:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 7}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT 2 s22), p2:(AND (GT 1 s3) (GT s17 s10)), p1:(GT s17 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 802 reset in 236 ms.
Product exploration explored 100000 steps with 824 reset in 289 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 817 reset in 155 ms.
Product exploration explored 100000 steps with 839 reset in 179 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Performed 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 23 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 23 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 23 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 21 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 21 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 19 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 19 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 5 ms. Remains 19 /23 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-12 04:59:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-12 04:59:35] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 04:59:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/23 places, 14/18 transitions.
Product exploration explored 100000 steps with 2216 reset in 214 ms.
Product exploration explored 100000 steps with 2197 reset in 212 ms.
[2021-05-12 04:59:35] [INFO ] Flatten gal took : 2 ms
[2021-05-12 04:59:35] [INFO ] Flatten gal took : 1 ms
[2021-05-12 04:59:35] [INFO ] Time to serialize gal into /tmp/LTL9005045839178402574.gal : 1 ms
[2021-05-12 04:59:35] [INFO ] Time to serialize properties into /tmp/LTL11660639278732673433.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/LTL9005045839178402574.gal, -t, CGAL, -LTL, /tmp/LTL11660639278732673433.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/LTL9005045839178402574.gal -t CGAL -LTL /tmp/LTL11660639278732673433.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X((G(F("(p16<2)")))&&(F(("(p27>p9)")U(("((p4<1)&&(p27>p9))")||(G("(p27>p9)"))))))))))))
Formula 0 simplified : !XXXXX(GF"(p16<2)" & F("(p27>p9)" U ("((p4<1)&&(p27>p9))" | G"(p27>p9)")))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-12 04:59:50] [INFO ] Flatten gal took : 2 ms
[2021-05-12 04:59:50] [INFO ] Applying decomposition
[2021-05-12 04:59:50] [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/graph7209553190697775734.txt, -o, /tmp/graph7209553190697775734.bin, -w, /tmp/graph7209553190697775734.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/graph7209553190697775734.bin, -l, -1, -v, -w, /tmp/graph7209553190697775734.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 04:59:50] [INFO ] Decomposing Gal with order
[2021-05-12 04:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 04:59:50] [INFO ] Flatten gal took : 24 ms
[2021-05-12 04:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 04:59:50] [INFO ] Time to serialize gal into /tmp/LTL16890563432512869864.gal : 1 ms
[2021-05-12 04:59:50] [INFO ] Time to serialize properties into /tmp/LTL11773958944155844618.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/LTL16890563432512869864.gal, -t, CGAL, -LTL, /tmp/LTL11773958944155844618.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/LTL16890563432512869864.gal -t CGAL -LTL /tmp/LTL11773958944155844618.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X((G(F("(gi0.gi0.gu8.p16<2)")))&&(F(("(gu3.p27>gu3.p9)")U(("((gi0.gi0.gu8.p4<1)&&(gu3.p27>gu3.p9))")||(G("(gu3.p27>gu3.p9)"))))))))))))
Formula 0 simplified : !XXXXX(GF"(gi0.gi0.gu8.p16<2)" & F("(gu3.p27>gu3.p9)" U ("((gi0.gi0.gu8.p4<1)&&(gu3.p27>gu3.p9))" | G"(gu3.p27>gu3.p9)")))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11952707736925374769
[2021-05-12 05:00:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11952707736925374769
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/ltsmin11952707736925374769]
Compilation finished in 219 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11952707736925374769]
Link finished in 43 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(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11952707736925374769]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00010-04 finished in 47744 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 05:00:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 05:00:20] [INFO ] Implicit Places using invariants in 20 ms returned [3, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:00:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:00:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:00:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:00:21] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HouseConstruction-PT-00010-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s7 s8), p0:(GT s14 s5)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-05 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X((F(p1) U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 05:00:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 05:00:21] [INFO ] Implicit Places using invariants in 13 ms returned [9, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:00:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:00:21] [INFO ] Dead Transitions using invariants and state equation in 18 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 05:00:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:00:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ s3 s17) (LEQ 1 s14)), p2:(LEQ s9 s7), p1:(LEQ s3 s17)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 107 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 (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), p0, p2, p1]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Product exploration explored 100000 steps with 33333 reset in 83 ms.
[2021-05-12 05:00:22] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:00:22] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:00:22] [INFO ] Time to serialize gal into /tmp/LTL12535442495275221800.gal : 0 ms
[2021-05-12 05:00:22] [INFO ] Time to serialize properties into /tmp/LTL11674376692365379877.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/LTL12535442495275221800.gal, -t, CGAL, -LTL, /tmp/LTL11674376692365379877.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/LTL12535442495275221800.gal -t CGAL -LTL /tmp/LTL11674376692365379877.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X((F("(p4<=p26)"))U("(p8<=p15)")))&&("((p4<=p26)||(p20>=1))")))))
Formula 0 simplified : !XF("((p4<=p26)||(p20>=1))" & X(F"(p4<=p26)" U "(p8<=p15)"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
393 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,3.937,76292,1,0,40,302784,69,24,761,341136,57
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HouseConstruction-PT-00010-09 finished in 5158 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 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 23 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 10 place count 18 transition count 5
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 26 place count 9 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 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 31 place count 5 transition count 3
Applied a total of 31 rules in 6 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 05:00:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 05:00:26] [INFO ] Implicit Places using invariants in 24 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
[2021-05-12 05:00:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 05:00:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:00:26] [INFO ] Dead Transitions using invariants and state equation in 29 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 8 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 05:00:26] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 05:00:26] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 05:00:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:00:26] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-11 finished in 144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 20 transition count 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 6
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 25 place count 9 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 2 with 4 rules applied. Total rules applied 29 place count 6 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 5 transition count 4
Applied a total of 30 rules in 2 ms. Remains 5 /25 variables (removed 20) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 05:00:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 05:00:26] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 05:00:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 05:00:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-12 05:00:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 05:00:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 05:00:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s2)], 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 2439 reset in 82 ms.
Product exploration explored 100000 steps with 2439 reset in 85 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2439 reset in 61 ms.
Product exploration explored 100000 steps with 2439 reset in 85 ms.
[2021-05-12 05:00:26] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:00:26] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:00:26] [INFO ] Time to serialize gal into /tmp/LTL2741380695927941463.gal : 0 ms
[2021-05-12 05:00:26] [INFO ] Time to serialize properties into /tmp/LTL9578038882319650832.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/LTL2741380695927941463.gal, -t, CGAL, -LTL, /tmp/LTL9578038882319650832.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/LTL2741380695927941463.gal -t CGAL -LTL /tmp/LTL9578038882319650832.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p25<=p17)"))))
Formula 0 simplified : !FG"(p25<=p17)"
Reverse transition relation is NOT exact ! Due to transitions t14.t12.t15.t16.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/1/4
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
19 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.198497,21592,1,0,389,26856,36,270,176,38797,717
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HouseConstruction-PT-00010-13 finished in 783 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&((p1||G((F(p2) U p3))) U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6 place count 21 transition count 8
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 20 place count 13 transition count 8
Applied a total of 20 rules in 3 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 05:00:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:00:27] [INFO ] Implicit Places using invariants in 13 ms returned [1, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-12 05:00:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 05:00:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:00:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 11/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 05:00:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 05:00:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:00:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p0), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), p0, (AND p0 p1 (NOT p3)), (AND (NOT p2) p0 p3)]
Running random walk in product with property : HouseConstruction-PT-00010-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=true, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s8), p1:(LEQ s7 s10), p3:(LEQ s2 s4), p2:(GT 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7794 steps with 150 reset in 17 ms.
FORMULA HouseConstruction-PT-00010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-15 finished in 390 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4457710420773842275
[2021-05-12 05:00:27] [INFO ] Applying decomposition
[2021-05-12 05:00:27] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:00:27] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 05:00:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 05:00:27] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 05:00:27] [INFO ] Computation of Complete enable 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/graph6517604688552145813.txt, -o, /tmp/graph6517604688552145813.bin, -w, /tmp/graph6517604688552145813.weights], workingDir=null]
[2021-05-12 05:00:27] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 05:00:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6517604688552145813.bin, -l, -1, -v, -w, /tmp/graph6517604688552145813.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:00:27] [INFO ] Decomposing Gal with order
[2021-05-12 05:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:00:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4457710420773842275
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/ltsmin4457710420773842275]
[2021-05-12 05:00:27] [INFO ] Flatten gal took : 3 ms
[2021-05-12 05:00:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 05:00:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality8696415265008153204.gal : 1 ms
[2021-05-12 05:00:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality17310091236225036537.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/LTLCardinality8696415265008153204.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17310091236225036537.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/LTLCardinality8696415265008153204.gal -t CGAL -LTL /tmp/LTLCardinality17310091236225036537.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X((G(F("(gi0.gi0.gu9.p16<2)")))&&(F(("(gu6.p27>gu6.p9)")U(("((gi0.gi0.gu9.p4<1)&&(gu6.p27>gu6.p9))")||(G("(gu6.p27>gu6.p9)"))))))))))))
Formula 0 simplified : !XXXXX(GF"(gi0.gi0.gu9.p16<2)" & F("(gu6.p27>gu6.p9)" U ("((gi0.gi0.gu9.p4<1)&&(gu6.p27>gu6.p9))" | G"(gu6.p27>gu6.p9)")))
Compilation finished in 174 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4457710420773842275]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4457710420773842275]
Reverse transition relation is NOT exact ! Due to transitions t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.035: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.237: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.237: LTL layer: formula: X(X(X(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))))
pins2lts-mc-linux64( 7/ 8), 0.237: "X(X(X(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.237: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.277: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.297: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.297: State length is 26, there are 33 groups
pins2lts-mc-linux64( 0/ 8), 0.297: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.297: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.297: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.297: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.407: [Blue] ~120 levels ~960 states ~3344 transitions
pins2lts-mc-linux64( 5/ 8), 0.408: [Blue] ~179 levels ~1920 states ~6304 transitions
pins2lts-mc-linux64( 2/ 8), 0.409: [Blue] ~177 levels ~3840 states ~9632 transitions
pins2lts-mc-linux64( 2/ 8), 0.410: [Blue] ~177 levels ~7680 states ~20816 transitions
pins2lts-mc-linux64( 2/ 8), 0.412: [Blue] ~178 levels ~15360 states ~44824 transitions
pins2lts-mc-linux64( 3/ 8), 0.428: [Blue] ~175 levels ~30720 states ~71216 transitions
pins2lts-mc-linux64( 3/ 8), 0.451: [Blue] ~175 levels ~61440 states ~153912 transitions
pins2lts-mc-linux64( 3/ 8), 0.500: [Blue] ~175 levels ~122880 states ~361208 transitions
pins2lts-mc-linux64( 1/ 8), 0.626: [Blue] ~181 levels ~245760 states ~1291680 transitions
pins2lts-mc-linux64( 1/ 8), 0.737: [Blue] ~181 levels ~491520 states ~2854744 transitions
pins2lts-mc-linux64( 1/ 8), 1.128: [Blue] ~181 levels ~983040 states ~5877960 transitions
pins2lts-mc-linux64( 1/ 8), 2.047: [Blue] ~181 levels ~1966080 states ~12926168 transitions
pins2lts-mc-linux64( 4/ 8), 4.051: [Blue] ~173 levels ~3932160 states ~18003816 transitions
pins2lts-mc-linux64( 4/ 8), 8.351: [Blue] ~173 levels ~7864320 states ~40381728 transitions
pins2lts-mc-linux64( 0/ 8), 17.811: [Blue] ~177 levels ~15728640 states ~103852656 transitions
pins2lts-mc-linux64( 2/ 8), 37.101: [Blue] ~178 levels ~31457280 states ~204862208 transitions
pins2lts-mc-linux64( 6/ 8), 78.880: [Blue] ~174 levels ~62914560 states ~459615872 transitions
pins2lts-mc-linux64( 2/ 8), 167.934: [Blue] ~178 levels ~125829120 states ~905535352 transitions
pins2lts-mc-linux64( 3/ 8), 218.668: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 218.693:
pins2lts-mc-linux64( 0/ 8), 218.693: Explored 138045844 states 1053720676 transitions, fanout: 7.633
pins2lts-mc-linux64( 0/ 8), 218.693: Total exploration time 218.370 sec (218.350 sec minimum, 218.364 sec on average)
pins2lts-mc-linux64( 0/ 8), 218.693: States per second: 632165, Transitions per second: 4825392
pins2lts-mc-linux64( 0/ 8), 218.693:
pins2lts-mc-linux64( 0/ 8), 218.693: State space has 134216433 states, 11537628 are accepting
pins2lts-mc-linux64( 0/ 8), 218.693: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 218.693: blue states: 138045844 (102.85%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 218.693: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 218.693: all-red states: 37142594 (27.67%), bogus 376647 (0.28%)
pins2lts-mc-linux64( 0/ 8), 218.693:
pins2lts-mc-linux64( 0/ 8), 218.693: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 218.693:
pins2lts-mc-linux64( 0/ 8), 218.693: Queue width: 8B, total height: 1408, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 218.693: Tree memory: 1221.3MB, 9.5 B/state, compr.: 9.0%
pins2lts-mc-linux64( 0/ 8), 218.693: Tree fill ratio (roots/leafs): 99.0%/77.0%
pins2lts-mc-linux64( 0/ 8), 218.693: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 218.693: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 218.693: Est. total memory use: 1221.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4457710420773842275]
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(X(X(([](<>((LTLAPp0==true)))&&<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4457710420773842275]
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)
345 unique states visited
0 strongly connected components in search stack
353 transitions explored
181 items max in DFS search stack
68860 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,688.604,3072232,1,0,1006,1.48705e+07,22,935,569,2.44766e+07,941
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00010-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620796458953

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

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