Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017500987.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017500987
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 72K Apr 30 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Apr 30 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 30 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 503K May 10 09:34 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-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652998098825

Running Version 202205111006
[2022-05-19 22:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 22:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 22:08:20] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-05-19 22:08:20] [INFO ] Transformed 1966 places.
[2022-05-19 22:08:20] [INFO ] Transformed 356 transitions.
[2022-05-19 22:08:20] [INFO ] Parsed PT model containing 1966 places and 356 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 794 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1920 transition count 356
Applied a total of 46 rules in 150 ms. Remains 1920 /1966 variables (removed 46) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 22:08:20] [INFO ] Computed 1565 place invariants in 115 ms
[2022-05-19 22:08:22] [INFO ] Implicit Places using invariants in 1814 ms returned []
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 22:08:22] [INFO ] Computed 1565 place invariants in 85 ms
[2022-05-19 22:08:25] [INFO ] Implicit Places using invariants and state equation in 3480 ms returned []
Implicit Place search using SMT with State Equation took 5321 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 22:08:25] [INFO ] Computed 1565 place invariants in 52 ms
[2022-05-19 22:08:26] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1920/1966 places, 356/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1920/1966 places, 356/356 transitions.
Support contains 794 out of 1920 places after structural reductions.
[2022-05-19 22:08:27] [INFO ] Flatten gal took : 227 ms
[2022-05-19 22:08:27] [INFO ] Flatten gal took : 113 ms
[2022-05-19 22:08:27] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 266 out of 1920 places (down from 794) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 22:08:28] [INFO ] Computed 1565 place invariants in 38 ms
[2022-05-19 22:08:29] [INFO ] After 1076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-19 22:08:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-19 22:08:30] [INFO ] [Nat]Absence check using 2 positive and 1563 generalized place invariants in 290 ms returned sat
[2022-05-19 22:08:35] [INFO ] After 4353ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :14
[2022-05-19 22:08:40] [INFO ] After 9494ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :14
Attempting to minimize the solution found.
Minimization took 3239 ms.
[2022-05-19 22:08:43] [INFO ] After 14525ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :14
Fused 21 Parikh solutions to 14 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 14 properties in 38 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1920 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1920 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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p2)))'
Support contains 70 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1388 are kept as prefixes of interest. Removing 532 places using SCC suffix rule.20 ms
Discarding 532 places :
Also discarding 0 output 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 1342 transition count 265
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1342 transition count 265
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1342 transition count 265
Applied a total of 92 rules in 371 ms. Remains 1342 /1920 variables (removed 578) and now considering 265/356 (removed 91) transitions.
// Phase 1: matrix 265 rows 1342 cols
[2022-05-19 22:08:44] [INFO ] Computed 1078 place invariants in 7 ms
[2022-05-19 22:08:45] [INFO ] Implicit Places using invariants in 1323 ms returned []
// Phase 1: matrix 265 rows 1342 cols
[2022-05-19 22:08:45] [INFO ] Computed 1078 place invariants in 7 ms
[2022-05-19 22:08:48] [INFO ] Implicit Places using invariants and state equation in 2773 ms returned [582, 583, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 608, 610, 611, 612, 613, 1278, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4106 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1920 places, 265/356 transitions.
Applied a total of 0 rules in 85 ms. Remains 1296 /1296 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1296/1920 places, 265/356 transitions.
Stuttering acceptance computed with spot in 1227 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s70 s71 s72 s73 s74 s75 s76 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93) s113), p0:(OR (LEQ (ADD s70 s71 s72 s73 s74 s75 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 5843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(((G(p1)||p2) U G(p1))||p1))))'
Support contains 93 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1916 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1915 transition count 355
Applied a total of 3 rules in 219 ms. Remains 1915 /1920 variables (removed 5) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1915 cols
[2022-05-19 22:08:50] [INFO ] Computed 1562 place invariants in 14 ms
[2022-05-19 22:08:52] [INFO ] Implicit Places using invariants in 2073 ms returned []
// Phase 1: matrix 355 rows 1915 cols
[2022-05-19 22:08:52] [INFO ] Computed 1562 place invariants in 13 ms
[2022-05-19 22:08:55] [INFO ] Implicit Places using invariants and state equation in 3445 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, 1851, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5524 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1920 places, 355/356 transitions.
Applied a total of 0 rules in 108 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1869/1920 places, 355/356 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23) s166), p2:(LEQ (ADD s139 s140 s141 s142 s143 s144 s145 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3481 reset in 525 ms.
Product exploration explored 100000 steps with 3484 reset in 438 ms.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 p2) (NOT p0)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p0))), true, (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 757 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:08:58] [INFO ] Computed 1518 place invariants in 286 ms
[2022-05-19 22:08:58] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 22:08:59] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 273 ms returned sat
[2022-05-19 22:09:04] [INFO ] After 4733ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 22:09:05] [INFO ] After 5711ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-05-19 22:09:05] [INFO ] After 6549ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p0))), true, (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 21 factoid took 849 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 70 out of 1869 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 92 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:06] [INFO ] Computed 1518 place invariants in 280 ms
[2022-05-19 22:09:08] [INFO ] Implicit Places using invariants in 2288 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:09] [INFO ] Computed 1518 place invariants in 280 ms
[2022-05-19 22:09:12] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned []
Implicit Place search using SMT with State Equation took 6165 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:13] [INFO ] Computed 1518 place invariants in 288 ms
[2022-05-19 22:09:13] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 349 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:14] [INFO ] Computed 1518 place invariants in 308 ms
[2022-05-19 22:09:14] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:09:15] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 275 ms returned sat
[2022-05-19 22:09:16] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:09:16] [INFO ] After 1090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-19 22:09:16] [INFO ] After 1653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 98 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p1 p2))]
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3475 reset in 430 ms.
Product exploration explored 100000 steps with 3474 reset in 354 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 70 out of 1869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1869 transition count 355
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 244 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2022-05-19 22:09:18] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:18] [INFO ] Computed 1518 place invariants in 288 ms
[2022-05-19 22:09:19] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1869 places, 355/355 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Product exploration explored 100000 steps with 3475 reset in 346 ms.
Product exploration explored 100000 steps with 3474 reset in 362 ms.
Built C files in :
/tmp/ltsmin14182814985639448926
[2022-05-19 22:09:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14182814985639448926
Running compilation step : cd /tmp/ltsmin14182814985639448926;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1306 ms.
Running link step : cd /tmp/ltsmin14182814985639448926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14182814985639448926;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16435762321040679648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 70 out of 1869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 84 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:36] [INFO ] Computed 1518 place invariants in 300 ms
[2022-05-19 22:09:38] [INFO ] Implicit Places using invariants in 2310 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:38] [INFO ] Computed 1518 place invariants in 298 ms
[2022-05-19 22:09:41] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 6096 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 22:09:42] [INFO ] Computed 1518 place invariants in 284 ms
[2022-05-19 22:09:42] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Built C files in :
/tmp/ltsmin17595572898223557405
[2022-05-19 22:09:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17595572898223557405
Running compilation step : cd /tmp/ltsmin17595572898223557405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin17595572898223557405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17595572898223557405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16651994455139523002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 22:09:57] [INFO ] Flatten gal took : 59 ms
[2022-05-19 22:09:57] [INFO ] Flatten gal took : 52 ms
[2022-05-19 22:09:58] [INFO ] Time to serialize gal into /tmp/LTL16416269115828024539.gal : 13 ms
[2022-05-19 22:09:58] [INFO ] Time to serialize properties into /tmp/LTL12592706862816346965.ltl : 152 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16416269115828024539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12592706862816346965.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1641626...268
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_...1478
Formula 0 simplified : !G(F"((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_2+...1465
Detected timeout of ITS tools.
[2022-05-19 22:10:13] [INFO ] Flatten gal took : 59 ms
[2022-05-19 22:10:13] [INFO ] Applying decomposition
[2022-05-19 22:10:13] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17742422655961627029.txt' '-o' '/tmp/graph17742422655961627029.bin' '-w' '/tmp/graph17742422655961627029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17742422655961627029.bin' '-l' '-1' '-v' '-w' '/tmp/graph17742422655961627029.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:10:13] [INFO ] Decomposing Gal with order
[2022-05-19 22:10:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:10:13] [INFO ] Removed a total of 229 redundant transitions.
[2022-05-19 22:10:14] [INFO ] Flatten gal took : 384 ms
[2022-05-19 22:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 143 ms.
[2022-05-19 22:10:14] [INFO ] Time to serialize gal into /tmp/LTL10863676394158290679.gal : 33 ms
[2022-05-19 22:10:14] [INFO ] Time to serialize properties into /tmp/LTL549180458601682900.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10863676394158290679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL549180458601682900.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1086367...266
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((gu45.Sstart_8+gu45.Sstart_9)+(gu45.Sstart_10+gu45.Sstart_11))+((gu45.Sstart_12+gu45.Sstart_13)+(gu45.Sstart_14+gu45.Sst...2318
Formula 0 simplified : !G(F"((((((gu45.Sstart_8+gu45.Sstart_9)+(gu45.Sstart_10+gu45.Sstart_11))+((gu45.Sstart_12+gu45.Sstart_13)+(gu45.Sstart_14+gu45.Sstar...2305
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7898444587095439154
[2022-05-19 22:10:29] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7898444587095439154
Running compilation step : cd /tmp/ltsmin7898444587095439154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1157 ms.
Running link step : cd /tmp/ltsmin7898444587095439154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7898444587095439154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-03 finished in 114972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X((G(X(p0))&&F(p1)))))))))'
Support contains 48 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1916 transition count 356
Applied a total of 4 rules in 80 ms. Remains 1916 /1920 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 22:10:44] [INFO ] Computed 1562 place invariants in 20 ms
[2022-05-19 22:10:46] [INFO ] Implicit Places using invariants in 1939 ms returned []
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 22:10:46] [INFO ] Computed 1562 place invariants in 12 ms
[2022-05-19 22:10:50] [INFO ] Implicit Places using invariants and state equation in 3698 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 5643 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1920 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1893/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 9}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={0} source=9 dest: 9}]], initial=8, aps=[p0:(GT s155 (ADD s1828 s1832 s1833 s1834 s1835 s1836 s1837 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-04 finished in 6120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 26 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1917 transition count 356
Applied a total of 3 rules in 74 ms. Remains 1917 /1920 variables (removed 3) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 22:10:51] [INFO ] Computed 1563 place invariants in 35 ms
[2022-05-19 22:10:53] [INFO ] Implicit Places using invariants in 2160 ms returned []
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 22:10:53] [INFO ] Computed 1563 place invariants in 30 ms
[2022-05-19 22:10:57] [INFO ] Implicit Places using invariants and state equation in 4203 ms returned []
Implicit Place search using SMT with State Equation took 6366 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 22:10:57] [INFO ] Computed 1563 place invariants in 30 ms
[2022-05-19 22:10:58] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1920 places, 356/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1917/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 2 s156) (LEQ 3 s23)), p1:(LEQ s167 (ADD s1156 s1157 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 651 ms.
Product exploration explored 100000 steps with 50000 reset in 668 ms.
Computed a total of 1917 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1917 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 (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-05 finished in 8950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 23 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1363 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.4 ms
Discarding 557 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 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 1315 transition count 261
Applied a total of 95 rules in 169 ms. Remains 1315 /1920 variables (removed 605) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1315 cols
[2022-05-19 22:11:00] [INFO ] Computed 1056 place invariants in 8 ms
[2022-05-19 22:11:01] [INFO ] Implicit Places using invariants in 1179 ms returned []
// Phase 1: matrix 261 rows 1315 cols
[2022-05-19 22:11:01] [INFO ] Computed 1056 place invariants in 6 ms
[2022-05-19 22:11:03] [INFO ] Implicit Places using invariants and state equation in 2054 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, 1274, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3234 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1269/1920 places, 261/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1269 /1269 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1269/1920 places, 261/356 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s46 s47 s48 s49 s50 s51 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s77))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-06 finished in 3494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1916 transition count 356
Applied a total of 4 rules in 74 ms. Remains 1916 /1920 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 22:11:03] [INFO ] Computed 1562 place invariants in 20 ms
[2022-05-19 22:11:05] [INFO ] Implicit Places using invariants in 2094 ms returned []
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 22:11:05] [INFO ] Computed 1562 place invariants in 15 ms
[2022-05-19 22:11:09] [INFO ] Implicit Places using invariants and state equation in 3713 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 5808 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1920 places, 356/356 transitions.
Applied a total of 0 rules in 96 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1893/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s110)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 633 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 7583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(G(p1))))'
Support contains 3 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1387 are kept as prefixes of interest. Removing 533 places using SCC suffix rule.5 ms
Discarding 533 places :
Also discarding 0 output 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 1341 transition count 265
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1341 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 93 place count 1340 transition count 264
Applied a total of 93 rules in 159 ms. Remains 1340 /1920 variables (removed 580) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1340 cols
[2022-05-19 22:11:11] [INFO ] Computed 1078 place invariants in 9 ms
[2022-05-19 22:11:12] [INFO ] Implicit Places using invariants in 1298 ms returned []
// Phase 1: matrix 264 rows 1340 cols
[2022-05-19 22:11:12] [INFO ] Computed 1078 place invariants in 8 ms
[2022-05-19 22:11:14] [INFO ] Implicit Places using invariants and state equation in 2164 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 3464 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1920 places, 264/356 transitions.
Applied a total of 0 rules in 51 ms. Remains 1294 /1294 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1294/1920 places, 264/356 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s117), p0:(LEQ s110 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 3749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)||X(p1)) U p1)))'
Support contains 4 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1917 transition count 356
Applied a total of 3 rules in 80 ms. Remains 1917 /1920 variables (removed 3) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 22:11:14] [INFO ] Computed 1563 place invariants in 30 ms
[2022-05-19 22:11:16] [INFO ] Implicit Places using invariants in 2084 ms returned []
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 22:11:16] [INFO ] Computed 1563 place invariants in 32 ms
[2022-05-19 22:11:21] [INFO ] Implicit Places using invariants and state equation in 5143 ms returned [1156, 1157, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1182, 1184, 1185, 1186, 1187]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7241 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1920 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1894/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s753 s162), p0:(LEQ s44 s63)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Product exploration explored 100000 steps with 50000 reset in 593 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-14 finished in 9119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((X(G(p0))&&F(p0)))))))'
Support contains 2 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1363 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.6 ms
Discarding 557 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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 203 ms. Remains 1316 /1920 variables (removed 604) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2022-05-19 22:11:24] [INFO ] Computed 1056 place invariants in 8 ms
[2022-05-19 22:11:25] [INFO ] Implicit Places using invariants in 1180 ms returned []
// Phase 1: matrix 262 rows 1316 cols
[2022-05-19 22:11:25] [INFO ] Computed 1056 place invariants in 5 ms
[2022-05-19 22:11:27] [INFO ] Implicit Places using invariants and state equation in 2205 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 3391 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1920 places, 262/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1270/1920 places, 262/356 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1216 s1211)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3473 reset in 265 ms.
Product exploration explored 100000 steps with 3476 reset in 292 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 349 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2358620 steps, run timeout after 3001 ms. (steps per millisecond=785 ) properties seen :{}
Probabilistic random walk after 2358620 steps, saw 326287 distinct states, run finished after 3001 ms. (steps per millisecond=785 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:31] [INFO ] Computed 1012 place invariants in 14 ms
[2022-05-19 22:11:31] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:11:31] [INFO ] [Nat]Absence check using 0 positive and 1012 generalized place invariants in 175 ms returned sat
[2022-05-19 22:11:32] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:11:32] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 22:11:32] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
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 65 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:32] [INFO ] Computed 1012 place invariants in 9 ms
[2022-05-19 22:11:33] [INFO ] Implicit Places using invariants in 1124 ms returned []
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:33] [INFO ] Computed 1012 place invariants in 8 ms
[2022-05-19 22:11:35] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 3188 ms to find 0 implicit places.
[2022-05-19 22:11:35] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:35] [INFO ] Computed 1012 place invariants in 17 ms
[2022-05-19 22:11:36] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2388282 steps, run timeout after 3001 ms. (steps per millisecond=795 ) properties seen :{}
Probabilistic random walk after 2388282 steps, saw 330103 distinct states, run finished after 3001 ms. (steps per millisecond=795 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:39] [INFO ] Computed 1012 place invariants in 8 ms
[2022-05-19 22:11:39] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:11:40] [INFO ] [Nat]Absence check using 0 positive and 1012 generalized place invariants in 168 ms returned sat
[2022-05-19 22:11:40] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:11:40] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-19 22:11:40] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3472 reset in 285 ms.
Product exploration explored 100000 steps with 3477 reset in 280 ms.
Built C files in :
/tmp/ltsmin8427982201405946235
[2022-05-19 22:11:41] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-19 22:11:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:11:41] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-19 22:11:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:11:41] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-19 22:11:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:11:41] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8427982201405946235
Running compilation step : cd /tmp/ltsmin8427982201405946235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 914 ms.
Running link step : cd /tmp/ltsmin8427982201405946235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8427982201405946235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15676859600072330281.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 SI_LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 62 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:56] [INFO ] Computed 1012 place invariants in 16 ms
[2022-05-19 22:11:57] [INFO ] Implicit Places using invariants in 1190 ms returned []
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:57] [INFO ] Computed 1012 place invariants in 8 ms
[2022-05-19 22:11:59] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 3480 ms to find 0 implicit places.
[2022-05-19 22:11:59] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 262 rows 1270 cols
[2022-05-19 22:11:59] [INFO ] Computed 1012 place invariants in 16 ms
[2022-05-19 22:12:00] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin16484206290441385063
[2022-05-19 22:12:00] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-19 22:12:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:12:00] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-19 22:12:00] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:12:00] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-19 22:12:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:12:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16484206290441385063
Running compilation step : cd /tmp/ltsmin16484206290441385063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 965 ms.
Running link step : cd /tmp/ltsmin16484206290441385063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16484206290441385063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8125726576024027710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 22:12:15] [INFO ] Flatten gal took : 30 ms
[2022-05-19 22:12:15] [INFO ] Flatten gal took : 30 ms
[2022-05-19 22:12:15] [INFO ] Time to serialize gal into /tmp/LTL3557769952783847399.gal : 12 ms
[2022-05-19 22:12:15] [INFO ] Time to serialize properties into /tmp/LTL13969268628798218022.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3557769952783847399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13969268628798218022.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3557769...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G((X(G("(n3_18<=n4_1)")))&&(F("(n3_18<=n4_1)"))))))))
Formula 0 simplified : !FXFG(XG"(n3_18<=n4_1)" & F"(n3_18<=n4_1)")
Detected timeout of ITS tools.
[2022-05-19 22:12:30] [INFO ] Flatten gal took : 29 ms
[2022-05-19 22:12:30] [INFO ] Applying decomposition
[2022-05-19 22:12:30] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6457847893804475148.txt' '-o' '/tmp/graph6457847893804475148.bin' '-w' '/tmp/graph6457847893804475148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6457847893804475148.bin' '-l' '-1' '-v' '-w' '/tmp/graph6457847893804475148.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:12:30] [INFO ] Decomposing Gal with order
[2022-05-19 22:12:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:12:30] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-19 22:12:30] [INFO ] Flatten gal took : 45 ms
[2022-05-19 22:12:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 17 ms.
[2022-05-19 22:12:30] [INFO ] Time to serialize gal into /tmp/LTL13473083082485642342.gal : 5 ms
[2022-05-19 22:12:30] [INFO ] Time to serialize properties into /tmp/LTL18009654171636657989.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13473083082485642342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18009654171636657989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1347308...268
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G((X(G("(gu47.n3_18<=gu47.n4_1)")))&&(F("(gu47.n3_18<=gu47.n4_1)"))))))))
Formula 0 simplified : !FXFG(XG"(gu47.n3_18<=gu47.n4_1)" & F"(gu47.n3_18<=gu47.n4_1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18097846689801071852
[2022-05-19 22:12:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18097846689801071852
Running compilation step : cd /tmp/ltsmin18097846689801071852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 821 ms.
Running link step : cd /tmp/ltsmin18097846689801071852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18097846689801071852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>([]((X([]((LTLAPp0==true)))&&<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-15 finished in 97241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(((G(p1)||p2) U G(p1))||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((X(G(p0))&&F(p0)))))))'
[2022-05-19 22:13:01] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14836352213710077066
[2022-05-19 22:13:01] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2022-05-19 22:13:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:13:01] [INFO ] Applying decomposition
[2022-05-19 22:13:01] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2022-05-19 22:13:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:13:01] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2022-05-19 22:13:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 22:13:01] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14836352213710077066
Running compilation step : cd /tmp/ltsmin14836352213710077066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 22:13:01] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8374465997863633857.txt' '-o' '/tmp/graph8374465997863633857.bin' '-w' '/tmp/graph8374465997863633857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8374465997863633857.bin' '-l' '-1' '-v' '-w' '/tmp/graph8374465997863633857.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:13:01] [INFO ] Decomposing Gal with order
[2022-05-19 22:13:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:13:01] [INFO ] Removed a total of 144 redundant transitions.
[2022-05-19 22:13:01] [INFO ] Flatten gal took : 103 ms
[2022-05-19 22:13:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 26 ms.
[2022-05-19 22:13:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality7771598335291343936.gal : 11 ms
[2022-05-19 22:13:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality7370893104832412074.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7771598335291343936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7370893104832412074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((G((F("((((((gu29.Sstart_8+gu29.Sstart_9)+(gu29.Sstart_10+gu29.Sstart_11))+((gu29.Sstart_12+gu29.Sstart_13)+(gu29.Sstart_14+gu29.Sst...2318
Formula 0 simplified : !G(F"((((((gu29.Sstart_8+gu29.Sstart_9)+(gu29.Sstart_10+gu29.Sstart_11))+((gu29.Sstart_12+gu29.Sstart_13)+(gu29.Sstart_14+gu29.Sstar...2305
Compilation finished in 1570 ms.
Running link step : cd /tmp/ltsmin14836352213710077066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14836352213710077066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 22:34:36] [INFO ] Flatten gal took : 107 ms
[2022-05-19 22:34:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality6219485145078974935.gal : 25 ms
[2022-05-19 22:34:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality5489738540611308386.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6219485145078974935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5489738540611308386.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((G((F("((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_...1478
Formula 0 simplified : !G(F"((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_2+...1465
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14836352213710077066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14836352213710077066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>([]((X([]((LTLAPp3==true)))&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 22:56:09] [INFO ] Flatten gal took : 137 ms
[2022-05-19 22:56:10] [INFO ] Input system was already deterministic with 356 transitions.
[2022-05-19 22:56:10] [INFO ] Transformed 1920 places.
[2022-05-19 22:56:10] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 22:56:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality2504236503980051144.gal : 4 ms
[2022-05-19 22:56:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality1842568048363337356.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2504236503980051144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1842568048363337356.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_...1478
Formula 0 simplified : !G(F"((((((Sstart_8+Sstart_9)+(Sstart_10+Sstart_11))+((Sstart_12+Sstart_13)+(Sstart_14+Sstart_15)))+(((Sstart_0+Sstart_1)+(Sstart_2+...1465

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-22, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017500987"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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