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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620810793251

Running Version 0
[2021-05-12 09:13:14] [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 09:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 09:13:14] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 09:13:14] [INFO ] Transformed 26 places.
[2021-05-12 09:13:14] [INFO ] Transformed 18 transitions.
[2021-05-12 09:13:14] [INFO ] Parsed PT model containing 26 places and 18 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 09:13:14] [INFO ] Initial state test concluded for 7 properties.
FORMULA HouseConstruction-PT-04000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 09:13:15] [INFO ] Computed 8 place invariants in 8 ms
[2021-05-12 09:13:15] [INFO ] Implicit Places using invariants in 75 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 09:13:15] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-12 09:13:15] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 09:13:15] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 09:13:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 09:13:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 09:13:15] [INFO ] Flatten gal took : 19 ms
FORMULA HouseConstruction-PT-04000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 09:13:15] [INFO ] Flatten gal took : 5 ms
[2021-05-12 09:13:15] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100029 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=2273 ) properties (out of 20) seen :10
Running SMT prover for 10 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 09:13:15] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 09:13:15] [INFO ] Added : 13 causal constraints over 3 iterations in 32 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 09:13:15] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 09:13:15] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 09:13:15] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:13:15] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:13:15] [INFO ] Added : 14 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:13:15] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:13:15] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:13:15] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 09:13:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 09:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 09:13:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 09:13:15] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 09:13:15] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 2 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 09:13:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 09:13:16] [INFO ] Implicit Places using invariants in 22 ms returned [9, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:13:16] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 09:13:16] [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 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 09:13:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-04000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s3), p1:(GT 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-00 finished in 295 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
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 18 transition count 12
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 12 place count 18 transition count 6
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 26 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 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 36 place count 3 transition count 3
Applied a total of 36 rules in 7 ms. Remains 3 /25 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 09:13:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 09:13:16] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 09:13:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:13:16] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 09:13:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 09:13:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s0)], 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 8 reset in 180 ms.
Product exploration explored 100000 steps with 8 reset in 146 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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-04000-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-01 finished in 441 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((!p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 19 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 19 place count 13 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 11 transition count 7
Applied a total of 22 rules in 169 ms. Remains 11 /25 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 09:13:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:13:16] [INFO ] Implicit Places using invariants in 13 ms returned [3, 4, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 14 ms to find 3 implicit places.
[2021-05-12 09:13:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 09:13:16] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-12 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 8/25 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 09:13:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:13:16] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 09:13:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:13:17] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s1), p2:(LEQ s5 s3), p0:(LEQ 2 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 35 reset in 161 ms.
Product exploration explored 100000 steps with 32 reset in 142 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
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 p2) (G (NOT p2)))), (F (G (NOT p0))), p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 39 reset in 75 ms.
Product exploration explored 100000 steps with 22 reset in 102 ms.
[2021-05-12 09:13:17] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:13:17] [INFO ] Flatten gal took : 1 ms
[2021-05-12 09:13:17] [INFO ] Time to serialize gal into /tmp/LTL14808106677262525090.gal : 3 ms
[2021-05-12 09:13:17] [INFO ] Time to serialize properties into /tmp/LTL7947595302133537999.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/LTL14808106677262525090.gal, -t, CGAL, -LTL, /tmp/LTL7947595302133537999.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/LTL14808106677262525090.gal -t CGAL -LTL /tmp/LTL7947595302133537999.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p5>=2)"))||(G(("(p4>=1)")||(F("(p27<=p9)")))))))
Formula 0 simplified : !F(G"(p5>=2)" | G("(p4>=1)" | F"(p27<=p9)"))
Detected timeout of ITS tools.
[2021-05-12 09:13:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 09:13:32] [INFO ] Applying decomposition
[2021-05-12 09:13:32] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13174865679342413618.txt, -o, /tmp/graph13174865679342413618.bin, -w, /tmp/graph13174865679342413618.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/graph13174865679342413618.bin, -l, -1, -v, -w, /tmp/graph13174865679342413618.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:13:32] [INFO ] Decomposing Gal with order
[2021-05-12 09:13:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:13:33] [INFO ] Flatten gal took : 75 ms
[2021-05-12 09:13:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 09:13:33] [INFO ] Time to serialize gal into /tmp/LTL17983454359604214787.gal : 1 ms
[2021-05-12 09:13:33] [INFO ] Time to serialize properties into /tmp/LTL10474575481622118341.ltl : 11 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/LTL17983454359604214787.gal, -t, CGAL, -LTL, /tmp/LTL10474575481622118341.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/LTL17983454359604214787.gal -t CGAL -LTL /tmp/LTL10474575481622118341.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(gi0.gu0.p5>=2)"))||(G(("(gi0.gu1.p4>=1)")||(F("(gu2.p27<=gu2.p9)")))))))
Formula 0 simplified : !F(G"(gi0.gu0.p5>=2)" | G("(gi0.gu1.p4>=1)" | F"(gu2.p27<=gu2.p9)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11923759962735091911
[2021-05-12 09:13:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11923759962735091911
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/ltsmin11923759962735091911]
Compilation finished in 213 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11923759962735091911]
Link finished in 42 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))||[](((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11923759962735091911]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-04000-04 finished in 46396 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||(p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 09:14:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 09:14:03] [INFO ] Implicit Places using invariants in 13 ms returned [3, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:14:03] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 14 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 09:14:03] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HouseConstruction-PT-04000-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LEQ s7 s8), p1:(LEQ s14 s5), p2:(GT s4 s10)], 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 33333 reset in 81 ms.
Product exploration explored 100000 steps with 33333 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)), (F (G p1)), (F (G (NOT p2))), p0, p1, (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-04000-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-05 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0) U p1))||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 09:14:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 09:14:03] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 09:14:03] [INFO ] Computed 3 place invariants in 11 ms
[2021-05-12 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 26 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 09:14:03] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-04000-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s1), p0:(LEQ 2 s13), p2:(GT 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (NOT p1), (NOT p0), p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p1)))
Property proved to be true thanks to knowledge :(F (G p2))
FORMULA HouseConstruction-PT-04000-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-07 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(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 09:14:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 09:14:04] [INFO ] Implicit Places using invariants in 13 ms returned [9, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:14:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:14:04] [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 09:14:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:14:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, 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}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(LEQ s9 s7), p0:(LEQ s3 s17)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Product exploration explored 100000 steps with 25000 reset in 88 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 p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), p1, p0]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Applying partial POR strategy [true, false, false, true, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 21 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 17
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 13 place count 21 transition count 17
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 6 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-12 09:14:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-12 09:14:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:14:05] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/22 places, 14/18 transitions.
Product exploration explored 100000 steps with 25000 reset in 160 ms.
Product exploration explored 100000 steps with 25000 reset in 169 ms.
[2021-05-12 09:14:05] [INFO ] Flatten gal took : 4 ms
[2021-05-12 09:14:05] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:14:05] [INFO ] Time to serialize gal into /tmp/LTL1217826460747653811.gal : 1 ms
[2021-05-12 09:14:05] [INFO ] Time to serialize properties into /tmp/LTL2731697682079851225.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/LTL1217826460747653811.gal, -t, CGAL, -LTL, /tmp/LTL2731697682079851225.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/LTL1217826460747653811.gal -t CGAL -LTL /tmp/LTL2731697682079851225.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p4<=p26)")&&(X(F("(p8<=p15)")))))))
Formula 0 simplified : !XX("(p4<=p26)" & XF"(p8<=p15)")
Detected timeout of ITS tools.
[2021-05-12 09:14:20] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:14:20] [INFO ] Applying decomposition
[2021-05-12 09:14:20] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14959612437612295404.txt, -o, /tmp/graph14959612437612295404.bin, -w, /tmp/graph14959612437612295404.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/graph14959612437612295404.bin, -l, -1, -v, -w, /tmp/graph14959612437612295404.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:14:20] [INFO ] Decomposing Gal with order
[2021-05-12 09:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:14:20] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 09:14:20] [INFO ] Time to serialize gal into /tmp/LTL6659459164816161591.gal : 1 ms
[2021-05-12 09:14:20] [INFO ] Time to serialize properties into /tmp/LTL4715062230527708594.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/LTL6659459164816161591.gal, -t, CGAL, -LTL, /tmp/LTL4715062230527708594.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/LTL6659459164816161591.gal -t CGAL -LTL /tmp/LTL4715062230527708594.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gu1.p4<=gu1.p26)")&&(X(F("(gu3.p8<=gu3.p15)")))))))
Formula 0 simplified : !XX("(gu1.p4<=gu1.p26)" & XF"(gu3.p8<=gu3.p15)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15653964641362852988
[2021-05-12 09:14:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15653964641362852988
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/ltsmin15653964641362852988]
Compilation finished in 125 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15653964641362852988]
Link finished in 35 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(((LTLAPp0==true)&&X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15653964641362852988]
LTSmin run took 455 ms.
FORMULA HouseConstruction-PT-04000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-04000-09 finished in 32050 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(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 09:14:36] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 09:14:36] [INFO ] Implicit Places using invariants in 16 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 09:14:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:14:36] [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 09:14:36] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 09:14:36] [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 85 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-04000-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 s18), p0:(GT s13 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-12 finished in 143 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 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.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 13
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 19 transition count 7
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 21 place count 12 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 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 3 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
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 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 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 8 transition count 5
Applied a total of 27 rules in 147 ms. Remains 8 /25 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 09:14:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:14:36] [INFO ] Implicit Places using invariants in 19 ms returned [2, 3, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
[2021-05-12 09:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 09:14:36] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 5/25 places, 5/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 0 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 09:14:36] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:14:36] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 09:14:36] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 09:14:36] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-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 s1 s3)], 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 16000 steps with 0 reset in 13 ms.
FORMULA HouseConstruction-PT-04000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-13 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(((p1&&F((p2||G(p3))))||G(F((p2||G(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 8 place count 20 transition count 6
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 24 place count 11 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 422 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 09:14:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:14:36] [INFO ] Implicit Places using invariants in 8 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8 ms to find 1 implicit places.
[2021-05-12 09:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 09:14:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 4/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-12 09:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 09:14:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-04000-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s2), p3:(GT s2 s5), p2:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 147 steps with 10 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-15 finished in 540 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-12 09:14:37] [INFO ] Applying decomposition
[2021-05-12 09:14:37] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin3357896632433045976
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/graph14121502419874106944.txt, -o, /tmp/graph14121502419874106944.bin, -w, /tmp/graph14121502419874106944.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/graph14121502419874106944.bin, -l, -1, -v, -w, /tmp/graph14121502419874106944.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:14:37] [INFO ] Decomposing Gal with order
[2021-05-12 09:14:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:14:37] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 09:14:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:14:37] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 09:14:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:14:37] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 09:14:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:14:37] [INFO ] Flatten gal took : 3 ms
[2021-05-12 09:14:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3357896632433045976
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/ltsmin3357896632433045976]
[2021-05-12 09:14:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 09:14:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5699091836618199637.gal : 2 ms
[2021-05-12 09:14:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality703005047404854812.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/LTLCardinality5699091836618199637.gal, -t, CGAL, -LTL, /tmp/LTLCardinality703005047404854812.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/LTLCardinality5699091836618199637.gal -t CGAL -LTL /tmp/LTLCardinality703005047404854812.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(gi1.gi2.gu0.p5>=2)"))||(G(("(gi1.gi2.gu8.p4>=1)")||(F("(gu3.p27<=gu3.p9)")))))))
Formula 0 simplified : !F(G"(gi1.gi2.gu0.p5>=2)" | G("(gi1.gi2.gu8.p4>=1)" | F"(gu3.p27<=gu3.p9)"))
Compilation finished in 163 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3357896632433045976]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((!(LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3357896632433045976]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.160: LTL layer: formula: <>(([]((LTLAPp0==true))||[]((!(LTLAPp1==true)||<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 3/ 8), 0.160: "<>(([]((LTLAPp0==true))||[]((!(LTLAPp1==true)||<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.160: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.183: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.185: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.185: Initializing POR dependencies: labels 21, guards 18
pins2lts-mc-linux64( 0/ 8), 0.189: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.192: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.192: State length is 26, there are 28 groups
pins2lts-mc-linux64( 0/ 8), 0.192: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.192: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.192: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.192: Visible groups: 6 / 28, labels: 3 / 22
pins2lts-mc-linux64( 0/ 8), 0.192: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.192: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.269: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.294: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 3/ 8), 0.331: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.362: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 6/ 8), 0.393: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 2/ 8), 0.406: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 2/ 8), 0.431: [Blue] ~7680 levels ~61440 states ~90872 transitions
pins2lts-mc-linux64( 3/ 8), 0.523: [Blue] ~15360 levels ~122880 states ~243184 transitions
pins2lts-mc-linux64( 2/ 8), 0.669: [Blue] ~30720 levels ~245760 states ~535216 transitions
pins2lts-mc-linux64( 6/ 8), 0.859: [Blue] ~61440 levels ~491520 states ~1029536 transitions
pins2lts-mc-linux64( 6/ 8), 1.361: [Blue] ~72001 levels ~983040 states ~2099304 transitions
pins2lts-mc-linux64( 6/ 8), 2.639: [Blue] ~72001 levels ~1966080 states ~4457616 transitions
pins2lts-mc-linux64( 6/ 8), 5.643: [Blue] ~72001 levels ~3932160 states ~9304640 transitions
pins2lts-mc-linux64( 6/ 8), 11.746: [Blue] ~72001 levels ~7864320 states ~18909336 transitions
pins2lts-mc-linux64( 0/ 8), 23.118: [Blue] ~71977 levels ~15728640 states ~46409256 transitions
pins2lts-mc-linux64( 0/ 8), 45.648: [Blue] ~71977 levels ~31457280 states ~93347760 transitions
pins2lts-mc-linux64( 2/ 8), 95.762: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 95.794:
pins2lts-mc-linux64( 0/ 8), 95.794: Explored 52915388 states 146989638 transitions, fanout: 2.778
pins2lts-mc-linux64( 0/ 8), 95.794: Total exploration time 95.580 sec (95.530 sec minimum, 95.550 sec on average)
pins2lts-mc-linux64( 0/ 8), 95.794: States per second: 553624, Transitions per second: 1537870
pins2lts-mc-linux64( 0/ 8), 95.794:
pins2lts-mc-linux64( 0/ 8), 95.794: State space has 50632145 states, 12043219 are accepting
pins2lts-mc-linux64( 0/ 8), 95.794: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 95.794: blue states: 52915388 (104.51%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 95.794: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 95.794: all-red states: 25442276 (50.25%), bogus 937613 (1.85%)
pins2lts-mc-linux64( 0/ 8), 95.794:
pins2lts-mc-linux64( 0/ 8), 95.794: Total memory used for local state coloring: 7.6MB
pins2lts-mc-linux64( 0/ 8), 95.794:
pins2lts-mc-linux64( 0/ 8), 95.794: Queue width: 8B, total height: 495992, memory: 3.78MB
pins2lts-mc-linux64( 0/ 8), 95.794: Tree memory: 642.3MB, 13.3 B/state, compr.: 12.5%
pins2lts-mc-linux64( 0/ 8), 95.794: Tree fill ratio (roots/leafs): 37.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 95.794: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 95.794: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 95.794: Est. total memory use: 646.1MB (~1027.8MB 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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((!(LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3357896632433045976]
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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((!(LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3357896632433045976]
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 09:35:04] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:35:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality5542840113617675916.gal : 0 ms
[2021-05-12 09:35:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality8848277993196451975.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/LTLCardinality5542840113617675916.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8848277993196451975.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/LTLCardinality5542840113617675916.gal -t CGAL -LTL /tmp/LTLCardinality8848277993196451975.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p5>=2)"))||(G(("(p4>=1)")||(F("(p27<=p9)")))))))
Formula 0 simplified : !F(G"(p5>=2)" | G("(p4>=1)" | F"(p27<=p9)"))
Detected timeout of ITS tools.
[2021-05-12 09:55:32] [INFO ] Flatten gal took : 113 ms
[2021-05-12 09:55:32] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 09:55:32] [INFO ] Transformed 25 places.
[2021-05-12 09:55:32] [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 09:55:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality1319963354084131936.gal : 6 ms
[2021-05-12 09:55:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality7239198921930687414.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/LTLCardinality1319963354084131936.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7239198921930687414.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/LTLCardinality1319963354084131936.gal -t CGAL -LTL /tmp/LTLCardinality7239198921930687414.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 : !((F((G("(p5>=2)"))||(G(("(p4>=1)")||(F("(p27<=p9)")))))))
Formula 0 simplified : !F(G"(p5>=2)" | G("(p4>=1)" | F"(p27<=p9)"))

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

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