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.r329-tall-171662361500058.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 QuasiCertifProtocol-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361500058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 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 QuasiCertifProtocol-PT-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716769863013

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=QuasiCertifProtocol-PT-22
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 00:31:04] [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-27 00:31:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:31:04] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2024-05-27 00:31:04] [INFO ] Transformed 1966 places.
[2024-05-27 00:31:04] [INFO ] Transformed 356 transitions.
[2024-05-27 00:31:04] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 792 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 150 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-27 00:31:05] [INFO ] Computed 1562 invariants in 75 ms
[2024-05-27 00:31:07] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-05-27 00:31:07] [INFO ] Invariant cache hit.
[2024-05-27 00:31:09] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 4480 ms to find 0 implicit places.
[2024-05-27 00:31:09] [INFO ] Invariant cache hit.
[2024-05-27 00:31:10] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5297 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 792 out of 1916 places after structural reductions.
[2024-05-27 00:31:10] [INFO ] Flatten gal took : 173 ms
[2024-05-27 00:31:10] [INFO ] Flatten gal took : 90 ms
[2024-05-27 00:31:11] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-27 00:31:11] [INFO ] Invariant cache hit.
[2024-05-27 00:31:12] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 297 ms returned sat
[2024-05-27 00:31:13] [INFO ] After 1996ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-05-27 00:31:14] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 277 ms returned sat
[2024-05-27 00:31:17] [INFO ] After 2421ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-05-27 00:31:19] [INFO ] After 4494ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 1866 ms.
[2024-05-27 00:31:21] [INFO ] After 7879ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Finished Parikh walk after 168 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 15 properties in 58 ms.
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1364 are kept as prefixes of interest. Removing 552 places using SCC suffix rule.9 ms
Discarding 552 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1318 transition count 144
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 260 place count 1293 transition count 144
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 260 place count 1293 transition count 76
Deduced a syphon composed of 68 places in 7 ms
Ensure Unique test removed 68 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 464 place count 1157 transition count 76
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 465 place count 1157 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 466 place count 1156 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 466 place count 1156 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 469 place count 1154 transition count 74
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 4 with 552 rules applied. Total rules applied 1021 place count 625 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1022 place count 624 transition count 50
Ensure Unique test removed 23 places
Iterating post reduction 4 with 23 rules applied. Total rules applied 1045 place count 601 transition count 50
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1067 place count 579 transition count 28
Ensure Unique test removed 506 places
Iterating post reduction 5 with 506 rules applied. Total rules applied 1573 place count 73 transition count 28
Applied a total of 1573 rules in 291 ms. Remains 73 /1916 variables (removed 1843) and now considering 28/356 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 73/1916 places, 28/356 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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' '!((X(!p0) U (X(G(!p0))||(X(!p0)&&(X(p1) U ((X(p1)&&(p2 U (p3||G(p2))))||X(G(p1))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 31 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-27 00:31:22] [INFO ] Invariant cache hit.
[2024-05-27 00:31:24] [INFO ] Implicit Places using invariants in 1736 ms returned []
[2024-05-27 00:31:24] [INFO ] Invariant cache hit.
[2024-05-27 00:31:26] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 4230 ms to find 0 implicit places.
[2024-05-27 00:31:26] [INFO ] Invariant cache hit.
[2024-05-27 00:31:27] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4897 ms. Remains : 1916/1916 places, 356/356 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 692 ms :[true, (NOT p1), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p3) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p2) (NOT p3)), p0, p0, p0, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p3, acceptance={} source=2 dest: 11}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 12}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p3 p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=4 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=5 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=6 dest: 14}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p3 p1), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=10 dest: 14}], [{ cond=p0, acceptance={} source=11 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 13}], [{ cond=p0, acceptance={} source=12 dest: 0}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=12 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 13}], [{ cond=p0, acceptance={} source=13 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=13 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=14 dest: 14}]], initial=2, aps=[p1:(GEQ s1891 1), p3:(AND (NOT (OR (LT s1891 1) (GEQ s1891 1))) (OR (AND (GEQ s995 1) (GEQ s996 1) (GEQ s997 1) (GEQ s998 1) (GEQ s999 1) (GEQ s1000 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3712 reset in 1184 ms.
Product exploration explored 100000 steps with 3715 reset in 1133 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p1 (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 22 factoid took 451 ms. Reduced automaton from 15 states, 71 edges and 4 AP (stutter sensitive) to 15 states, 69 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 584 ms :[true, (NOT p1), p0, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) p0 (NOT p3) (NOT p2)), (AND p0 (NOT p2) (NOT p3)), p0, p0, p0]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-27 00:31:32] [INFO ] Invariant cache hit.
[2024-05-27 00:31:34] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 305 ms returned sat
[2024-05-27 00:31:35] [INFO ] After 2158ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:13
[2024-05-27 00:31:36] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 294 ms returned sat
[2024-05-27 00:31:50] [INFO ] After 12922ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :8
[2024-05-27 00:31:55] [INFO ] After 18616ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :8
Attempting to minimize the solution found.
Minimization took 5018 ms.
[2024-05-27 00:32:00] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :7
Fused 18 Parikh solutions to 6 different solutions.
Finished Parikh walk after 122 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 5 ms.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.3 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 174 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1316/1916 places, 280/356 transitions.
Incomplete random walk after 10000 steps, including 386 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 556042 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 556042 steps, saw 83077 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 280 rows 1316 cols
[2024-05-27 00:32:05] [INFO ] Computed 1058 invariants in 10 ms
[2024-05-27 00:32:06] [INFO ] [Real]Absence check using 0 positive and 1058 generalized place invariants in 173 ms returned sat
[2024-05-27 00:32:06] [INFO ] After 450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-27 00:32:06] [INFO ] After 611ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 299 ms.
[2024-05-27 00:32:07] [INFO ] After 1483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 00:32:07] [INFO ] [Nat]Absence check using 0 positive and 1058 generalized place invariants in 190 ms returned sat
[2024-05-27 00:32:12] [INFO ] After 5138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 00:32:16] [INFO ] After 9149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3758 ms.
[2024-05-27 00:32:20] [INFO ] After 13577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 6 properties in 14 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (G (NOT (AND (NOT p0) p1 (NOT p3) p2))), (G (NOT (AND p0 p1 (NOT p3) p2))), (G (NOT (AND p0 (NOT p1) (NOT p3) p2))), (G (NOT (AND p0 (NOT p3) p2)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (F (AND p0 p1 p3)), (F (AND p1 (NOT p3) p2)), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F (AND (NOT p3) p2)), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND p1 (NOT p3) (NOT p2)))), (F (AND p1 p3)), (F (NOT p1)), (F (AND p0 (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (F p0), (F (AND p0 p1 (NOT p3) (NOT p2))), (F (AND p0 (NOT p3) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND p1 (NOT p3) p2))
Knowledge based reduction with 26 factoid took 582 ms. Reduced automaton from 15 states, 69 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 58730 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&&F(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.17 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1317 transition count 263
Applied a total of 93 rules in 321 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-05-27 00:32:21] [INFO ] Computed 1056 invariants in 14 ms
[2024-05-27 00:32:22] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-05-27 00:32:22] [INFO ] Invariant cache hit.
[2024-05-27 00:32:24] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3325 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 263/356 transitions.
Applied a total of 0 rules in 48 ms. Remains 1271 /1271 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3695 ms. Remains : 1271/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LT s112 1), p0:(OR (AND (GEQ s69 1) (GEQ s1166 1)) (AND (GEQ s60 1) (GEQ s1174 1)) (AND (GEQ s77 1) (GEQ s1270 1)) (AND (GEQ s67 1) (GEQ s1168 1)) (AN...], 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, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-01 finished in 3831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 81 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-27 00:32:25] [INFO ] Computed 1562 invariants in 16 ms
[2024-05-27 00:32:27] [INFO ] Implicit Places using invariants in 2177 ms returned []
[2024-05-27 00:32:27] [INFO ] Invariant cache hit.
[2024-05-27 00:32:31] [INFO ] Implicit Places using invariants and state equation in 3895 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6079 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6232 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s149 1) (GEQ s1851 1)) (AND (GEQ s141 1) (GEQ s1843 1)) (AND (GEQ s154 1) (GEQ s1846 1)) (AND (GEQ s146 1) (GEQ s1838 1)) (AND (GEQ s164 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-02 finished in 6400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-27 00:32:31] [INFO ] Invariant cache hit.
[2024-05-27 00:32:33] [INFO ] Implicit Places using invariants in 1925 ms returned []
[2024-05-27 00:32:33] [INFO ] Invariant cache hit.
[2024-05-27 00:32:37] [INFO ] Implicit Places using invariants and state equation in 3589 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5521 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5663 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s114 1) (GEQ s1741 1)) (AND (GEQ s105 1) (GEQ s1749 1)) (AND (GEQ s122 1) (GEQ s1884 1)) (AND (GEQ s112 1) (GEQ s1743 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 840 ms.
Product exploration explored 100000 steps with 33333 reset in 793 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 7695 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) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-27 00:32:39] [INFO ] Invariant cache hit.
[2024-05-27 00:32:41] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2024-05-27 00:32:41] [INFO ] Invariant cache hit.
[2024-05-27 00:32:44] [INFO ] Implicit Places using invariants and state equation in 3603 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5519 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5653 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-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=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 12}, { cond=p0, acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=13 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 14}], [{ cond=(NOT p0), acceptance={} source=14 dest: 8}, { cond=p0, acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(GEQ s155 1), p2:(OR (AND (GEQ s0 1) (GEQ s117 1)) (AND (GEQ s0 1) (GEQ s116 1)) (AND (GEQ s0 1) (GEQ s115 1)) (AND (GEQ s0 1) (GEQ s125 1)) (AND (GEQ ...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-04 finished in 6224 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 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1317 transition count 263
Applied a total of 93 rules in 125 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-05-27 00:32:45] [INFO ] Computed 1056 invariants in 10 ms
[2024-05-27 00:32:46] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2024-05-27 00:32:46] [INFO ] Invariant cache hit.
[2024-05-27 00:32:48] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3195 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1916 places, 263/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3382 ms. Remains : 1294/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 616 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=true, acceptance={1} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=p0, acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=p0, acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 7}, { cond=true, acceptance={1} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}, { cond=p0, acceptance={0, 1} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 11}, { cond=true, acceptance={1} source=4 dest: 12}, { cond=p0, acceptance={0, 1} source=4 dest: 13}], [{ cond=p1, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 7}, { cond=p1, acceptance={} source=6 dest: 9}, { cond=p0, acceptance={0, 1} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=7 dest: 7}, { cond=(NOT p2), acceptance={} source=7 dest: 8}, { cond=p2, acceptance={1} source=7 dest: 8}, { cond=p1, acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 10}, { cond=(AND p0 p2), acceptance={0, 1} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=8 dest: 11}, { cond=(NOT p2), acceptance={} source=8 dest: 12}, { cond=p2, acceptance={1} source=8 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 13}, { cond=(AND p0 p2), acceptance={0, 1} source=8 dest: 13}], [{ cond=(AND p1 p2), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=10 dest: 7}, { cond=p1, acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND p0 p2), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=11 dest: 3}, { cond=p2, acceptance={1} source=11 dest: 4}, { cond=(AND p1 p2), acceptance={} source=11 dest: 5}, { cond=(AND p0 p2), acceptance={0, 1} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 10}], [{ cond=p2, acceptance={1} source=12 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=12 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 11}, { cond=(NOT p2), acceptance={} source=12 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 13}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=13 dest: 3}, { cond=(AND p1 p2), acceptance={} source=13 dest: 5}, { cond=(AND p0 p2), acceptance={0, 1} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=13 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=13 dest: 10}]], initial=0, aps=[p0:(OR (AND (GEQ s104 1) (GEQ s1275 1)) (AND (GEQ s96 1) (GEQ s1267 1)) (AND (GEQ s109 1) (GEQ s1270 1)) (AND (GEQ s101 1) (GEQ s1262 1)) (AND (GEQ s115 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3713 reset in 469 ms.
Product exploration explored 100000 steps with 3715 reset in 529 ms.
Computed a total of 1294 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 263
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 (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-05 finished in 5223 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)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-27 00:32:50] [INFO ] Computed 1562 invariants in 27 ms
[2024-05-27 00:32:52] [INFO ] Implicit Places using invariants in 1958 ms returned []
[2024-05-27 00:32:52] [INFO ] Invariant cache hit.
[2024-05-27 00:32:57] [INFO ] Implicit Places using invariants and state equation in 4431 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6395 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6521 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s1808 1) (GEQ s1809 1) (GEQ s1810 1) (GEQ s1811 1) (GEQ s1812 1) (GEQ s1813 1) (GEQ s1814 1) (GEQ s1815 1) (GEQ s1816 1) (GEQ s1...], 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-06 finished in 6695 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 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.4 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1316 transition count 262
Applied a total of 95 rules in 120 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-05-27 00:32:57] [INFO ] Computed 1056 invariants in 16 ms
[2024-05-27 00:32:58] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2024-05-27 00:32:58] [INFO ] Invariant cache hit.
[2024-05-27 00:33:01] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned [578, 579, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 604, 606, 607, 608, 609]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4063 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1916 places, 262/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1293 /1293 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4241 ms. Remains : 1293/1916 places, 262/356 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s104 1) (GEQ s1274 1)) (AND (GEQ s96 1) (GEQ s1266 1)) (AND (GEQ s109 1) (GEQ s1269 1)) (AND (GEQ s101 1) (GEQ s1261 1)) (AND (GEQ s114 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 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-07 finished in 4282 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 U p1)||F(p2)))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1318 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1318 transition count 265
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 0 with 2 rules applied. Total rules applied 91 place count 1317 transition count 264
Applied a total of 91 rules in 125 ms. Remains 1317 /1916 variables (removed 599) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1317 cols
[2024-05-27 00:33:01] [INFO ] Computed 1056 invariants in 5 ms
[2024-05-27 00:33:02] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-05-27 00:33:02] [INFO ] Invariant cache hit.
[2024-05-27 00:33:05] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3232 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 264/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3404 ms. Remains : 1271/1916 places, 264/356 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s2 1), p1:(OR (GEQ s36 1) (GEQ s111 1)), p0:(GEQ s111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-08 finished in 3536 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(p0)&&(p0||G(p1)||F(p2)))))'
Support contains 49 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-27 00:33:05] [INFO ] Computed 1562 invariants in 22 ms
[2024-05-27 00:33:07] [INFO ] Implicit Places using invariants in 2011 ms returned []
[2024-05-27 00:33:07] [INFO ] Invariant cache hit.
[2024-05-27 00:33:11] [INFO ] Implicit Places using invariants and state equation in 4268 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6289 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 70 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6420 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s572 1) (GEQ s573 1) (GEQ s613 1) (GEQ s614 1) (GEQ s615 1) (GEQ s616 1) (GEQ s617 1) (GEQ s618 1) (GEQ s619 1) (GEQ s620 1) (GEQ...], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-10 finished in 6651 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((X(!p0)||F(!p1))))))'
Support contains 2 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-27 00:33:11] [INFO ] Invariant cache hit.
[2024-05-27 00:33:13] [INFO ] Implicit Places using invariants in 2093 ms returned []
[2024-05-27 00:33:14] [INFO ] Invariant cache hit.
[2024-05-27 00:33:18] [INFO ] Implicit Places using invariants and state equation in 4339 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6441 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6570 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s157 1), p0:(GEQ s155 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 19979 reset in 566 ms.
Product exploration explored 100000 steps with 20047 reset in 568 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1315962 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :{}
Probabilistic random walk after 1315962 steps, saw 182048 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-27 00:33:23] [INFO ] Computed 1540 invariants in 197 ms
[2024-05-27 00:33:24] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 283 ms returned sat
[2024-05-27 00:33:24] [INFO ] After 491ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:33:24] [INFO ] After 559ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-27 00:33:24] [INFO ] After 1125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:33:25] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 273 ms returned sat
[2024-05-27 00:33:25] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:33:25] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-27 00:33:26] [INFO ] After 1295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 27 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-27 00:33:26] [INFO ] Invariant cache hit.
[2024-05-27 00:33:28] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2024-05-27 00:33:28] [INFO ] Invariant cache hit.
[2024-05-27 00:33:32] [INFO ] Implicit Places using invariants and state equation in 3631 ms returned []
Implicit Place search using SMT with State Equation took 5670 ms to find 0 implicit places.
[2024-05-27 00:33:32] [INFO ] Invariant cache hit.
[2024-05-27 00:33:32] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6336 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1138285 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 1138285 steps, saw 155492 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 00:33:36] [INFO ] Invariant cache hit.
[2024-05-27 00:33:37] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 280 ms returned sat
[2024-05-27 00:33:37] [INFO ] After 493ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:33:37] [INFO ] After 569ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-27 00:33:37] [INFO ] After 1143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:33:38] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 279 ms returned sat
[2024-05-27 00:33:38] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:33:39] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-27 00:33:39] [INFO ] After 1310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 27 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 172 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 167 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 19977 reset in 560 ms.
Product exploration explored 100000 steps with 19955 reset in 578 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 169 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1340 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1295 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 92 rules in 417 ms. Remains 1295 /1893 variables (removed 598) and now considering 265/356 (removed 91) transitions.
[2024-05-27 00:33:41] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 265 rows 1295 cols
[2024-05-27 00:33:41] [INFO ] Computed 1034 invariants in 9 ms
[2024-05-27 00:33:42] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1893 places, 265/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 1295/1893 places, 265/356 transitions.
Built C files in :
/tmp/ltsmin5920272691954653276
[2024-05-27 00:33:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5920272691954653276
Running compilation step : cd /tmp/ltsmin5920272691954653276;'/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 1282 ms.
Running link step : cd /tmp/ltsmin5920272691954653276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5920272691954653276;'/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/stateBased6823763121219366976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-27 00:33:57] [INFO ] Computed 1540 invariants in 187 ms
[2024-05-27 00:33:59] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2024-05-27 00:33:59] [INFO ] Invariant cache hit.
[2024-05-27 00:34:03] [INFO ] Implicit Places using invariants and state equation in 3755 ms returned []
Implicit Place search using SMT with State Equation took 6080 ms to find 0 implicit places.
[2024-05-27 00:34:03] [INFO ] Invariant cache hit.
[2024-05-27 00:34:04] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6781 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin18189805346171985580
[2024-05-27 00:34:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18189805346171985580
Running compilation step : cd /tmp/ltsmin18189805346171985580;'/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 1178 ms.
Running link step : cd /tmp/ltsmin18189805346171985580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18189805346171985580;'/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/stateBased7075066691100420879.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:34:19] [INFO ] Flatten gal took : 53 ms
[2024-05-27 00:34:19] [INFO ] Flatten gal took : 53 ms
[2024-05-27 00:34:19] [INFO ] Time to serialize gal into /tmp/LTL12467300575838531152.gal : 13 ms
[2024-05-27 00:34:19] [INFO ] Time to serialize properties into /tmp/LTL8808943122062804781.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/LTL12467300575838531152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17415042920837140689.hoa' '-atoms' '/tmp/LTL8808943122062804781.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/LTL8808943122062804781.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17415042920837140689.hoa
Detected timeout of ITS tools.
[2024-05-27 00:34:34] [INFO ] Flatten gal took : 46 ms
[2024-05-27 00:34:34] [INFO ] Flatten gal took : 46 ms
[2024-05-27 00:34:34] [INFO ] Time to serialize gal into /tmp/LTL1822509912654689056.gal : 7 ms
[2024-05-27 00:34:34] [INFO ] Time to serialize properties into /tmp/LTL4159165327800464994.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/LTL1822509912654689056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4159165327800464994.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 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
Detected timeout of ITS tools.
[2024-05-27 00:34:49] [INFO ] Flatten gal took : 43 ms
[2024-05-27 00:34:49] [INFO ] Applying decomposition
[2024-05-27 00:34:49] [INFO ] Flatten gal took : 41 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/graph10502510529411988159.txt' '-o' '/tmp/graph10502510529411988159.bin' '-w' '/tmp/graph10502510529411988159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10502510529411988159.bin' '-l' '-1' '-v' '-w' '/tmp/graph10502510529411988159.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:34:49] [INFO ] Decomposing Gal with order
[2024-05-27 00:34:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:34:50] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-27 00:34:50] [INFO ] Flatten gal took : 326 ms
[2024-05-27 00:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 85 ms.
[2024-05-27 00:34:50] [INFO ] Time to serialize gal into /tmp/LTL7917364309535806431.gal : 18 ms
[2024-05-27 00:34:50] [INFO ] Time to serialize properties into /tmp/LTL5385223170057747828.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/LTL7917364309535806431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5385223170057747828.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i17.i1.u63.a2<1)"))||(F("(i17.i1.u63.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i17.i1.u63.a2<1)" & G!"(i17.i1.u63.a3>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15559179295383366843
[2024-05-27 00:35:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15559179295383366843
Running compilation step : cd /tmp/ltsmin15559179295383366843;'/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 1200 ms.
Running link step : cd /tmp/ltsmin15559179295383366843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15559179295383366843;'/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' 'X(X([]((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 128917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-27 00:35:20] [INFO ] Computed 1562 invariants in 18 ms
[2024-05-27 00:35:23] [INFO ] Implicit Places using invariants in 2218 ms returned []
[2024-05-27 00:35:23] [INFO ] Invariant cache hit.
[2024-05-27 00:35:26] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6031 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6178 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s65 1)), p0:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-13 finished in 6402 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 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1386 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.5 ms
Discarding 530 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1364 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1364 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 1362 transition count 309
Applied a total of 47 rules in 130 ms. Remains 1362 /1916 variables (removed 554) and now considering 309/356 (removed 47) transitions.
// Phase 1: matrix 309 rows 1362 cols
[2024-05-27 00:35:27] [INFO ] Computed 1056 invariants in 10 ms
[2024-05-27 00:35:28] [INFO ] Implicit Places using invariants in 1683 ms returned []
[2024-05-27 00:35:28] [INFO ] Invariant cache hit.
[2024-05-27 00:35:31] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned [625, 626, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 651, 653, 654, 655, 656, 1321, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4257 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1316/1916 places, 309/356 transitions.
Applied a total of 0 rules in 44 ms. Remains 1316 /1316 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4434 ms. Remains : 1316/1916 places, 309/356 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-14 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 s19 1) (OR (LT s2 1) (LT s143 1) (LT s144 1) (LT s145 1) (LT s146 1) (LT s147 1) (LT s148 1) (LT s149 1) (LT s150 1) (LT s151 1) (LT s152 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 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-14 finished in 4488 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((X(!p0)||F(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLFireability-12
Stuttering acceptance computed with spot in 192 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.7 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Applied a total of 93 rules in 139 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-05-27 00:35:32] [INFO ] Computed 1056 invariants in 12 ms
[2024-05-27 00:35:33] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2024-05-27 00:35:33] [INFO ] Invariant cache hit.
[2024-05-27 00:35:35] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3862 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4047 ms. Remains : 1270/1916 places, 262/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s111 1), p0:(GEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20041 reset in 515 ms.
Product exploration explored 100000 steps with 19936 reset in 531 ms.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
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 p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1326121 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1326121 steps, saw 182953 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 262 rows 1270 cols
[2024-05-27 00:35:40] [INFO ] Computed 1012 invariants in 12 ms
[2024-05-27 00:35:41] [INFO ] [Real]Absence check using 0 positive and 1012 generalized place invariants in 190 ms returned sat
[2024-05-27 00:35:41] [INFO ] After 324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:35:41] [INFO ] After 394ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-27 00:35:41] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:35:41] [INFO ] [Nat]Absence check using 0 positive and 1012 generalized place invariants in 176 ms returned sat
[2024-05-27 00:35:42] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:35:42] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-27 00:35:42] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 202 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 41 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-27 00:35:43] [INFO ] Invariant cache hit.
[2024-05-27 00:35:44] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2024-05-27 00:35:44] [INFO ] Invariant cache hit.
[2024-05-27 00:35:46] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2024-05-27 00:35:46] [INFO ] Invariant cache hit.
[2024-05-27 00:35:46] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3644 ms. Remains : 1270/1270 places, 262/262 transitions.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
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 p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1259219 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :{}
Probabilistic random walk after 1259219 steps, saw 174002 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 00:35:50] [INFO ] Invariant cache hit.
[2024-05-27 00:35:50] [INFO ] [Real]Absence check using 0 positive and 1012 generalized place invariants in 180 ms returned sat
[2024-05-27 00:35:50] [INFO ] After 317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:35:50] [INFO ] After 366ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-27 00:35:50] [INFO ] After 753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-27 00:35:51] [INFO ] [Nat]Absence check using 0 positive and 1012 generalized place invariants in 182 ms returned sat
[2024-05-27 00:35:51] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:35:51] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-27 00:35:51] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 186 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 175 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 20043 reset in 512 ms.
Product exploration explored 100000 steps with 20016 reset in 526 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 178 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 47 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-27 00:35:53] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-27 00:35:53] [INFO ] Invariant cache hit.
[2024-05-27 00:35:54] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin12081568234487080690
[2024-05-27 00:35:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12081568234487080690
Running compilation step : cd /tmp/ltsmin12081568234487080690;'/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 818 ms.
Running link step : cd /tmp/ltsmin12081568234487080690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12081568234487080690;'/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/stateBased9274850864111074218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 37 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-27 00:36:09] [INFO ] Invariant cache hit.
[2024-05-27 00:36:10] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-05-27 00:36:10] [INFO ] Invariant cache hit.
[2024-05-27 00:36:12] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 3114 ms to find 0 implicit places.
[2024-05-27 00:36:12] [INFO ] Invariant cache hit.
[2024-05-27 00:36:12] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3546 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin16559639457951036763
[2024-05-27 00:36:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16559639457951036763
Running compilation step : cd /tmp/ltsmin16559639457951036763;'/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 802 ms.
Running link step : cd /tmp/ltsmin16559639457951036763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16559639457951036763;'/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/stateBased4169902163784113289.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:36:28] [INFO ] Flatten gal took : 26 ms
[2024-05-27 00:36:28] [INFO ] Flatten gal took : 27 ms
[2024-05-27 00:36:28] [INFO ] Time to serialize gal into /tmp/LTL7947929318478570018.gal : 4 ms
[2024-05-27 00:36:28] [INFO ] Time to serialize properties into /tmp/LTL17022860841238065943.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/LTL7947929318478570018.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15827871027938780129.hoa' '-atoms' '/tmp/LTL17022860841238065943.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/LTL17022860841238065943.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15827871027938780129.hoa
Detected timeout of ITS tools.
[2024-05-27 00:36:43] [INFO ] Flatten gal took : 26 ms
[2024-05-27 00:36:43] [INFO ] Flatten gal took : 25 ms
[2024-05-27 00:36:43] [INFO ] Time to serialize gal into /tmp/LTL17286028299624996064.gal : 4 ms
[2024-05-27 00:36:43] [INFO ] Time to serialize properties into /tmp/LTL10235365820732372844.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/LTL17286028299624996064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10235365820732372844.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
Detected timeout of ITS tools.
[2024-05-27 00:36:58] [INFO ] Flatten gal took : 24 ms
[2024-05-27 00:36:58] [INFO ] Applying decomposition
[2024-05-27 00:36:58] [INFO ] Flatten gal took : 25 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/graph4227681688494572342.txt' '-o' '/tmp/graph4227681688494572342.bin' '-w' '/tmp/graph4227681688494572342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4227681688494572342.bin' '-l' '-1' '-v' '-w' '/tmp/graph4227681688494572342.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:36:58] [INFO ] Decomposing Gal with order
[2024-05-27 00:36:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:36:58] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-27 00:36:58] [INFO ] Flatten gal took : 59 ms
[2024-05-27 00:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 12 ms.
[2024-05-27 00:36:58] [INFO ] Time to serialize gal into /tmp/LTL14555644552768030196.gal : 7 ms
[2024-05-27 00:36:58] [INFO ] Time to serialize properties into /tmp/LTL12632556938468436939.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/LTL14555644552768030196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12632556938468436939.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i18.u25.a2<1)"))||(F("(i18.u25.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i18.u25.a2<1)" & G!"(i18.u25.a3>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6517104164111386078
[2024-05-27 00:37:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6517104164111386078
Running compilation step : cd /tmp/ltsmin6517104164111386078;'/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 827 ms.
Running link step : cd /tmp/ltsmin6517104164111386078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6517104164111386078;'/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' 'X(X([]((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 117186 ms.
[2024-05-27 00:37:28] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14222372170156344156
[2024-05-27 00:37:28] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-27 00:37:28] [INFO ] Applying decomposition
[2024-05-27 00:37:28] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:37:28] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-27 00:37:28] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:37:28] [INFO ] Flatten gal took : 38 ms
[2024-05-27 00:37:28] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-27 00:37:28] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:37:28] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14222372170156344156
Running compilation step : cd /tmp/ltsmin14222372170156344156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
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/graph17770447545502890884.txt' '-o' '/tmp/graph17770447545502890884.bin' '-w' '/tmp/graph17770447545502890884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17770447545502890884.bin' '-l' '-1' '-v' '-w' '/tmp/graph17770447545502890884.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:37:29] [INFO ] Decomposing Gal with order
[2024-05-27 00:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:37:29] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-27 00:37:29] [INFO ] Flatten gal took : 95 ms
[2024-05-27 00:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 36 ms.
[2024-05-27 00:37:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6035962156411578027.gal : 14 ms
[2024-05-27 00:37:29] [INFO ] Time to serialize properties into /tmp/LTLFireability7898819722214074814.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/LTLFireability6035962156411578027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7898819722214074814.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i24.u67.a2<1)"))||(F("(i24.u67.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i24.u67.a2<1)" & G!"(i24.u67.a3>=1)")
Compilation finished in 1474 ms.
Running link step : cd /tmp/ltsmin14222372170156344156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14222372170156344156;'/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' 'X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 00:59:04] [INFO ] Flatten gal took : 577 ms
[2024-05-27 00:59:05] [INFO ] Time to serialize gal into /tmp/LTLFireability9230866908062659863.gal : 139 ms
[2024-05-27 00:59:05] [INFO ] Time to serialize properties into /tmp/LTLFireability16254747635167498091.ltl : 37 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/LTLFireability9230866908062659863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16254747635167498091.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 1 LTL properties
Checking formula 0 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: LTL layer: formula: X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))
pins2lts-mc-linux64( 7/ 8), 0.019: "X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.256: DFS-FIFO for weak LTL, using special progress label 359
pins2lts-mc-linux64( 0/ 8), 0.256: There are 360 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.256: State length is 1917, there are 362 groups
pins2lts-mc-linux64( 0/ 8), 0.256: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.256: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.256: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.256: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.574: ~1 levels ~960 states ~21536 transitions
pins2lts-mc-linux64( 7/ 8), 0.720: ~1 levels ~1920 states ~57696 transitions
pins2lts-mc-linux64( 1/ 8), 0.957: ~1 levels ~3840 states ~85648 transitions
pins2lts-mc-linux64( 2/ 8), 1.424: ~1 levels ~7680 states ~203664 transitions
pins2lts-mc-linux64( 0/ 8), 2.153: ~1 levels ~15360 states ~379352 transitions
pins2lts-mc-linux64( 1/ 8), 3.336: ~1 levels ~30720 states ~729920 transitions
pins2lts-mc-linux64( 1/ 8), 6.071: ~1 levels ~61440 states ~1723104 transitions
pins2lts-mc-linux64( 1/ 8), 10.702: ~1 levels ~122880 states ~3613536 transitions
pins2lts-mc-linux64( 1/ 8), 19.047: ~1 levels ~245760 states ~7057184 transitions
pins2lts-mc-linux64( 1/ 8), 39.139: ~1 levels ~491520 states ~15777872 transitions
pins2lts-mc-linux64( 1/ 8), 75.197: ~1 levels ~983040 states ~31367904 transitions
pins2lts-mc-linux64( 1/ 8), 146.696: ~1 levels ~1966080 states ~63993168 transitions
pins2lts-mc-linux64( 1/ 8), 297.399: ~1 levels ~3932160 states ~133782720 transitions
pins2lts-mc-linux64( 1/ 8), 589.953: ~1 levels ~7864320 states ~268466768 transitions
pins2lts-mc-linux64( 1/ 8), 1436.216: ~1 levels ~15728640 states ~536278672 transitions
pins2lts-mc-linux64( 0/ 8), 1507.269: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1507.843:
pins2lts-mc-linux64( 0/ 8), 1507.843: mean standard work distribution: 3.0% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1507.843:
pins2lts-mc-linux64( 0/ 8), 1507.843: Explored 15412244 states 570353832 transitions, fanout: 37.007
pins2lts-mc-linux64( 0/ 8), 1507.843: Total exploration time 1507.550 sec (1507.120 sec minimum, 1507.274 sec on average)
pins2lts-mc-linux64( 0/ 8), 1507.843: States per second: 10223, Transitions per second: 378332
pins2lts-mc-linux64( 0/ 8), 1507.843:
pins2lts-mc-linux64( 0/ 8), 1507.843: Progress states detected: 121424616
pins2lts-mc-linux64( 0/ 8), 1507.843: Redundant explorations: -87.3072
pins2lts-mc-linux64( 0/ 8), 1507.843:
pins2lts-mc-linux64( 0/ 8), 1507.843: Queue width: 8B, total height: 151082048, memory: 1152.66MB
pins2lts-mc-linux64( 0/ 8), 1507.843: Tree memory: 1182.4MB, 10.2 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 1507.843: Tree fill ratio (roots/leafs): 90.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1507.844: Stored 358 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1508.242: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1508.242: Est. total memory use: 2335.1MB (~2176.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14222372170156344156;'/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' 'X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14222372170156344156;'/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' 'X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 01:21:30] [INFO ] Flatten gal took : 263 ms
[2024-05-27 01:21:32] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-27 01:21:32] [INFO ] Transformed 1916 places.
[2024-05-27 01:21:32] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 01:21:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2903861077048699285.gal : 11 ms
[2024-05-27 01:21:33] [INFO ] Time to serialize properties into /tmp/LTLFireability15323513373180741732.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/LTLFireability2903861077048699285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15323513373180741732.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 4637436 kB
After kill :
MemTotal: 16393228 kB
MemFree: 15892520 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="QuasiCertifProtocol-PT-22"
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 QuasiCertifProtocol-PT-22, 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 r329-tall-171662361500058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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