Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598000137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HouseConstruction-PT-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598000137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 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-02000-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716669326147

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-02000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 20:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 20:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:35:29] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-25 20:35:30] [INFO ] Transformed 26 places.
[2024-05-25 20:35:30] [INFO ] Transformed 18 transitions.
[2024-05-25 20:35:30] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-02000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 20 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:35:30] [INFO ] Computed 7 invariants in 9 ms
[2024-05-25 20:35:30] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-25 20:35:30] [INFO ] Invariant cache hit.
[2024-05-25 20:35:30] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-25 20:35:30] [INFO ] Invariant cache hit.
[2024-05-25 20:35:30] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2024-05-25 20:35:31] [INFO ] Flatten gal took : 34 ms
[2024-05-25 20:35:31] [INFO ] Flatten gal took : 11 ms
[2024-05-25 20:35:31] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=7 ) properties (out of 30) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 20:35:31] [INFO ] Invariant cache hit.
[2024-05-25 20:35:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 20:35:31] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 20:35:31] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 20:35:31] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-25 20:35:31] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 2 properties in 607 ms.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 18 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 18 transition count 8
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 12 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 8 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 2 with 3 rules applied. Total rules applied 33 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 5 transition count 3
Applied a total of 34 rules in 289 ms. Remains 5 /25 variables (removed 20) and now considering 3/18 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 5/25 places, 3/18 transitions.
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1334 )
Parikh walk visited 0 properties in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1||X(X(p1))||F(((p1&&X(F(p2)))||G(F(p2))))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:35:33] [INFO ] Invariant cache hit.
[2024-05-25 20:35:33] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 22/25 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 726 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s16 s8), p1:(GT s15 s7), p2:(GT 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 650 reset in 388 ms.
Product exploration explored 100000 steps with 641 reset in 295 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 2164 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42 steps, run visited all 1 properties in 12 ms. (steps per millisecond=3 )
Probabilistic random walk after 42 steps, saw 33 distinct states, run finished after 13 ms. (steps per millisecond=3 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 17 factoid took 2223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 20:35:39] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 20:35:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 20:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:35:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 20:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-25 20:35:39] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 20:35:39] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 17 transition count 10
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 15 place count 13 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 11 transition count 9
Applied a total of 18 rules in 71 ms. Remains 11 /22 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-25 20:35:39] [INFO ] Computed 2 invariants in 13 ms
[2024-05-25 20:35:39] [INFO ] Implicit Places using invariants in 44 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 10/22 places, 9/18 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Finished Best-First random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
// Phase 1: matrix 9 rows 10 cols
[2024-05-25 20:35:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 20:35:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 20:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 20:35:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:35:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 20:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 20:35:40] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:35:40] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 163 reset in 156 ms.
Product exploration explored 100000 steps with 168 reset in 233 ms.
Built C files in :
/tmp/ltsmin13997784002584717646
[2024-05-25 20:35:41] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-25 20:35:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:41] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-25 20:35:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:41] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-25 20:35:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13997784002584717646
Running compilation step : cd /tmp/ltsmin13997784002584717646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 346 ms.
Running link step : cd /tmp/ltsmin13997784002584717646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13997784002584717646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10345073266132578285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 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 10 transition count 6
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 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 6 transition count 4
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 10 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 4 transition count 4
Applied a total of 11 rules in 3 ms. Remains 4 /10 variables (removed 6) and now considering 4/9 (removed 5) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 20:35:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:35:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 20:35:56] [INFO ] Invariant cache hit.
[2024-05-25 20:35:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 20:35:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:35:56] [INFO ] Invariant cache hit.
[2024-05-25 20:35:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/10 places, 4/9 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 4/10 places, 4/9 transitions.
Built C files in :
/tmp/ltsmin14086836602240329582
[2024-05-25 20:35:56] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 20:35:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:56] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 20:35:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:56] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 20:35:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:35:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14086836602240329582
Running compilation step : cd /tmp/ltsmin14086836602240329582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin14086836602240329582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14086836602240329582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12449420992489325163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:36:11] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:36:11] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:36:11] [INFO ] Time to serialize gal into /tmp/LTL1754694458042614603.gal : 2 ms
[2024-05-25 20:36:11] [INFO ] Time to serialize properties into /tmp/LTL13927355442131681450.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1754694458042614603.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5630731629148766086.hoa' '-atoms' '/tmp/LTL13927355442131681450.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13927355442131681450.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5630731629148766086.hoa
Detected timeout of ITS tools.
[2024-05-25 20:36:26] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:36:26] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:36:26] [INFO ] Time to serialize gal into /tmp/LTL5773039262101137874.gal : 1 ms
[2024-05-25 20:36:26] [INFO ] Time to serialize properties into /tmp/LTL2816241280650642252.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5773039262101137874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2816241280650642252.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(p27>p8)")&&((("(p22>p11)")||(X(X("(p22>p11)"))))||(F((G(F("(p17<3)")))||(("(p22>p11)")&&(X(F("(p17<3)"))))))))))
Formula 0 simplified : G(!"(p27>p8)" | (!"(p22>p11)" & XX!"(p22>p11)" & G(FG!"(p17<3)" & (!"(p22>p11)" | XG!"(p17<3)"))))
Detected timeout of ITS tools.
[2024-05-25 20:36:41] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:36:41] [INFO ] Applying decomposition
[2024-05-25 20:36:41] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15988257967928583514.txt' '-o' '/tmp/graph15988257967928583514.bin' '-w' '/tmp/graph15988257967928583514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15988257967928583514.bin' '-l' '-1' '-v' '-w' '/tmp/graph15988257967928583514.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:36:41] [INFO ] Decomposing Gal with order
[2024-05-25 20:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:36:41] [INFO ] Flatten gal took : 53 ms
[2024-05-25 20:36:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 20:36:41] [INFO ] Time to serialize gal into /tmp/LTL11551419635745741544.gal : 2 ms
[2024-05-25 20:36:41] [INFO ] Time to serialize properties into /tmp/LTL13715808641908805505.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11551419635745741544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13715808641908805505.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gu2.p27>gu2.p8)")&&((("(gu1.p22>gu1.p11)")||(X(X("(gu1.p22>gu1.p11)"))))||(F((G(F("(gu3.p17<3)")))||(("(gu1.p22>gu1.p11)")&&(X...181
Formula 0 simplified : G(!"(gu2.p27>gu2.p8)" | (!"(gu1.p22>gu1.p11)" & XX!"(gu1.p22>gu1.p11)" & G(FG!"(gu3.p17<3)" & (!"(gu1.p22>gu1.p11)" | XG!"(gu3.p17<3...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2454446860572694532
[2024-05-25 20:36:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2454446860572694532
Running compilation step : cd /tmp/ltsmin2454446860572694532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin2454446860572694532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2454446860572694532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>(([](<>((LTLAPp2==true)))||((LTLAPp1==true)&&X(<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-02000-LTLCardinality-02 finished in 98645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p0)))&&(G(p0)||F(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 12 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 6 transition count 6
Applied a total of 12 rules in 9 ms. Remains 6 /25 variables (removed 19) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 20:37:11] [INFO ] Computed 0 invariants in 11 ms
[2024-05-25 20:37:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 20:37:11] [INFO ] Invariant cache hit.
[2024-05-25 20:37:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 20:37:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:37:12] [INFO ] Invariant cache hit.
[2024-05-25 20:37:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 6/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s5 s1), p1:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 441 reset in 114 ms.
Product exploration explored 100000 steps with 462 reset in 114 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 329 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 399 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2024-05-25 20:37:13] [INFO ] Invariant cache hit.
[2024-05-25 20:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:37:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 20:37:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:37:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 20:37:13] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:37:13] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 20:37:13] [INFO ] Invariant cache hit.
[2024-05-25 20:37:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 20:37:13] [INFO ] Invariant cache hit.
[2024-05-25 20:37:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 20:37:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:37:13] [INFO ] Invariant cache hit.
[2024-05-25 20:37:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-25 20:37:14] [INFO ] Invariant cache hit.
[2024-05-25 20:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:37:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:37:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:37:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:37:14] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 20:37:14] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 402 reset in 123 ms.
Product exploration explored 100000 steps with 364 reset in 161 ms.
Built C files in :
/tmp/ltsmin16905811155854649078
[2024-05-25 20:37:14] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:37:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:14] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:37:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:14] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:37:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16905811155854649078
Running compilation step : cd /tmp/ltsmin16905811155854649078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin16905811155854649078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16905811155854649078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18407219300304815621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 4
Applied a total of 4 rules in 2 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 20:37:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:37:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 20:37:29] [INFO ] Invariant cache hit.
[2024-05-25 20:37:29] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 20:37:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:37:29] [INFO ] Invariant cache hit.
[2024-05-25 20:37:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 4/6 places, 4/6 transitions.
Built C files in :
/tmp/ltsmin10032701063997491582
[2024-05-25 20:37:29] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 20:37:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:29] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 20:37:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:29] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 20:37:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:37:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10032701063997491582
Running compilation step : cd /tmp/ltsmin10032701063997491582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin10032701063997491582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10032701063997491582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17989177352080649386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:37:44] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:37:44] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:37:44] [INFO ] Time to serialize gal into /tmp/LTL13991143231467487086.gal : 1 ms
[2024-05-25 20:37:44] [INFO ] Time to serialize properties into /tmp/LTL14730451852201891060.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13991143231467487086.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18355941790097837124.hoa' '-atoms' '/tmp/LTL14730451852201891060.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14730451852201891060.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18355941790097837124.hoa
Detected timeout of ITS tools.
[2024-05-25 20:37:59] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:37:59] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:37:59] [INFO ] Time to serialize gal into /tmp/LTL8321856136314298902.gal : 1 ms
[2024-05-25 20:37:59] [INFO ] Time to serialize properties into /tmp/LTL14737176351515451598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8321856136314298902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14737176351515451598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(("(p18>p2)")||(X("(p18>p2)"))))&&((G("(p18>p2)"))||(F("(p5<1)")))))
Formula 0 simplified : G(!"(p18>p2)" & X!"(p18>p2)") | (F!"(p18>p2)" & G!"(p5<1)")
Detected timeout of ITS tools.
[2024-05-25 20:38:14] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:38:14] [INFO ] Applying decomposition
[2024-05-25 20:38:14] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18346400237978654178.txt' '-o' '/tmp/graph18346400237978654178.bin' '-w' '/tmp/graph18346400237978654178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18346400237978654178.bin' '-l' '-1' '-v' '-w' '/tmp/graph18346400237978654178.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:38:14] [INFO ] Decomposing Gal with order
[2024-05-25 20:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:38:14] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 20:38:14] [INFO ] Time to serialize gal into /tmp/LTL2377291147508469503.gal : 1 ms
[2024-05-25 20:38:14] [INFO ] Time to serialize properties into /tmp/LTL6550864169316631603.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2377291147508469503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6550864169316631603.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(("(gu1.p18>gu1.p2)")||(X("(gu1.p18>gu1.p2)"))))&&((G("(gu1.p18>gu1.p2)"))||(F("(gu0.p5<1)")))))
Formula 0 simplified : G(!"(gu1.p18>gu1.p2)" & X!"(gu1.p18>gu1.p2)") | (F!"(gu1.p18>gu1.p2)" & G!"(gu0.p5<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8535939879151503335
[2024-05-25 20:38:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8535939879151503335
Running compilation step : cd /tmp/ltsmin8535939879151503335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin8535939879151503335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8535939879151503335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||X((LTLAPp0==true))))&&([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-02000-LTLCardinality-03 finished in 93094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X((G(p2) U (p1&&G(p2)))))))))'
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 in SI_LTL mode, 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 9
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 14 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 13 transition count 8
Applied a total of 20 rules in 66 ms. Remains 13 /25 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-05-25 20:38:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 20:38:45] [INFO ] Implicit Places using invariants in 34 ms returned [1, 8, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s5), p1:(LEQ s2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3019 reset in 171 ms.
Product exploration explored 100000 steps with 3641 reset in 210 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2001 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 8 rows 10 cols
[2024-05-25 20:38:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 20:38:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-04 finished in 1899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1 U p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 17 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 13 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 194 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-25 20:38:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 20:38:47] [INFO ] Implicit Places using invariants in 36 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 11/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s4), p0:(OR (LEQ s8 s9) (LEQ s2 s7)), p1:(LEQ s2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 74 steps with 1 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-05 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(F(p0))||(!p0&&X(p1))))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:38:47] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 20:38:47] [INFO ] Implicit Places using invariants in 45 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s19 s16), p1:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 200 ms.
Product exploration explored 100000 steps with 2 reset in 345 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-06 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(p1)&&F((G(p2)||G(p3))))))'
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:48] [INFO ] Invariant cache hit.
[2024-05-25 20:38:48] [INFO ] Implicit Places using invariants in 54 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) p3 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s7 s3), p3:(LEQ s12 s11), p0:(LEQ s8 s15), p2:(LEQ s6 s15)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 167 steps with 51 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-07 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p0 U X((p1&&F(p2)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:48] [INFO ] Invariant cache hit.
[2024-05-25 20:38:48] [INFO ] Implicit Places using invariants in 49 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=6 dest: 0}, { cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(GT 2 s20), p1:(LEQ s3 s19), p2:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-08 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:49] [INFO ] Invariant cache hit.
[2024-05-25 20:38:49] [INFO ] Implicit Places using invariants in 47 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s1), p1:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-02000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-09 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U G(p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:49] [INFO ] Invariant cache hit.
[2024-05-25 20:38:49] [INFO ] Implicit Places using invariants in 52 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s21), p0:(LEQ s11 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13026 reset in 97 ms.
Product exploration explored 100000 steps with 9209 reset in 166 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 4) seen :0
Finished Best-First random walk after 105 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F p1)]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-11 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:50] [INFO ] Invariant cache hit.
[2024-05-25 20:38:50] [INFO ] Implicit Places using invariants in 49 ms returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(LEQ s12 s19), p0:(GT s3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-12 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(p1)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 20:38:51] [INFO ] Invariant cache hit.
[2024-05-25 20:38:51] [INFO ] Implicit Places using invariants in 39 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LEQ s5 s19) (GT s0 s9)), p1:(LEQ s8 s15)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 55 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), (X p0), true, (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) seen :0
Finished Best-First random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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
[2024-05-25 20:38:52] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 20:38:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 20:38:52] [INFO ] Invariant cache hit.
[2024-05-25 20:38:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-25 20:38:52] [INFO ] Invariant cache hit.
[2024-05-25 20:38:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [p1, true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 12 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 12 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 10 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 10 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 8 ms. Remains 10 /21 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2024-05-25 20:38:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2024-05-25 20:38:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 20:38:54] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 10/21 places, 9/18 transitions.
Built C files in :
/tmp/ltsmin15701175314569046094
[2024-05-25 20:38:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701175314569046094
Running compilation step : cd /tmp/ltsmin15701175314569046094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin15701175314569046094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15701175314569046094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6278295587408029768.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-02000-LTLCardinality-13 finished in 3843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p1 U G(!p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:38:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:38:54] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s11), p1:(GT s16 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 190 ms.
Product exploration explored 100000 steps with 2 reset in 324 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :4
Finished Best-First random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 20:38:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 20:38:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-14 finished in 2653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 20:38:57] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:38:57] [INFO ] Implicit Places using invariants in 28 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s16 s17), p1:(LEQ s9 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1199 reset in 111 ms.
Product exploration explored 100000 steps with 1221 reset in 199 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
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 (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 5) seen :0
Finished Best-First random walk after 5859 steps, including 1 resets, run visited all 5 properties in 7 ms. (steps per millisecond=837 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 493 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 11
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 11 transition count 8
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 8 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 6 transition count 6
Applied a total of 25 rules in 44 ms. Remains 6 /21 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 20:38:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 20:38:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 20:38:59] [INFO ] Invariant cache hit.
[2024-05-25 20:38:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 20:38:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:38:59] [INFO ] Invariant cache hit.
[2024-05-25 20:38:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 6/21 places, 6/18 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 11 factoid took 452 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25335 steps, run visited all 1 properties in 60 ms. (steps per millisecond=422 )
Probabilistic random walk after 25335 steps, saw 16665 distinct states, run finished after 60 ms. (steps per millisecond=422 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-25 20:39:00] [INFO ] Invariant cache hit.
[2024-05-25 20:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:39:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:39:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 20:39:00] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 20:39:00] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6313 reset in 65 ms.
Product exploration explored 100000 steps with 6216 reset in 78 ms.
Built C files in :
/tmp/ltsmin11295573040406936127
[2024-05-25 20:39:00] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:39:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:00] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:39:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:00] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:39:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11295573040406936127
Running compilation step : cd /tmp/ltsmin11295573040406936127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin11295573040406936127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11295573040406936127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13610020373642901453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 42 ms. Remains 3 /6 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 20:39:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 20:39:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 20:39:16] [INFO ] Invariant cache hit.
[2024-05-25 20:39:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 20:39:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:39:16] [INFO ] Invariant cache hit.
[2024-05-25 20:39:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/6 places, 3/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 3/6 places, 3/6 transitions.
Built C files in :
/tmp/ltsmin2036819166363690765
[2024-05-25 20:39:16] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2024-05-25 20:39:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:16] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2024-05-25 20:39:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:16] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2024-05-25 20:39:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:39:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2036819166363690765
Running compilation step : cd /tmp/ltsmin2036819166363690765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin2036819166363690765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2036819166363690765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased578496309580582776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:39:31] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:39:31] [INFO ] Flatten gal took : 0 ms
[2024-05-25 20:39:31] [INFO ] Time to serialize gal into /tmp/LTL12409642765185961082.gal : 1 ms
[2024-05-25 20:39:31] [INFO ] Time to serialize properties into /tmp/LTL18190821564327658429.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12409642765185961082.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7222292189226943608.hoa' '-atoms' '/tmp/LTL18190821564327658429.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18190821564327658429.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7222292189226943608.hoa
Detected timeout of ITS tools.
[2024-05-25 20:39:46] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:39:46] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:39:46] [INFO ] Time to serialize gal into /tmp/LTL10340538878049486066.gal : 0 ms
[2024-05-25 20:39:46] [INFO ] Time to serialize properties into /tmp/LTL11122200723443908952.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10340538878049486066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11122200723443908952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(p26>p21)"))||(X(G("(p9<=p18)")))))
Formula 0 simplified : G!"(p26>p21)" & XF!"(p9<=p18)"
Detected timeout of ITS tools.
[2024-05-25 20:40:01] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:40:01] [INFO ] Applying decomposition
[2024-05-25 20:40:01] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph144330486868976441.txt' '-o' '/tmp/graph144330486868976441.bin' '-w' '/tmp/graph144330486868976441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph144330486868976441.bin' '-l' '-1' '-v' '-w' '/tmp/graph144330486868976441.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:40:01] [INFO ] Decomposing Gal with order
[2024-05-25 20:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:40:01] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 20:40:01] [INFO ] Time to serialize gal into /tmp/LTL49367504126050181.gal : 1 ms
[2024-05-25 20:40:01] [INFO ] Time to serialize properties into /tmp/LTL12983844317668554820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL49367504126050181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12983844317668554820.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(gu1.p26>gu1.p21)"))||(X(G("(gu0.p9<=gu0.p18)")))))
Formula 0 simplified : G!"(gu1.p26>gu1.p21)" & XF!"(gu0.p9<=gu0.p18)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17272488157682851722
[2024-05-25 20:40:16] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17272488157682851722
Running compilation step : cd /tmp/ltsmin17272488157682851722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin17272488157682851722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17272488157682851722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-02000-LTLCardinality-15 finished in 94089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1||X(X(p1))||F(((p1&&X(F(p2)))||G(F(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p0)))&&(G(p0)||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : HouseConstruction-PT-02000-LTLCardinality-15
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 19 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 16 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 13 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 12 transition count 6
Applied a total of 22 rules in 314 ms. Remains 12 /25 variables (removed 13) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 12 cols
[2024-05-25 20:40:32] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 20:40:32] [INFO ] Implicit Places using invariants in 50 ms returned [1, 2, 3, 6, 8, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/25 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 367 ms. Remains : 6/25 places, 6/18 transitions.
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s4 s5), p1:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6234 reset in 114 ms.
Product exploration explored 100000 steps with 6278 reset in 139 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12 steps, run visited all 1 properties in 6 ms. (steps per millisecond=2 )
Probabilistic random walk after 12 steps, saw 10 distinct states, run finished after 6 ms. (steps per millisecond=2 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 20:40:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:40:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 20:40:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:40:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 20:40:33] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 20:40:33] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 20:40:33] [INFO ] Invariant cache hit.
[2024-05-25 20:40:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 20:40:33] [INFO ] Invariant cache hit.
[2024-05-25 20:40:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-25 20:40:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:40:33] [INFO ] Invariant cache hit.
[2024-05-25 20:40:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12 steps, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Probabilistic random walk after 12 steps, saw 10 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-05-25 20:40:34] [INFO ] Invariant cache hit.
[2024-05-25 20:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:40:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 20:40:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:40:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 20:40:34] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 20:40:34] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6238 reset in 66 ms.
Product exploration explored 100000 steps with 6081 reset in 79 ms.
Built C files in :
/tmp/ltsmin13168289959830675758
[2024-05-25 20:40:34] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 20:40:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:34] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 20:40:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:34] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 20:40:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13168289959830675758
Running compilation step : cd /tmp/ltsmin13168289959830675758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin13168289959830675758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13168289959830675758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10730483003622314828.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 41 ms. Remains 3 /6 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 20:40:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 20:40:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 20:40:49] [INFO ] Invariant cache hit.
[2024-05-25 20:40:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 20:40:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 20:40:49] [INFO ] Invariant cache hit.
[2024-05-25 20:40:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/6 places, 3/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 3/6 places, 3/6 transitions.
Built C files in :
/tmp/ltsmin13694038254250862257
[2024-05-25 20:40:49] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2024-05-25 20:40:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:49] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2024-05-25 20:40:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:49] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2024-05-25 20:40:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:40:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13694038254250862257
Running compilation step : cd /tmp/ltsmin13694038254250862257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin13694038254250862257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13694038254250862257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16823776558002657328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:41:04] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:41:04] [INFO ] Flatten gal took : 0 ms
[2024-05-25 20:41:04] [INFO ] Time to serialize gal into /tmp/LTL11334580952939750057.gal : 0 ms
[2024-05-25 20:41:04] [INFO ] Time to serialize properties into /tmp/LTL11190998454679068860.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11334580952939750057.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15697572455160388826.hoa' '-atoms' '/tmp/LTL11190998454679068860.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11190998454679068860.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15697572455160388826.hoa
Detected timeout of ITS tools.
[2024-05-25 20:41:19] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:41:19] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:41:19] [INFO ] Time to serialize gal into /tmp/LTL3716709597749902528.gal : 0 ms
[2024-05-25 20:41:19] [INFO ] Time to serialize properties into /tmp/LTL12444983127680579929.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3716709597749902528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12444983127680579929.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p26>p21)"))||(X(G("(p9<=p18)")))))
Formula 0 simplified : G!"(p26>p21)" & XF!"(p9<=p18)"
Detected timeout of ITS tools.
[2024-05-25 20:41:34] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:41:34] [INFO ] Applying decomposition
[2024-05-25 20:41:34] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8625271035455990484.txt' '-o' '/tmp/graph8625271035455990484.bin' '-w' '/tmp/graph8625271035455990484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8625271035455990484.bin' '-l' '-1' '-v' '-w' '/tmp/graph8625271035455990484.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:41:34] [INFO ] Decomposing Gal with order
[2024-05-25 20:41:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:41:34] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 20:41:34] [INFO ] Time to serialize gal into /tmp/LTL10667642402249491647.gal : 0 ms
[2024-05-25 20:41:34] [INFO ] Time to serialize properties into /tmp/LTL13693538541748164194.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10667642402249491647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13693538541748164194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(gu1.p26>gu1.p21)"))||(X(G("(gu0.p9<=gu0.p18)")))))
Formula 0 simplified : G!"(gu1.p26>gu1.p21)" & XF!"(gu0.p9<=gu0.p18)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11410500220228393850
[2024-05-25 20:41:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11410500220228393850
Running compilation step : cd /tmp/ltsmin11410500220228393850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin11410500220228393850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11410500220228393850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-02000-LTLCardinality-15 finished in 93036 ms.
[2024-05-25 20:42:04] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin502080940611841880
[2024-05-25 20:42:04] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 20:42:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:42:04] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 20:42:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:42:04] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 20:42:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:42:04] [INFO ] Applying decomposition
[2024-05-25 20:42:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin502080940611841880
Running compilation step : cd /tmp/ltsmin502080940611841880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 20:42:04] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2404987520699254910.txt' '-o' '/tmp/graph2404987520699254910.bin' '-w' '/tmp/graph2404987520699254910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2404987520699254910.bin' '-l' '-1' '-v' '-w' '/tmp/graph2404987520699254910.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:42:04] [INFO ] Decomposing Gal with order
[2024-05-25 20:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:42:04] [INFO ] Flatten gal took : 4 ms
[2024-05-25 20:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 20:42:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality12297153563795067118.gal : 1 ms
[2024-05-25 20:42:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality6075357829858549871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12297153563795067118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6075357829858549871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(("(gu5.p27>gu5.p8)")&&((("(gu4.p22>gu4.p11)")||(X(X("(gu4.p22>gu4.p11)"))))||(F((("(gu4.p22>gu4.p11)")&&(X(F("(gi0.gi1.gu2.p17<3)...197
Formula 0 simplified : G(!"(gu5.p27>gu5.p8)" | (!"(gu4.p22>gu4.p11)" & XX!"(gu4.p22>gu4.p11)" & G(FG!"(gi0.gi1.gu2.p17<3)" & (!"(gu4.p22>gu4.p11)" | XG!"(g...177
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin502080940611841880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin502080940611841880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: <>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: "<>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 26
pins2lts-mc-linux64( 0/ 8), 0.067: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 26, there are 47 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.154: ~120 levels ~960 states ~8704 transitions
pins2lts-mc-linux64( 5/ 8), 0.303: ~240 levels ~1920 states ~20792 transitions
pins2lts-mc-linux64( 5/ 8), 0.571: ~463 levels ~3840 states ~43864 transitions
pins2lts-mc-linux64( 5/ 8), 1.056: ~914 levels ~7680 states ~92664 transitions
pins2lts-mc-linux64( 2/ 8), 1.627: ~1827 levels ~15360 states ~195416 transitions
pins2lts-mc-linux64( 2/ 8), 2.356: ~3726 levels ~30720 states ~439928 transitions
pins2lts-mc-linux64( 2/ 8), 3.096: ~7566 levels ~61440 states ~947376 transitions
pins2lts-mc-linux64( 5/ 8), 3.648: ~15139 levels ~122880 states ~1991376 transitions
pins2lts-mc-linux64( 5/ 8), 4.483: ~30389 levels ~245760 states ~4078824 transitions
pins2lts-mc-linux64( 5/ 8), 4.957: ~35984 levels ~491520 states ~5076800 transitions
pins2lts-mc-linux64( 5/ 8), 5.672: ~35984 levels ~983040 states ~6078688 transitions
pins2lts-mc-linux64( 1/ 8), 6.793: ~35928 levels ~1966080 states ~7568872 transitions
pins2lts-mc-linux64( 1/ 8), 9.160: ~35944 levels ~3932160 states ~11188216 transitions
pins2lts-mc-linux64( 4/ 8), 14.407: ~35984 levels ~7864320 states ~18304648 transitions
pins2lts-mc-linux64( 4/ 8), 24.887: ~35984 levels ~15728640 states ~34105000 transitions
pins2lts-mc-linux64( 4/ 8), 48.562: ~35984 levels ~31457280 states ~65911672 transitions
pins2lts-mc-linux64( 7/ 8), 68.204: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 68.324:
pins2lts-mc-linux64( 0/ 8), 68.324: mean standard work distribution: 11.8% (states) 7.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 68.324:
pins2lts-mc-linux64( 0/ 8), 68.324: Explored 34240814 states 87703327 transitions, fanout: 2.561
pins2lts-mc-linux64( 0/ 8), 68.324: Total exploration time 68.230 sec (68.110 sec minimum, 68.156 sec on average)
pins2lts-mc-linux64( 0/ 8), 68.324: States per second: 501844, Transitions per second: 1285407
pins2lts-mc-linux64( 0/ 8), 68.324:
pins2lts-mc-linux64( 0/ 8), 68.324: Progress states detected: 893
pins2lts-mc-linux64( 0/ 8), 68.324: Redundant explorations: -11.5830
pins2lts-mc-linux64( 0/ 8), 68.324:
pins2lts-mc-linux64( 0/ 8), 68.324: Queue width: 8B, total height: 287879, memory: 2.20MB
pins2lts-mc-linux64( 0/ 8), 68.324: Tree memory: 551.5MB, 14.9 B/state, compr.: 14.1%
pins2lts-mc-linux64( 0/ 8), 68.324: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 68.324: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 68.325: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 68.325: Est. total memory use: 553.7MB (~1026.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin502080940611841880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin502080940611841880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&((LTLAPp1==true)||X(X((LTLAPp1==true)))||<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 21:04:18] [INFO ] Flatten gal took : 266 ms
[2024-05-25 21:04:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality11909198961034275731.gal : 319 ms
[2024-05-25 21:04:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality9982481600893900073.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11909198961034275731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9982481600893900073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(("(p27>p8)")&&((("(p22>p11)")||(X(X("(p22>p11)"))))||(F((("(p22>p11)")&&(X(F("(p17<3)"))))||(G(F("(p17<3)")))))))))
Formula 0 simplified : G(!"(p27>p8)" | (!"(p22>p11)" & XX!"(p22>p11)" & G(FG!"(p17<3)" & (!"(p22>p11)" | XG!"(p17<3)"))))
Detected timeout of ITS tools.
[2024-05-25 21:26:32] [INFO ] Flatten gal took : 377 ms
[2024-05-25 21:26:33] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 21:26:33] [INFO ] Transformed 25 places.
[2024-05-25 21:26:34] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 21:26:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality14243290435855804399.gal : 6 ms
[2024-05-25 21:26:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality15749628794984650030.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14243290435855804399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15749628794984650030.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(p27>p8)")&&((("(p22>p11)")||(X(X("(p22>p11)"))))||(F((("(p22>p11)")&&(X(F("(p17<3)"))))||(G(F("(p17<3)")))))))))
Formula 0 simplified : G(!"(p27>p8)" | (!"(p22>p11)" & XX!"(p22>p11)" & G(FG!"(p17<3)" & (!"(p22>p11)" | XG!"(p17<3)"))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8365728 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15998016 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-02000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HouseConstruction-PT-02000, 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 r219-smll-171649598000137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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