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-171649597800058.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 HirschbergSinclair-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716641630417

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:53:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 12:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:53:53] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-25 12:53:53] [INFO ] Transformed 600 places.
[2024-05-25 12:53:53] [INFO ] Transformed 545 transitions.
[2024-05-25 12:53:53] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 47 place count 553 transition count 523
Iterating global reduction 1 with 22 rules applied. Total rules applied 69 place count 553 transition count 523
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 87 place count 535 transition count 505
Iterating global reduction 1 with 18 rules applied. Total rules applied 105 place count 535 transition count 505
Applied a total of 105 rules in 172 ms. Remains 535 /600 variables (removed 65) and now considering 505/545 (removed 40) transitions.
// Phase 1: matrix 505 rows 535 cols
[2024-05-25 12:53:53] [INFO ] Computed 30 invariants in 36 ms
[2024-05-25 12:53:54] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-25 12:53:54] [INFO ] Invariant cache hit.
[2024-05-25 12:53:55] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-25 12:53:55] [INFO ] Invariant cache hit.
[2024-05-25 12:53:56] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 535/600 places, 505/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3091 ms. Remains : 535/600 places, 505/545 transitions.
Support contains 43 out of 535 places after structural reductions.
[2024-05-25 12:53:56] [INFO ] Flatten gal took : 152 ms
[2024-05-25 12:53:57] [INFO ] Flatten gal took : 65 ms
[2024-05-25 12:53:57] [INFO ] Input system was already deterministic with 505 transitions.
Support contains 42 out of 535 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:53:57] [INFO ] Invariant cache hit.
[2024-05-25 12:53:58] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 86 ms returned sat
[2024-05-25 12:53:58] [INFO ] After 356ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 12:53:58] [INFO ] After 534ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-25 12:53:58] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 505/505 transitions.
Graph (complete) has 1012 edges and 535 vertex of which 517 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 517 transition count 278
Reduce places removed 209 places and 0 transitions.
Graph (complete) has 536 edges and 308 vertex of which 269 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 210 rules applied. Total rules applied 438 place count 269 transition count 278
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 477 place count 269 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 482 place count 264 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 264 transition count 234
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 491 place count 264 transition count 230
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 446 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 496 place count 254 transition count 230
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 502 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 503 place count 253 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 504 place count 253 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 511 place count 253 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 518 place count 246 transition count 216
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 541 place count 223 transition count 193
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 123 rules applied. Total rules applied 664 place count 205 transition count 88
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 8 with 105 rules applied. Total rules applied 769 place count 100 transition count 88
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 769 place count 100 transition count 74
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 797 place count 86 transition count 74
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 798 place count 85 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 798 place count 85 transition count 73
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 800 place count 84 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 806 place count 81 transition count 70
Applied a total of 806 rules in 110 ms. Remains 81 /535 variables (removed 454) and now considering 70/505 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 81/535 places, 70/505 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Probably explored full state space saw : 3652 states, properties seen :1
Probabilistic random walk after 13782 steps, saw 3652 distinct states, run finished after 63 ms. (steps per millisecond=218 ) properties seen :1
Explored full state space saw : 3652 states, properties seen :0
Exhaustive walk after 13782 steps, saw 3652 distinct states, run finished after 32 ms. (steps per millisecond=430 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 535 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 535 transition count 505
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 U (G(!p1)||(G(p3)&&p2)))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 511 transition count 276
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 300 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 300 transition count 270
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 425 place count 300 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 428 place count 297 transition count 267
Applied a total of 428 rules in 50 ms. Remains 297 /535 variables (removed 238) and now considering 267/505 (removed 238) transitions.
// Phase 1: matrix 267 rows 297 cols
[2024-05-25 12:53:59] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 12:54:00] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-25 12:54:00] [INFO ] Invariant cache hit.
[2024-05-25 12:54:00] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2024-05-25 12:54:00] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-25 12:54:00] [INFO ] Invariant cache hit.
[2024-05-25 12:54:01] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/535 places, 267/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1657 ms. Remains : 297/535 places, 267/505 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 330 ms :[(NOT p0), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s67 1) (GEQ s178 1)), p2:(AND (LT s178 1) (NOT (AND (GEQ s25 1) (GEQ s78 1)))), p1:(AND (GEQ s25 1) (GEQ s78 1)), p3:(LT s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 583 steps with 1 reset in 17 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 2075 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||F(p1)) U (p2||X(p0))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 51 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:54:01] [INFO ] Computed 30 invariants in 6 ms
[2024-05-25 12:54:02] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-25 12:54:02] [INFO ] Invariant cache hit.
[2024-05-25 12:54:04] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
[2024-05-25 12:54:04] [INFO ] Invariant cache hit.
[2024-05-25 12:54:04] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2871 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s478 1), p0:(AND (GEQ s41 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s268 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 354 reset in 441 ms.
Product exploration explored 100000 steps with 355 reset in 450 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 277 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 909 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-05-25 12:54:07] [INFO ] Invariant cache hit.
[2024-05-25 12:54:08] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 95 ms returned sat
[2024-05-25 12:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:13] [INFO ] [Real]Absence check using state equation in 5033 ms returned sat
[2024-05-25 12:54:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:54:13] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 131 ms returned sat
[2024-05-25 12:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:16] [INFO ] [Nat]Absence check using state equation in 2953 ms returned sat
[2024-05-25 12:54:16] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 42 ms.
[2024-05-25 12:54:20] [INFO ] Added : 207 causal constraints over 42 iterations in 3227 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-25 12:54:20] [INFO ] Invariant cache hit.
[2024-05-25 12:54:20] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 118 ms returned sat
[2024-05-25 12:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:29] [INFO ] [Real]Absence check using state equation in 8608 ms returned sat
[2024-05-25 12:54:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:54:29] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 144 ms returned sat
[2024-05-25 12:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:34] [INFO ] [Nat]Absence check using state equation in 4167 ms returned sat
[2024-05-25 12:54:34] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 39 ms.
[2024-05-25 12:54:42] [INFO ] Added : 186 causal constraints over 38 iterations in 8692 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 15 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-05-25 12:54:42] [INFO ] Invariant cache hit.
[2024-05-25 12:54:43] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-25 12:54:43] [INFO ] Invariant cache hit.
[2024-05-25 12:54:45] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
[2024-05-25 12:54:45] [INFO ] Invariant cache hit.
[2024-05-25 12:54:45] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2945 ms. Remains : 526/526 places, 496/496 transitions.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 406 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 275 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 911 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2024-05-25 12:54:47] [INFO ] Invariant cache hit.
[2024-05-25 12:54:48] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 95 ms returned sat
[2024-05-25 12:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:53] [INFO ] [Real]Absence check using state equation in 4943 ms returned sat
[2024-05-25 12:54:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:54:53] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 123 ms returned sat
[2024-05-25 12:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:56] [INFO ] [Nat]Absence check using state equation in 2870 ms returned sat
[2024-05-25 12:54:56] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 37 ms.
[2024-05-25 12:54:59] [INFO ] Added : 207 causal constraints over 42 iterations in 3036 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-25 12:54:59] [INFO ] Invariant cache hit.
[2024-05-25 12:55:00] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 119 ms returned sat
[2024-05-25 12:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:55:08] [INFO ] [Real]Absence check using state equation in 8627 ms returned sat
[2024-05-25 12:55:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:55:09] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 142 ms returned sat
[2024-05-25 12:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:55:13] [INFO ] [Nat]Absence check using state equation in 4146 ms returned sat
[2024-05-25 12:55:13] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 45 ms.
[2024-05-25 12:55:22] [INFO ] Added : 186 causal constraints over 38 iterations in 8635 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 302 ms.
Product exploration explored 100000 steps with 355 reset in 333 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 526 transition count 496
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 196 rules in 64 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-05-25 12:55:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:55:23] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 12:55:23] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/526 places, 496/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 503 ms. Remains : 526/526 places, 496/496 transitions.
Built C files in :
/tmp/ltsmin429656993827130865
[2024-05-25 12:55:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin429656993827130865
Running compilation step : cd /tmp/ltsmin429656993827130865;'/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 1322 ms.
Running link step : cd /tmp/ltsmin429656993827130865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin429656993827130865;'/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/stateBased12089115224004509987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 15 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:55:39] [INFO ] Computed 30 invariants in 5 ms
[2024-05-25 12:55:39] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-25 12:55:39] [INFO ] Invariant cache hit.
[2024-05-25 12:55:41] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
[2024-05-25 12:55:41] [INFO ] Invariant cache hit.
[2024-05-25 12:55:41] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2725 ms. Remains : 526/526 places, 496/496 transitions.
Built C files in :
/tmp/ltsmin1315398372093092230
[2024-05-25 12:55:41] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1315398372093092230
Running compilation step : cd /tmp/ltsmin1315398372093092230;'/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 1162 ms.
Running link step : cd /tmp/ltsmin1315398372093092230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1315398372093092230;'/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/stateBased1474121111471631883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 12:55:57] [INFO ] Flatten gal took : 40 ms
[2024-05-25 12:55:57] [INFO ] Flatten gal took : 38 ms
[2024-05-25 12:55:57] [INFO ] Time to serialize gal into /tmp/LTL2151468394608301824.gal : 8 ms
[2024-05-25 12:55:57] [INFO ] Time to serialize properties into /tmp/LTL10936573340533930705.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/LTL2151468394608301824.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17159259011989025218.hoa' '-atoms' '/tmp/LTL10936573340533930705.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/LTL10936573340533930705.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17159259011989025218.hoa
Detected timeout of ITS tools.
[2024-05-25 12:56:12] [INFO ] Flatten gal took : 29 ms
[2024-05-25 12:56:12] [INFO ] Flatten gal took : 29 ms
[2024-05-25 12:56:12] [INFO ] Time to serialize gal into /tmp/LTL1487636208305877176.gal : 6 ms
[2024-05-25 12:56:12] [INFO ] Time to serialize properties into /tmp/LTL12137345519791856332.ltl : 2 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/LTL1487636208305877176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12137345519791856332.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("((newmsg1>=1)&&(reply_25_3_to_left_2>=1))"))||("((newmsg21>=1)&&(reply_21_0_to_right_20>=1))"))U(("(rcv_left_election_25_5_13_...219
Formula 0 simplified : (!"((newmsg21>=1)&&(reply_21_0_to_right_20>=1))" & G!"((newmsg1>=1)&&(reply_25_3_to_left_2>=1))") R (!"(rcv_left_election_25_5_13_13...212
Detected timeout of ITS tools.
[2024-05-25 12:56:27] [INFO ] Flatten gal took : 28 ms
[2024-05-25 12:56:27] [INFO ] Applying decomposition
[2024-05-25 12:56:27] [INFO ] Flatten gal took : 28 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/graph12054580644699111044.txt' '-o' '/tmp/graph12054580644699111044.bin' '-w' '/tmp/graph12054580644699111044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12054580644699111044.bin' '-l' '-1' '-v' '-w' '/tmp/graph12054580644699111044.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:56:27] [INFO ] Decomposing Gal with order
[2024-05-25 12:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:56:27] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-25 12:56:27] [INFO ] Flatten gal took : 110 ms
[2024-05-25 12:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-25 12:56:27] [INFO ] Time to serialize gal into /tmp/LTL5504756947541820181.gal : 12 ms
[2024-05-25 12:56:27] [INFO ] Time to serialize properties into /tmp/LTL14575625395345867192.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/LTL5504756947541820181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14575625395345867192.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((((F("((i0.u21.newmsg1>=1)&&(i0.u0.reply_25_3_to_left_2>=1))"))||("((i5.u16.newmsg21>=1)&&(i4.i1.u27.reply_21_0_to_right_20>=1))"))U...272
Formula 0 simplified : (!"((i5.u16.newmsg21>=1)&&(i4.i1.u27.reply_21_0_to_right_20>=1))" & G!"((i0.u21.newmsg1>=1)&&(i0.u0.reply_25_3_to_left_2>=1))") R (!...265
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12846559805380363834
[2024-05-25 12:56:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12846559805380363834
Running compilation step : cd /tmp/ltsmin12846559805380363834;'/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 1149 ms.
Running link step : cd /tmp/ltsmin12846559805380363834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12846559805380363834;'/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)) U ((LTLAPp2==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-01 finished in 176192 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))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 511 transition count 270
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 300 transition count 270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 429 place count 293 transition count 263
Iterating global reduction 2 with 7 rules applied. Total rules applied 436 place count 293 transition count 263
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 440 place count 293 transition count 259
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 444 place count 289 transition count 259
Applied a total of 444 rules in 41 ms. Remains 289 /535 variables (removed 246) and now considering 259/505 (removed 246) transitions.
// Phase 1: matrix 259 rows 289 cols
[2024-05-25 12:56:57] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 12:56:58] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-25 12:56:58] [INFO ] Invariant cache hit.
[2024-05-25 12:56:58] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2024-05-25 12:56:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 12:56:58] [INFO ] Invariant cache hit.
[2024-05-25 12:56:59] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/535 places, 259/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1358 ms. Remains : 289/535 places, 259/505 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 366 reset in 212 ms.
Product exploration explored 100000 steps with 366 reset in 366 ms.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
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 95 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 38 ms :[(NOT p0)]
Finished random walk after 282 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
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 115 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 35 ms :[(NOT p0)]
[2024-05-25 12:57:00] [INFO ] Invariant cache hit.
[2024-05-25 12:57:00] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 58 ms returned sat
[2024-05-25 12:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:57:02] [INFO ] [Real]Absence check using state equation in 2181 ms returned sat
[2024-05-25 12:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:57:03] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 86 ms returned sat
[2024-05-25 12:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:57:03] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2024-05-25 12:57:03] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-25 12:57:05] [INFO ] Added : 186 causal constraints over 38 iterations in 1788 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 14 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-25 12:57:05] [INFO ] Invariant cache hit.
[2024-05-25 12:57:06] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-25 12:57:06] [INFO ] Invariant cache hit.
[2024-05-25 12:57:06] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-25 12:57:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 12:57:06] [INFO ] Invariant cache hit.
[2024-05-25 12:57:07] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1496 ms. Remains : 289/289 places, 259/259 transitions.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
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 277 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 35 ms :[(NOT p0)]
Finished random walk after 283 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
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 111 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 12:57:07] [INFO ] Invariant cache hit.
[2024-05-25 12:57:08] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 56 ms returned sat
[2024-05-25 12:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:57:10] [INFO ] [Real]Absence check using state equation in 2165 ms returned sat
[2024-05-25 12:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:57:10] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 84 ms returned sat
[2024-05-25 12:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:57:11] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-05-25 12:57:11] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 16 ms.
[2024-05-25 12:57:13] [INFO ] Added : 186 causal constraints over 38 iterations in 1750 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 365 reset in 215 ms.
Product exploration explored 100000 steps with 366 reset in 253 ms.
Built C files in :
/tmp/ltsmin5651209200402749495
[2024-05-25 12:57:13] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-25 12:57:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:13] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-25 12:57:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:13] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-25 12:57:13] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:13] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5651209200402749495
Running compilation step : cd /tmp/ltsmin5651209200402749495;'/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 742 ms.
Running link step : cd /tmp/ltsmin5651209200402749495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5651209200402749495;'/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/stateBased4349585342992819377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 16 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-25 12:57:28] [INFO ] Invariant cache hit.
[2024-05-25 12:57:29] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-25 12:57:29] [INFO ] Invariant cache hit.
[2024-05-25 12:57:29] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-25 12:57:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:57:29] [INFO ] Invariant cache hit.
[2024-05-25 12:57:30] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1371 ms. Remains : 289/289 places, 259/259 transitions.
Built C files in :
/tmp/ltsmin2338770729243254901
[2024-05-25 12:57:30] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-25 12:57:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:30] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-25 12:57:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:30] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-25 12:57:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:57:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2338770729243254901
Running compilation step : cd /tmp/ltsmin2338770729243254901;'/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 725 ms.
Running link step : cd /tmp/ltsmin2338770729243254901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2338770729243254901;'/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/stateBased15496805048420598595.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 12:57:45] [INFO ] Flatten gal took : 12 ms
[2024-05-25 12:57:45] [INFO ] Flatten gal took : 11 ms
[2024-05-25 12:57:45] [INFO ] Time to serialize gal into /tmp/LTL8165316242513772987.gal : 2 ms
[2024-05-25 12:57:45] [INFO ] Time to serialize properties into /tmp/LTL4002809596644612982.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/LTL8165316242513772987.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7633885271595736722.hoa' '-atoms' '/tmp/LTL4002809596644612982.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...317
Loading property file /tmp/LTL4002809596644612982.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7633885271595736722.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t60, t61.t62, t63...417
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:58:00] [INFO ] Flatten gal took : 10 ms
[2024-05-25 12:58:00] [INFO ] Flatten gal took : 9 ms
[2024-05-25 12:58:00] [INFO ] Time to serialize gal into /tmp/LTL2469385574641605892.gal : 2 ms
[2024-05-25 12:58:00] [INFO ] Time to serialize properties into /tmp/LTL3312194096215282057.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/LTL2469385574641605892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3312194096215282057.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("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t60, t61.t62, t63...417
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:58:15] [INFO ] Flatten gal took : 10 ms
[2024-05-25 12:58:15] [INFO ] Applying decomposition
[2024-05-25 12:58:15] [INFO ] Flatten gal took : 9 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/graph7864684881014153806.txt' '-o' '/tmp/graph7864684881014153806.bin' '-w' '/tmp/graph7864684881014153806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7864684881014153806.bin' '-l' '-1' '-v' '-w' '/tmp/graph7864684881014153806.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:58:15] [INFO ] Decomposing Gal with order
[2024-05-25 12:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:58:15] [INFO ] Removed a total of 165 redundant transitions.
[2024-05-25 12:58:15] [INFO ] Flatten gal took : 33 ms
[2024-05-25 12:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2024-05-25 12:58:15] [INFO ] Time to serialize gal into /tmp/LTL648279799342738842.gal : 5 ms
[2024-05-25 12:58:15] [INFO ] Time to serialize properties into /tmp/LTL6408513369739017281.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/LTL648279799342738842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6408513369739017281.ltl' '-c' '-stutter-deadlock'

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...253
Read 1 LTL properties
Checking formula 0 : !((F("((i0.u0.newmsg10>=1)&&(i7.i7.u110.elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((i0.u0.newmsg10>=1)&&(i7.i7.u110.elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t31_t32, t63_t64, t84_t85, t96_t97, t104_t105, t124_t125, t233_t234, t477_t478, i0.t66, i0.t5...489
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8841674921235175483
[2024-05-25 12:58:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8841674921235175483
Running compilation step : cd /tmp/ltsmin8841674921235175483;'/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 606 ms.
Running link step : cd /tmp/ltsmin8841674921235175483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8841674921235175483;'/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))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 107891 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(G((X(X((p0&&X(p1))))||G(p2)))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 39 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 12:58:45] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 12:58:46] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-25 12:58:46] [INFO ] Invariant cache hit.
[2024-05-25 12:58:48] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2024-05-25 12:58:48] [INFO ] Invariant cache hit.
[2024-05-25 12:58:48] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2775 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p2 p0), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 5}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=9 dest: 8}]], initial=0, aps=[p2:(GEQ s83 1), p0:(LT s240 1), p1:(LT s348 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16690 reset in 414 ms.
Product exploration explored 100000 steps with 16667 reset in 440 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
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 p2) p0 p1), (X (NOT p2)), true, (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:58:50] [INFO ] Invariant cache hit.
[2024-05-25 12:58:50] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 80 ms returned sat
[2024-05-25 12:58:51] [INFO ] After 263ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 12:58:51] [INFO ] After 317ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-25 12:58:51] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-25 12:58:51] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 71 ms returned sat
[2024-05-25 12:58:51] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 12:58:51] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-25 12:58:51] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 495/495 transitions.
Graph (complete) has 999 edges and 525 vertex of which 500 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 500 transition count 253
Reduce places removed 217 places and 0 transitions.
Graph (complete) has 491 edges and 283 vertex of which 113 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.0 ms
Discarding 170 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Iterating post reduction 1 with 218 rules applied. Total rules applied 461 place count 113 transition count 183
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 552 place count 113 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 552 place count 113 transition count 90
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 556 place count 111 transition count 90
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 573 place count 94 transition count 73
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 53 rules applied. Total rules applied 626 place count 80 transition count 34
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 665 place count 41 transition count 34
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 665 place count 41 transition count 19
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 695 place count 26 transition count 19
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 697 place count 24 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 697 place count 24 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 701 place count 22 transition count 17
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 6 with 2 rules applied. Total rules applied 703 place count 21 transition count 16
Applied a total of 703 rules in 24 ms. Remains 21 /525 variables (removed 504) and now considering 16/495 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 21/525 places, 16/495 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 21 cols
[2024-05-25 12:58:51] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 12:58:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:58:51] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 12:58:52] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:58:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-25 12:58:52] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 12:58:52] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:58:52] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 12:58:52] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 21/21 places, 16/16 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 95 steps, run visited all 1 properties in 5 ms. (steps per millisecond=19 )
Probabilistic random walk after 95 steps, saw 44 distinct states, run finished after 5 ms. (steps per millisecond=19 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), true, (X (X (NOT p2))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F p2), (F (NOT p1)), (F (NOT p0)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p2))
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 6650 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((F((G(p1)||G(!p1)))&&p0))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 35 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:58:52] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 12:58:52] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-25 12:58:52] [INFO ] Invariant cache hit.
[2024-05-25 12:58:54] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2024-05-25 12:58:54] [INFO ] Invariant cache hit.
[2024-05-25 12:58:55] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2589 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s500 1)), p1:(OR (LT s21 1) (LT s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 537 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-04 finished in 2756 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)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 37 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 12:58:55] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 12:58:55] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 12:58:55] [INFO ] Invariant cache hit.
[2024-05-25 12:58:57] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2024-05-25 12:58:57] [INFO ] Invariant cache hit.
[2024-05-25 12:58:58] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2911 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s228 1))], 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][false, false]]
Product exploration explored 100000 steps with 370 reset in 306 ms.
Product exploration explored 100000 steps with 369 reset in 345 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 258 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=129 )
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 106 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 34 ms :[(NOT p0)]
[2024-05-25 12:58:59] [INFO ] Invariant cache hit.
[2024-05-25 12:58:59] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 108 ms returned sat
[2024-05-25 12:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:59:01] [INFO ] [Real]Absence check using state equation in 2145 ms returned sat
[2024-05-25 12:59:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:59:02] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 137 ms returned sat
[2024-05-25 12:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:59:05] [INFO ] [Nat]Absence check using state equation in 2462 ms returned sat
[2024-05-25 12:59:05] [INFO ] Computed and/alt/rep : 253/482/253 causal constraints (skipped 217 transitions) in 35 ms.
[2024-05-25 12:59:06] [INFO ] Added : 108 causal constraints over 22 iterations in 1579 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 495/495 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 501 transition count 261
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 291 transition count 261
Applied a total of 420 rules in 18 ms. Remains 291 /525 variables (removed 234) and now considering 261/495 (removed 234) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-05-25 12:59:06] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 12:59:06] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-25 12:59:07] [INFO ] Invariant cache hit.
[2024-05-25 12:59:07] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-25 12:59:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:59:07] [INFO ] Invariant cache hit.
[2024-05-25 12:59:08] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/525 places, 261/495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 291/525 places, 261/495 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 82 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 35 ms :[(NOT p0)]
Finished random walk after 136 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
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 110 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 35 ms :[(NOT p0)]
[2024-05-25 12:59:08] [INFO ] Invariant cache hit.
[2024-05-25 12:59:08] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 77 ms returned sat
[2024-05-25 12:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:59:09] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-25 12:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:59:09] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 78 ms returned sat
[2024-05-25 12:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:59:10] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2024-05-25 12:59:10] [INFO ] Computed and/alt/rep : 205/212/205 causal constraints (skipped 10 transitions) in 17 ms.
[2024-05-25 12:59:10] [INFO ] Added : 57 causal constraints over 12 iterations in 401 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 751 reset in 293 ms.
Product exploration explored 100000 steps with 751 reset in 415 ms.
Built C files in :
/tmp/ltsmin14561906054891540661
[2024-05-25 12:59:11] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 12:59:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:11] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 12:59:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:11] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 12:59:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14561906054891540661
Running compilation step : cd /tmp/ltsmin14561906054891540661;'/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 747 ms.
Running link step : cd /tmp/ltsmin14561906054891540661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14561906054891540661;'/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/stateBased17245489130503677459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 12 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-25 12:59:26] [INFO ] Invariant cache hit.
[2024-05-25 12:59:27] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 12:59:27] [INFO ] Invariant cache hit.
[2024-05-25 12:59:27] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2024-05-25 12:59:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:59:27] [INFO ] Invariant cache hit.
[2024-05-25 12:59:28] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1437 ms. Remains : 291/291 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin8495416159849691173
[2024-05-25 12:59:28] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 12:59:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:28] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 12:59:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:28] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 12:59:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:59:28] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8495416159849691173
Running compilation step : cd /tmp/ltsmin8495416159849691173;'/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 749 ms.
Running link step : cd /tmp/ltsmin8495416159849691173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8495416159849691173;'/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/stateBased8225704066831084764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 12:59:43] [INFO ] Flatten gal took : 10 ms
[2024-05-25 12:59:43] [INFO ] Flatten gal took : 9 ms
[2024-05-25 12:59:43] [INFO ] Time to serialize gal into /tmp/LTL13899985963888628298.gal : 2 ms
[2024-05-25 12:59:43] [INFO ] Time to serialize properties into /tmp/LTL16554158643515272297.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/LTL13899985963888628298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9927185692163459047.hoa' '-atoms' '/tmp/LTL16554158643515272297.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/LTL16554158643515272297.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9927185692163459047.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t51.t52, t55.t56, t59.t60, t63.t64...420
Computing Next relation with stutter on 1.78814e+18 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1306 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.112,363908,1,0,1058,1.67568e+06,548,673,8185,1.45345e+06,1889
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 63237 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((X(p1)&&p0)))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 529 transition count 499
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 529 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 526 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 36 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:59:58] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 12:59:58] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-25 12:59:58] [INFO ] Invariant cache hit.
[2024-05-25 13:00:00] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
[2024-05-25 13:00:00] [INFO ] Invariant cache hit.
[2024-05-25 13:00:01] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2786 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s96 1)), p1:(AND (GEQ s47 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 539 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 2888 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(G(p0))&&F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 29 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-05-25 13:00:01] [INFO ] Computed 30 invariants in 1 ms
[2024-05-25 13:00:01] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-25 13:00:01] [INFO ] Invariant cache hit.
[2024-05-25 13:00:02] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-05-25 13:00:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 13:00:02] [INFO ] Invariant cache hit.
[2024-05-25 13:00:02] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1509 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s145 1), p1:(AND (GEQ s23 1) (GEQ s219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 460 reset in 248 ms.
Product exploration explored 100000 steps with 460 reset in 280 ms.
Computed a total of 294 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 294 transition count 264
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 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 228 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=114 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 2628 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(G(p0)))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 510 transition count 262
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 292 transition count 262
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 443 place count 285 transition count 255
Iterating global reduction 2 with 7 rules applied. Total rules applied 450 place count 285 transition count 255
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 454 place count 285 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 458 place count 281 transition count 251
Applied a total of 458 rules in 28 ms. Remains 281 /535 variables (removed 254) and now considering 251/505 (removed 254) transitions.
// Phase 1: matrix 251 rows 281 cols
[2024-05-25 13:00:03] [INFO ] Computed 30 invariants in 1 ms
[2024-05-25 13:00:04] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-25 13:00:04] [INFO ] Invariant cache hit.
[2024-05-25 13:00:05] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-25 13:00:05] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 13:00:05] [INFO ] Invariant cache hit.
[2024-05-25 13:00:05] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/535 places, 251/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1458 ms. Remains : 281/535 places, 251/505 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 272 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 1509 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&&F(G(p1))))))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 36 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 13:00:05] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 13:00:05] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-25 13:00:05] [INFO ] Invariant cache hit.
[2024-05-25 13:00:07] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2024-05-25 13:00:07] [INFO ] Invariant cache hit.
[2024-05-25 13:00:08] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2898 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s196 1), p1:(GEQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1173 steps with 3 reset in 3 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 3068 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))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 512 transition count 275
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 305 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 420 place count 299 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 299 transition count 269
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 299 transition count 265
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 295 transition count 265
Applied a total of 434 rules in 26 ms. Remains 295 /535 variables (removed 240) and now considering 265/505 (removed 240) transitions.
// Phase 1: matrix 265 rows 295 cols
[2024-05-25 13:00:08] [INFO ] Computed 30 invariants in 1 ms
[2024-05-25 13:00:08] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-25 13:00:08] [INFO ] Invariant cache hit.
[2024-05-25 13:00:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 13:00:09] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2024-05-25 13:00:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 13:00:09] [INFO ] Invariant cache hit.
[2024-05-25 13:00:10] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/535 places, 265/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1625 ms. Remains : 295/535 places, 265/505 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11 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:(AND (GEQ s3 1) (GEQ s145 1)), p1:(AND (GEQ s55 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 290 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 1753 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(G(p0)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 511 transition count 275
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 305 transition count 275
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 298 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 298 transition count 268
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 430 place count 298 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 434 place count 294 transition count 264
Applied a total of 434 rules in 24 ms. Remains 294 /535 variables (removed 241) and now considering 264/505 (removed 241) transitions.
// Phase 1: matrix 264 rows 294 cols
[2024-05-25 13:00:10] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 13:00:10] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-25 13:00:10] [INFO ] Invariant cache hit.
[2024-05-25 13:00:11] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-25 13:00:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 13:00:11] [INFO ] Invariant cache hit.
[2024-05-25 13:00:11] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/535 places, 264/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1497 ms. Remains : 294/535 places, 264/505 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-12 finished in 1548 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)||(F(p0)&&X(X(X(F(p1)))))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 530 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 530 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 528 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 528 transition count 498
Applied a total of 14 rules in 40 ms. Remains 528 /535 variables (removed 7) and now considering 498/505 (removed 7) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-05-25 13:00:11] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 13:00:12] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-25 13:00:12] [INFO ] Invariant cache hit.
[2024-05-25 13:00:14] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2024-05-25 13:00:14] [INFO ] Invariant cache hit.
[2024-05-25 13:00:14] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 528/535 places, 498/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2925 ms. Remains : 528/535 places, 498/505 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s134 1)), p1:(GEQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1225 reset in 402 ms.
Product exploration explored 100000 steps with 1276 reset in 447 ms.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
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)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 160 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-25 13:00:17] [INFO ] Invariant cache hit.
[2024-05-25 13:00:18] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 85 ms returned sat
[2024-05-25 13:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:00:27] [INFO ] [Real]Absence check using state equation in 9356 ms returned sat
[2024-05-25 13:00:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:00:28] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 132 ms returned sat
[2024-05-25 13:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:00:30] [INFO ] [Nat]Absence check using state equation in 2629 ms returned sat
[2024-05-25 13:00:30] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 33 ms.
[2024-05-25 13:00:32] [INFO ] Added : 76 causal constraints over 16 iterations in 1404 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Applied a total of 0 rules in 11 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-25 13:00:32] [INFO ] Invariant cache hit.
[2024-05-25 13:00:32] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-25 13:00:32] [INFO ] Invariant cache hit.
[2024-05-25 13:00:34] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
[2024-05-25 13:00:34] [INFO ] Invariant cache hit.
[2024-05-25 13:00:35] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2853 ms. Remains : 528/528 places, 498/498 transitions.
Computed a total of 528 stabilizing places and 498 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 528 transition count 498
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)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 83 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-25 13:00:36] [INFO ] Invariant cache hit.
[2024-05-25 13:00:37] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 79 ms returned sat
[2024-05-25 13:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:00:46] [INFO ] [Real]Absence check using state equation in 9270 ms returned sat
[2024-05-25 13:00:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:00:47] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 131 ms returned sat
[2024-05-25 13:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:00:49] [INFO ] [Nat]Absence check using state equation in 2595 ms returned sat
[2024-05-25 13:00:49] [INFO ] Computed and/alt/rep : 254/484/254 causal constraints (skipped 219 transitions) in 34 ms.
[2024-05-25 13:00:51] [INFO ] Added : 76 causal constraints over 16 iterations in 1393 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1203 reset in 400 ms.
Product exploration explored 100000 steps with 1224 reset in 444 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 498/498 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 528 transition count 498
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 210 rules in 28 ms. Remains 528 /528 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-25 13:00:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 498 rows 528 cols
[2024-05-25 13:00:52] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 13:00:53] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 528/528 places, 498/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 528/528 places, 498/498 transitions.
Built C files in :
/tmp/ltsmin9093122915965964646
[2024-05-25 13:00:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9093122915965964646
Running compilation step : cd /tmp/ltsmin9093122915965964646;'/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 1156 ms.
Running link step : cd /tmp/ltsmin9093122915965964646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9093122915965964646;'/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/stateBased9559329158497258032.hoa' '--buchi-type=spotba'
LTSmin run took 1065 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-13 finished in 43900 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 X(p0))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 526 transition count 496
Applied a total of 18 rules in 34 ms. Remains 526 /535 variables (removed 9) and now considering 496/505 (removed 9) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 13:00:55] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 13:00:56] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-25 13:00:56] [INFO ] Invariant cache hit.
[2024-05-25 13:00:58] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2024-05-25 13:00:58] [INFO ] Invariant cache hit.
[2024-05-25 13:00:58] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/535 places, 496/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2853 ms. Remains : 526/535 places, 496/505 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { 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} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s359 1), p0:(AND (GEQ s21 1) (GEQ s88 1))], 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 2523 reset in 422 ms.
Product exploration explored 100000 steps with 2671 reset in 465 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 6 states, 11 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)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 335 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-25 13:01:00] [INFO ] Invariant cache hit.
[2024-05-25 13:01:01] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 95 ms returned sat
[2024-05-25 13:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:01:15] [INFO ] [Real]Absence check using state equation in 14498 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 526 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 : 526/526 places, 496/496 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 503 transition count 261
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 291 transition count 261
Applied a total of 424 rules in 13 ms. Remains 291 /526 variables (removed 235) and now considering 261/496 (removed 235) transitions.
// Phase 1: matrix 261 rows 291 cols
[2024-05-25 13:01:15] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 13:01:15] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-25 13:01:15] [INFO ] Invariant cache hit.
[2024-05-25 13:01:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 13:01:17] [INFO ] Implicit Places using invariants and state equation in 1381 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2024-05-25 13:01:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 13:01:17] [INFO ] Invariant cache hit.
[2024-05-25 13:01:17] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/526 places, 261/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2009 ms. Remains : 291/526 places, 261/496 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 183 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 49 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 214 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-25 13:01:18] [INFO ] Invariant cache hit.
[2024-05-25 13:01:18] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 93 ms returned sat
[2024-05-25 13:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:01:20] [INFO ] [Real]Absence check using state equation in 2057 ms returned sat
[2024-05-25 13:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:01:21] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 101 ms returned sat
[2024-05-25 13:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:01:22] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2024-05-25 13:01:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 13:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2024-05-25 13:01:22] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 18 ms.
[2024-05-25 13:01:23] [INFO ] Added : 96 causal constraints over 20 iterations in 925 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2354 reset in 777 ms.
Product exploration explored 100000 steps with 2389 reset in 582 ms.
Built C files in :
/tmp/ltsmin8642708429854693273
[2024-05-25 13:01:24] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-25 13:01:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 13:01:24] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-25 13:01:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 13:01:24] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-25 13:01:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 13:01:24] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8642708429854693273
Running compilation step : cd /tmp/ltsmin8642708429854693273;'/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 788 ms.
Running link step : cd /tmp/ltsmin8642708429854693273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8642708429854693273;'/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/stateBased17610856304875460924.hoa' '--buchi-type=spotba'
LTSmin run took 13906 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 44014 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((G(p0) U p1)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 505/505 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 525 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 525 transition count 495
Applied a total of 20 rules in 32 ms. Remains 525 /535 variables (removed 10) and now considering 495/505 (removed 10) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 13:01:39] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 13:01:40] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-25 13:01:40] [INFO ] Invariant cache hit.
[2024-05-25 13:01:42] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2024-05-25 13:01:42] [INFO ] Invariant cache hit.
[2024-05-25 13:01:42] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/535 places, 495/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2958 ms. Remains : 525/535 places, 495/505 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s161 1), p0:(LT s190 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 195 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 3163 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||F(p1)) U (p2||X(p0))))'
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))'
[2024-05-25 13:01:43] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12763318736586096961
[2024-05-25 13:01:43] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-25 13:01:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 13:01:43] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-25 13:01:43] [INFO ] Applying decomposition
[2024-05-25 13:01:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 13:01:43] [INFO ] Flatten gal took : 27 ms
[2024-05-25 13:01:43] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-25 13:01:43] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph836879785416527514.txt' '-o' '/tmp/graph836879785416527514.bin' '-w' '/tmp/graph836879785416527514.weights'
[2024-05-25 13:01:43] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12763318736586096961
Running compilation step : cd /tmp/ltsmin12763318736586096961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph836879785416527514.bin' '-l' '-1' '-v' '-w' '/tmp/graph836879785416527514.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:01:43] [INFO ] Decomposing Gal with order
[2024-05-25 13:01:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:01:43] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-25 13:01:43] [INFO ] Flatten gal took : 61 ms
[2024-05-25 13:01:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-25 13:01:43] [INFO ] Time to serialize gal into /tmp/LTLFireability13934163413658121461.gal : 10 ms
[2024-05-25 13:01:43] [INFO ] Time to serialize properties into /tmp/LTLFireability7363642244261458358.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/LTLFireability13934163413658121461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7363642244261458358.ltl' '-c' '-stutter-deadlock'

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 2 LTL properties
Checking formula 0 : !(((("((i11.u18.newmsg21>=1)&&(i6.u17.reply_21_0_to_right_20>=1))")||(F("((i0.u0.newmsg1>=1)&&(i0.u38.reply_25_3_to_left_2>=1))")))U((...270
Formula 0 simplified : (!"((i11.u18.newmsg21>=1)&&(i6.u17.reply_21_0_to_right_20>=1))" & G!"((i0.u0.newmsg1>=1)&&(i0.u38.reply_25_3_to_left_2>=1))") R (!"(...263
Compilation finished in 1893 ms.
Running link step : cd /tmp/ltsmin12763318736586096961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12763318736586096961;'/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))) U ((LTLAPp2==true)||X((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t8, t9, t10, t11, t12, t14, t16, t18, t19, t20, t22, t23, t30, t38, t77, ...853
Computing Next relation with stutter on 5.44614e+18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 13:24:19] [INFO ] Flatten gal took : 50 ms
[2024-05-25 13:24:19] [INFO ] Time to serialize gal into /tmp/LTLFireability10224914683735162077.gal : 4 ms
[2024-05-25 13:24:19] [INFO ] Time to serialize properties into /tmp/LTLFireability8660937846595686879.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/LTLFireability10224914683735162077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8660937846595686879.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 2 LTL properties
Checking formula 0 : !(((("((newmsg21>=1)&&(reply_21_0_to_right_20>=1))")||(F("((newmsg1>=1)&&(reply_25_3_to_left_2>=1))")))U(("(rcv_left_election_25_5_13_...219
Formula 0 simplified : (!"((newmsg21>=1)&&(reply_21_0_to_right_20>=1))" & G!"((newmsg1>=1)&&(reply_25_3_to_left_2>=1))") R (!"(rcv_left_election_25_5_13_13...212
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: LTL layer: formula: (((LTLAPp0==true)||<>((LTLAPp1==true))) U ((LTLAPp2==true)||X((LTLAPp0==true))))
pins2lts-mc-linux64( 4/ 8), 0.023: "(((LTLAPp0==true)||<>((LTLAPp1==true))) U ((LTLAPp2==true)||X((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.200: DFS-FIFO for weak LTL, using special progress label 510
pins2lts-mc-linux64( 0/ 8), 0.200: There are 511 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.200: State length is 536, there are 518 groups
pins2lts-mc-linux64( 0/ 8), 0.200: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.200: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.200: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.200: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.694: ~120 levels ~960 states ~24264 transitions
pins2lts-mc-linux64( 6/ 8), 0.798: ~240 levels ~1920 states ~31144 transitions
pins2lts-mc-linux64( 3/ 8), 0.845: ~283 levels ~3840 states ~34216 transitions
pins2lts-mc-linux64( 2/ 8), 0.960: ~286 levels ~7680 states ~44776 transitions
pins2lts-mc-linux64( 3/ 8), 1.192: ~283 levels ~15360 states ~66280 transitions
pins2lts-mc-linux64( 6/ 8), 1.646: ~287 levels ~30720 states ~110888 transitions
pins2lts-mc-linux64( 6/ 8), 2.559: ~287 levels ~61440 states ~209880 transitions
pins2lts-mc-linux64( 6/ 8), 4.287: ~287 levels ~122880 states ~406880 transitions
pins2lts-mc-linux64( 6/ 8), 7.852: ~287 levels ~245760 states ~905688 transitions
pins2lts-mc-linux64( 6/ 8), 14.039: ~287 levels ~491520 states ~1929024 transitions
pins2lts-mc-linux64( 3/ 8), 25.626: ~286 levels ~983040 states ~4368496 transitions
pins2lts-mc-linux64( 3/ 8), 47.374: ~286 levels ~1966080 states ~9412896 transitions
pins2lts-mc-linux64( 6/ 8), 91.418: ~287 levels ~3932160 states ~20122608 transitions
pins2lts-mc-linux64( 2/ 8), 182.764: ~286 levels ~7864320 states ~43770240 transitions
pins2lts-mc-linux64( 2/ 8), 367.452: ~286 levels ~15728640 states ~92444776 transitions
pins2lts-mc-linux64( 2/ 8), 740.217: ~286 levels ~31457280 states ~189783856 transitions
pins2lts-mc-linux64( 7/ 8), 1384.941: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1384.975:
pins2lts-mc-linux64( 0/ 8), 1384.976: mean standard work distribution: 9.3% (states) 9.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 1384.976:
pins2lts-mc-linux64( 0/ 8), 1384.976: Explored 52873944 states 357593929 transitions, fanout: 6.763
pins2lts-mc-linux64( 0/ 8), 1384.976: Total exploration time 1384.760 sec (1384.720 sec minimum, 1384.739 sec on average)
pins2lts-mc-linux64( 0/ 8), 1384.976: States per second: 38183, Transitions per second: 258235
pins2lts-mc-linux64( 0/ 8), 1384.976:
pins2lts-mc-linux64( 0/ 8), 1384.976: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1384.976: Redundant explorations: -0.0468
pins2lts-mc-linux64( 0/ 8), 1384.976:
pins2lts-mc-linux64( 0/ 8), 1384.976: Queue width: 8B, total height: 2297, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1384.976: Tree memory: 659.6MB, 13.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1384.976: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1384.976: Stored 548 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1384.976: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1384.976: Est. total memory use: 659.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12763318736586096961;'/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))) U ((LTLAPp2==true)||X((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12763318736586096961;'/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))) U ((LTLAPp2==true)||X((LTLAPp0==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)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...542
Computing Next relation with stutter on 5.44614e+18 deadlock states
7 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
82271 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,822.791,4156340,1,0,1059,1.83142e+07,17,814,7613,2.13059e+07,1126
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 1 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"
Computing Next relation with stutter on 5.44614e+18 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
47943 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1302.23,5046552,1,0,1059,2.55077e+07,17,814,7716,2.90941e+07,2533
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3177415 ms.

BK_STOP 1716644811694

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="HirschbergSinclair-PT-25"
export BK_EXAMINATION="LTLFireability"
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 HirschbergSinclair-PT-25, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r219-smll-171649597800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-25.tgz
mv HirschbergSinclair-PT-25 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;