Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-22-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 1716769810968

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 00:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:30:12] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-27 00:30:12] [INFO ] Transformed 1966 places.
[2024-05-27 00:30:12] [INFO ] Transformed 356 transitions.
[2024-05-27 00:30:12] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1169 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 89 ms. Remains 1920 /1966 variables (removed 46) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1920 cols
[2024-05-27 00:30:13] [INFO ] Computed 1565 invariants in 85 ms
[2024-05-27 00:30:14] [INFO ] Implicit Places using invariants in 1378 ms returned []
[2024-05-27 00:30:14] [INFO ] Invariant cache hit.
[2024-05-27 00:30:16] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned [1157, 1158, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1183, 1185, 1186, 1188]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 3859 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1898/1966 places, 356/356 transitions.
Applied a total of 0 rules in 19 ms. Remains 1898 /1898 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3969 ms. Remains : 1898/1966 places, 356/356 transitions.
Support contains 1169 out of 1898 places after structural reductions.
[2024-05-27 00:30:17] [INFO ] Flatten gal took : 134 ms
[2024-05-27 00:30:17] [INFO ] Flatten gal took : 74 ms
[2024-05-27 00:30:17] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1167 out of 1898 places (down from 1169) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 356 rows 1898 cols
[2024-05-27 00:30:18] [INFO ] Computed 1543 invariants in 40 ms
[2024-05-27 00:30:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:30:19] [INFO ] [Real]Absence check using 1 positive and 1542 generalized place invariants in 287 ms returned sat
[2024-05-27 00:30:19] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-27 00:30:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-27 00:30:20] [INFO ] [Nat]Absence check using 1 positive and 1542 generalized place invariants in 278 ms returned sat
[2024-05-27 00:30:42] [INFO ] After 21567ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2024-05-27 00:30:43] [INFO ] After 22327ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 1350 ms.
[2024-05-27 00:30:44] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 52 ms.
Support contains 28 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1365 are kept as prefixes of interest. Removing 533 places using SCC suffix rule.9 ms
Discarding 533 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 230 rules applied. Total rules applied 231 place count 1319 transition count 170
Reduce places removed 22 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 45 rules applied. Total rules applied 276 place count 1297 transition count 147
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 299 place count 1274 transition count 147
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 299 place count 1274 transition count 78
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 551 places
Reduce places removed 620 places and 0 transitions.
Iterating global reduction 3 with 689 rules applied. Total rules applied 988 place count 654 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 988 place count 654 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 991 place count 652 transition count 77
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1012 place count 631 transition count 56
Iterating global reduction 3 with 21 rules applied. Total rules applied 1033 place count 631 transition count 56
Applied a total of 1033 rules in 183 ms. Remains 631 /1898 variables (removed 1267) and now considering 56/356 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 631/1898 places, 56/356 transitions.
Finished random walk after 243 steps, including 4 resets, run visited all 3 properties in 5 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1898 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1898 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (!p0||X(F(p1)))))'
Support contains 24 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 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 1895 transition count 356
Applied a total of 3 rules in 70 ms. Remains 1895 /1898 variables (removed 3) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1895 cols
[2024-05-27 00:30:45] [INFO ] Computed 1540 invariants in 38 ms
[2024-05-27 00:30:47] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2024-05-27 00:30:47] [INFO ] Invariant cache hit.
[2024-05-27 00:30:51] [INFO ] Implicit Places using invariants and state equation in 4070 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6231 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1898 places, 356/356 transitions.
Applied a total of 0 rules in 78 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6380 ms. Remains : 1894/1898 places, 356/356 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 236 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s1869), p1:(LEQ 3 (ADD s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s1748 s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1758 s1759 s1760 s1761 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-01 finished in 6678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1896 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1894 transition count 354
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1894 transition count 354
Applied a total of 4 rules in 307 ms. Remains 1894 /1898 variables (removed 4) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1894 cols
[2024-05-27 00:30:52] [INFO ] Computed 1541 invariants in 63 ms
[2024-05-27 00:30:54] [INFO ] Implicit Places using invariants in 2298 ms returned []
[2024-05-27 00:30:54] [INFO ] Invariant cache hit.
[2024-05-27 00:30:59] [INFO ] Implicit Places using invariants and state equation in 4640 ms returned [1164, 1829, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 6947 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1898 places, 354/356 transitions.
Applied a total of 0 rules in 97 ms. Remains 1870 /1870 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7352 ms. Remains : 1870/1898 places, 354/356 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s1845 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s162 s163 s164 s165 s167 s168 s169)) (GT s23 (ADD s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-05 finished in 7435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 529 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.10 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 1295 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1293 transition count 261
Applied a total of 95 rules in 87 ms. Remains 1293 /1898 variables (removed 605) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1293 cols
[2024-05-27 00:30:59] [INFO ] Computed 1034 invariants in 14 ms
[2024-05-27 00:31:00] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-27 00:31:00] [INFO ] Invariant cache hit.
[2024-05-27 00:31:02] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned [587, 1252, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 2656 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1269/1898 places, 261/356 transitions.
Applied a total of 0 rules in 29 ms. Remains 1269 /1269 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2773 ms. Remains : 1269/1898 places, 261/356 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s584 s585 s586 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 2828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.5 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
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 93 place count 1294 transition count 263
Applied a total of 93 rules in 195 ms. Remains 1294 /1898 variables (removed 604) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1294 cols
[2024-05-27 00:31:02] [INFO ] Computed 1034 invariants in 11 ms
[2024-05-27 00:31:03] [INFO ] Implicit Places using invariants in 1394 ms returned []
[2024-05-27 00:31:03] [INFO ] Invariant cache hit.
[2024-05-27 00:31:06] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned [588, 1253, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 3920 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1898 places, 263/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1270 /1270 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4168 ms. Remains : 1270/1898 places, 263/356 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-08 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 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-08 finished in 4265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.7 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 1295 transition count 264
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 1295 transition count 264
Applied a total of 92 rules in 199 ms. Remains 1295 /1898 variables (removed 603) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1295 cols
[2024-05-27 00:31:06] [INFO ] Computed 1034 invariants in 7 ms
[2024-05-27 00:31:07] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2024-05-27 00:31:07] [INFO ] Invariant cache hit.
[2024-05-27 00:31:10] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned [589, 1254, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 3366 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1898 places, 264/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3625 ms. Remains : 1271/1898 places, 264/356 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 3677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 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 1894 transition count 356
Applied a total of 4 rules in 81 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2024-05-27 00:31:10] [INFO ] Computed 1540 invariants in 16 ms
[2024-05-27 00:31:12] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2024-05-27 00:31:12] [INFO ] Invariant cache hit.
[2024-05-27 00:31:16] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5919 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 78 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6080 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s161 s60)], 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 35708 reset in 1172 ms.
Product exploration explored 100000 steps with 36429 reset in 1077 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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 8761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1870 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.7 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 5 place count 1868 transition count 352
Applied a total of 5 rules in 178 ms. Remains 1868 /1898 variables (removed 30) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1868 cols
[2024-05-27 00:31:19] [INFO ] Computed 1518 invariants in 16 ms
[2024-05-27 00:31:21] [INFO ] Implicit Places using invariants in 2043 ms returned []
[2024-05-27 00:31:21] [INFO ] Invariant cache hit.
[2024-05-27 00:31:24] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned [1161]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5483 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1898 places, 352/356 transitions.
Applied a total of 0 rules in 108 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5769 ms. Remains : 1867/1898 places, 352/356 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s0), p0:(LEQ s59 s1865)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3711 reset in 322 ms.
Product exploration explored 100000 steps with 3710 reset in 283 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1051693 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1051693 steps, saw 144634 distinct states, run finished after 3002 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 352 rows 1867 cols
[2024-05-27 00:31:29] [INFO ] Computed 1518 invariants in 215 ms
[2024-05-27 00:31:29] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 00:31:30] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 276 ms returned sat
[2024-05-27 00:31:30] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:31:30] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-27 00:31:31] [INFO ] After 1485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 71 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 92 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-27 00:31:31] [INFO ] Invariant cache hit.
[2024-05-27 00:31:33] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2024-05-27 00:31:33] [INFO ] Invariant cache hit.
[2024-05-27 00:31:36] [INFO ] Implicit Places using invariants and state equation in 3281 ms returned []
Implicit Place search using SMT with State Equation took 5312 ms to find 0 implicit places.
[2024-05-27 00:31:36] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-27 00:31:36] [INFO ] Invariant cache hit.
[2024-05-27 00:31:37] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6075 ms. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 369 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1148953 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :{}
Probabilistic random walk after 1148953 steps, saw 157153 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 00:31:41] [INFO ] Invariant cache hit.
[2024-05-27 00:31:41] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 00:31:41] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 265 ms returned sat
[2024-05-27 00:31:42] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 00:31:42] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-27 00:31:43] [INFO ] After 1545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 70 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3715 reset in 236 ms.
Product exploration explored 100000 steps with 3717 reset in 264 ms.
Built C files in :
/tmp/ltsmin8892457031208286435
[2024-05-27 00:31:44] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2024-05-27 00:31:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:44] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2024-05-27 00:31:44] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:44] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2024-05-27 00:31:44] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:44] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8892457031208286435
Running compilation step : cd /tmp/ltsmin8892457031208286435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1439 ms.
Running link step : cd /tmp/ltsmin8892457031208286435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8892457031208286435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16752623981598383742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 100 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-27 00:31:59] [INFO ] Invariant cache hit.
[2024-05-27 00:32:01] [INFO ] Implicit Places using invariants in 2080 ms returned []
[2024-05-27 00:32:01] [INFO ] Invariant cache hit.
[2024-05-27 00:32:04] [INFO ] Implicit Places using invariants and state equation in 3501 ms returned []
Implicit Place search using SMT with State Equation took 5583 ms to find 0 implicit places.
[2024-05-27 00:32:04] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-27 00:32:04] [INFO ] Invariant cache hit.
[2024-05-27 00:32:05] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6392 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin13179148654813888317
[2024-05-27 00:32:05] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2024-05-27 00:32:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:32:05] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2024-05-27 00:32:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:32:05] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2024-05-27 00:32:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:32:05] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13179148654813888317
Running compilation step : cd /tmp/ltsmin13179148654813888317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1434 ms.
Running link step : cd /tmp/ltsmin13179148654813888317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13179148654813888317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11039960965275082527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:32:20] [INFO ] Flatten gal took : 56 ms
[2024-05-27 00:32:20] [INFO ] Flatten gal took : 60 ms
[2024-05-27 00:32:20] [INFO ] Time to serialize gal into /tmp/LTL1075005905347870337.gal : 12 ms
[2024-05-27 00:32:20] [INFO ] Time to serialize properties into /tmp/LTL8487582375542042533.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1075005905347870337.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1591531036884929362.hoa' '-atoms' '/tmp/LTL8487582375542042533.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8487582375542042533.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1591531036884929362.hoa
Detected timeout of ITS tools.
[2024-05-27 00:32:35] [INFO ] Flatten gal took : 64 ms
[2024-05-27 00:32:36] [INFO ] Flatten gal took : 46 ms
[2024-05-27 00:32:36] [INFO ] Time to serialize gal into /tmp/LTL18150889464316117260.gal : 7 ms
[2024-05-27 00:32:36] [INFO ] Time to serialize properties into /tmp/LTL18131571746607918211.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18150889464316117260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18131571746607918211.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(s5_16<=Astart)")||(G("(malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(malicious_reservoir>=1)" & FG!"(s5_16<=Astart)")
Detected timeout of ITS tools.
[2024-05-27 00:32:51] [INFO ] Flatten gal took : 50 ms
[2024-05-27 00:32:51] [INFO ] Applying decomposition
[2024-05-27 00:32:51] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11162877674739755758.txt' '-o' '/tmp/graph11162877674739755758.bin' '-w' '/tmp/graph11162877674739755758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11162877674739755758.bin' '-l' '-1' '-v' '-w' '/tmp/graph11162877674739755758.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:32:51] [INFO ] Decomposing Gal with order
[2024-05-27 00:32:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:32:51] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-27 00:32:51] [INFO ] Flatten gal took : 289 ms
[2024-05-27 00:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 464 labels/synchronizations in 143 ms.
[2024-05-27 00:32:52] [INFO ] Time to serialize gal into /tmp/LTL3459148804237872662.gal : 20 ms
[2024-05-27 00:32:52] [INFO ] Time to serialize properties into /tmp/LTL623159728125476185.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3459148804237872662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL623159728125476185.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu24.s5_16<=gu24.Astart)")||(G("(gu0.malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(gu0.malicious_reservoir>=1)" & FG!"(gu24.s5_16<=gu24.Astart)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14171186429601500222
[2024-05-27 00:33:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14171186429601500222
Running compilation step : cd /tmp/ltsmin14171186429601500222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1250 ms.
Running link step : cd /tmp/ltsmin14171186429601500222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14171186429601500222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 123575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(F(p0)&&G(p1))))&&F(G(p2)))))'
Support contains 3 out of 1898 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1872 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.10 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1869 transition count 351
Applied a total of 5 rules in 179 ms. Remains 1869 /1898 variables (removed 29) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1869 cols
[2024-05-27 00:33:22] [INFO ] Computed 1520 invariants in 37 ms
[2024-05-27 00:33:24] [INFO ] Implicit Places using invariants in 2064 ms returned []
[2024-05-27 00:33:24] [INFO ] Invariant cache hit.
[2024-05-27 00:33:29] [INFO ] Implicit Places using invariants and state equation in 4827 ms returned [1163, 1828, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 6895 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1898 places, 351/356 transitions.
Applied a total of 0 rules in 86 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7164 ms. Remains : 1845/1898 places, 351/356 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s118 s45), p0:(GT s45 s89)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8530 reset in 484 ms.
Product exploration explored 100000 steps with 8463 reset in 441 ms.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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 p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Finished random walk after 1274 steps, including 45 resets, run visited all 2 properties in 9 ms. (steps per millisecond=141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F p0)]
Knowledge based reduction with 3 factoid took 386 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
// Phase 1: matrix 351 rows 1845 cols
[2024-05-27 00:33:32] [INFO ] Computed 1497 invariants in 35 ms
[2024-05-27 00:33:32] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-27 00:33:34] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2041 ms returned sat
[2024-05-27 00:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:33:43] [INFO ] [Real]Absence check using state equation in 8453 ms returned sat
[2024-05-27 00:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:33:45] [INFO ] [Nat]Absence check using 1 positive and 1496 generalized place invariants in 1941 ms returned sat
[2024-05-27 00:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:33:58] [INFO ] [Nat]Absence check using state equation in 12478 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1845 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Applied a total of 0 rules in 87 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2024-05-27 00:33:58] [INFO ] Invariant cache hit.
[2024-05-27 00:34:00] [INFO ] Implicit Places using invariants in 1995 ms returned []
[2024-05-27 00:34:00] [INFO ] Invariant cache hit.
[2024-05-27 00:34:04] [INFO ] Implicit Places using invariants and state equation in 4374 ms returned []
Implicit Place search using SMT with State Equation took 6377 ms to find 0 implicit places.
[2024-05-27 00:34:04] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-27 00:34:04] [INFO ] Invariant cache hit.
[2024-05-27 00:34:05] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7123 ms. Remains : 1845/1845 places, 351/351 transitions.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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 p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 356 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Finished random walk after 346 steps, including 12 resets, run visited all 2 properties in 5 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F p0)]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
[2024-05-27 00:34:06] [INFO ] Invariant cache hit.
[2024-05-27 00:34:07] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:34:09] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2026 ms returned sat
[2024-05-27 00:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:34:21] [INFO ] [Real]Absence check using state equation in 12395 ms returned sat
[2024-05-27 00:34:21] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 00:34:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 8634 reset in 454 ms.
Product exploration explored 100000 steps with 8472 reset in 447 ms.
Built C files in :
/tmp/ltsmin13467772449984875500
[2024-05-27 00:34:22] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2024-05-27 00:34:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:22] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2024-05-27 00:34:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:23] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2024-05-27 00:34:23] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:23] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13467772449984875500
Running compilation step : cd /tmp/ltsmin13467772449984875500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1415 ms.
Running link step : cd /tmp/ltsmin13467772449984875500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13467772449984875500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13728154993209293236.hoa' '--buchi-type=spotba'
LTSmin run took 9438 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-13 finished in 71483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-27 00:34:34] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3036705522666944408
[2024-05-27 00:34:34] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-27 00:34:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:34] [INFO ] Applying decomposition
[2024-05-27 00:34:34] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-27 00:34:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:34] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-27 00:34:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:34:34] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3036705522666944408
Running compilation step : cd /tmp/ltsmin3036705522666944408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 00:34:34] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3718313013212395867.txt' '-o' '/tmp/graph3718313013212395867.bin' '-w' '/tmp/graph3718313013212395867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3718313013212395867.bin' '-l' '-1' '-v' '-w' '/tmp/graph3718313013212395867.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:34:34] [INFO ] Decomposing Gal with order
[2024-05-27 00:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:34:34] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-27 00:34:34] [INFO ] Flatten gal took : 113 ms
[2024-05-27 00:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 10 ms.
[2024-05-27 00:34:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality9752170203425049297.gal : 9 ms
[2024-05-27 00:34:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11980831409524474479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9752170203425049297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11980831409524474479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu18.s5_16<=gu18.Astart)")||(G("(gi0.gu0.malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(gi0.gu0.malicious_reservoir>=1)" & FG!"(gu18.s5_16<=gu18.Astart)")
Compilation finished in 1607 ms.
Running link step : cd /tmp/ltsmin3036705522666944408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3036705522666944408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 00:56:02] [INFO ] Flatten gal took : 117 ms
[2024-05-27 00:56:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality17241003613219656616.gal : 6 ms
[2024-05-27 00:56:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality16043169488689531416.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17241003613219656616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16043169488689531416.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F(("(s5_16<=Astart)")||(G("(malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(malicious_reservoir>=1)" & FG!"(s5_16<=Astart)")
Detected timeout of ITS tools.
[2024-05-27 01:17:31] [INFO ] Flatten gal took : 119 ms
[2024-05-27 01:17:31] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-27 01:17:31] [INFO ] Transformed 1898 places.
[2024-05-27 01:17:31] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 01:17:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality3707756980289444883.gal : 6 ms
[2024-05-27 01:17:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality6725915121973939195.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3707756980289444883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6725915121973939195.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r329-tall-171662361400057"
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 ;