Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678996649913

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 19:57:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 19:57:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:57:31] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-16 19:57:31] [INFO ] Transformed 1966 places.
[2023-03-16 19:57:31] [INFO ] Transformed 356 transitions.
[2023-03-16 19:57:31] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 743 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 167 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 19:57:32] [INFO ] Computed 1562 place invariants in 68 ms
[2023-03-16 19:57:35] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2023-03-16 19:57:35] [INFO ] Invariant cache hit.
[2023-03-16 19:57:37] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 5621 ms to find 0 implicit places.
[2023-03-16 19:57:37] [INFO ] Invariant cache hit.
[2023-03-16 19:57:38] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6439 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 743 out of 1916 places after structural reductions.
[2023-03-16 19:57:38] [INFO ] Flatten gal took : 132 ms
[2023-03-16 19:57:38] [INFO ] Flatten gal took : 77 ms
[2023-03-16 19:57:38] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-16 19:57:39] [INFO ] Invariant cache hit.
[2023-03-16 19:57:40] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 320 ms returned sat
[2023-03-16 19:57:41] [INFO ] After 587ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:16
[2023-03-16 19:57:41] [INFO ] After 687ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:16
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-16 19:57:42] [INFO ] After 2297ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:16
[2023-03-16 19:57:42] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 306 ms returned sat
[2023-03-16 19:57:45] [INFO ] After 2110ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-16 19:57:48] [INFO ] After 4685ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 2099 ms.
[2023-03-16 19:57:50] [INFO ] After 8299ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=26 )
Parikh walk visited 16 properties in 72 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))&&(F(p0) U p2)))))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 19:57:50] [INFO ] Invariant cache hit.
[2023-03-16 19:57:52] [INFO ] Implicit Places using invariants in 2178 ms returned []
[2023-03-16 19:57:52] [INFO ] Invariant cache hit.
[2023-03-16 19:57:57] [INFO ] Implicit Places using invariants and state equation in 4346 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 6533 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 56 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 6649 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LT s97 1) (LT s67 1) (LT s98 1) (LT s69 1) (LT s68 1) (LT s70 1) (LT s75 1) (LT s74 1) (LT s77 1) (LT s76 1) (LT s79 1) (LT s78 1) (LT s81 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 5 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 7099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U p2)))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.18 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1317 transition count 263
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 1317 transition count 263
Applied a total of 94 rules in 445 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2023-03-16 19:57:58] [INFO ] Computed 1056 place invariants in 25 ms
[2023-03-16 19:57:59] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2023-03-16 19:57:59] [INFO ] Invariant cache hit.
[2023-03-16 19:58:01] [INFO ] Implicit Places using invariants and state equation in 2136 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3300 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1916 places, 263/356 transitions.
Applied a total of 0 rules in 84 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3830 ms. Remains : 1294/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s111 1) (GEQ s1180 1) (GEQ s1181 1) (GEQ s1188 1) (GEQ s1189 1) (GEQ s1190 1) (GEQ s1191 1) (GEQ s1192 1) (GEQ s1193 1) (GEQ s1194 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-01 finished in 3991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 19:58:01] [INFO ] Computed 1562 place invariants in 24 ms
[2023-03-16 19:58:03] [INFO ] Implicit Places using invariants in 1649 ms returned []
[2023-03-16 19:58:03] [INFO ] Invariant cache hit.
[2023-03-16 19:58:06] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned []
Implicit Place search using SMT with State Equation took 4226 ms to find 0 implicit places.
[2023-03-16 19:58:06] [INFO ] Invariant cache hit.
[2023-03-16 19:58:06] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4893 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s84 1)) (OR (LT s0 1) (LT s85 1)) (OR (LT s0 1) (LT s82 1)) (OR (LT s0 1) (LT s83 1)) (OR (LT s0 1) (LT s80 1)) (OR (LT s0 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3713 reset in 622 ms.
Product exploration explored 100000 steps with 3713 reset in 552 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 369 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1474882 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1474882 steps, saw 201266 distinct states, run finished after 3003 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:58:11] [INFO ] Invariant cache hit.
[2023-03-16 19:58:12] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 300 ms returned sat
[2023-03-16 19:58:13] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:58:13] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 290 ms returned sat
[2023-03-16 19:58:15] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:58:16] [INFO ] After 2158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 920 ms.
[2023-03-16 19:58:16] [INFO ] After 3602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 49 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 19:58:17] [INFO ] Invariant cache hit.
[2023-03-16 19:58:18] [INFO ] Implicit Places using invariants in 1594 ms returned []
[2023-03-16 19:58:18] [INFO ] Invariant cache hit.
[2023-03-16 19:58:21] [INFO ] Implicit Places using invariants and state equation in 2602 ms returned []
Implicit Place search using SMT with State Equation took 4206 ms to find 0 implicit places.
[2023-03-16 19:58:21] [INFO ] Invariant cache hit.
[2023-03-16 19:58:22] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4884 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1520002 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 1520002 steps, saw 206983 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:58:25] [INFO ] Invariant cache hit.
[2023-03-16 19:58:26] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 295 ms returned sat
[2023-03-16 19:58:27] [INFO ] After 1620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:58:28] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 305 ms returned sat
[2023-03-16 19:58:29] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:58:30] [INFO ] After 2188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 932 ms.
[2023-03-16 19:58:31] [INFO ] After 3656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3713 reset in 505 ms.
Product exploration explored 100000 steps with 3716 reset in 528 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 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 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1892 transition count 356
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 240 ms. Remains 1892 /1916 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2023-03-16 19:58:33] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 356 rows 1892 cols
[2023-03-16 19:58:33] [INFO ] Computed 1540 place invariants in 35 ms
[2023-03-16 19:58:34] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1025 ms. Remains : 1892/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin15347363195901828654
[2023-03-16 19:58:34] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347363195901828654
Running compilation step : cd /tmp/ltsmin15347363195901828654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1483 ms.
Running link step : cd /tmp/ltsmin15347363195901828654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15347363195901828654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14267783249495346525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 41 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 19:58:49] [INFO ] Computed 1562 place invariants in 24 ms
[2023-03-16 19:58:50] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2023-03-16 19:58:50] [INFO ] Invariant cache hit.
[2023-03-16 19:58:53] [INFO ] Implicit Places using invariants and state equation in 2724 ms returned []
Implicit Place search using SMT with State Equation took 4381 ms to find 0 implicit places.
[2023-03-16 19:58:53] [INFO ] Invariant cache hit.
[2023-03-16 19:58:54] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5068 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin5942770656761376188
[2023-03-16 19:58:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5942770656761376188
Running compilation step : cd /tmp/ltsmin5942770656761376188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1262 ms.
Running link step : cd /tmp/ltsmin5942770656761376188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5942770656761376188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1469162071658359029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:59:09] [INFO ] Flatten gal took : 57 ms
[2023-03-16 19:59:09] [INFO ] Flatten gal took : 51 ms
[2023-03-16 19:59:09] [INFO ] Time to serialize gal into /tmp/LTL13039651150435950482.gal : 10 ms
[2023-03-16 19:59:09] [INFO ] Time to serialize properties into /tmp/LTL2378137032346325432.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13039651150435950482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15101961881524371798.hoa' '-atoms' '/tmp/LTL2378137032346325432.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2378137032346325432.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15101961881524371798.hoa
Detected timeout of ITS tools.
[2023-03-16 19:59:24] [INFO ] Flatten gal took : 47 ms
[2023-03-16 19:59:24] [INFO ] Flatten gal took : 48 ms
[2023-03-16 19:59:24] [INFO ] Time to serialize gal into /tmp/LTL7626143625562190554.gal : 7 ms
[2023-03-16 19:59:24] [INFO ] Time to serialize properties into /tmp/LTL1835073814064493790.ltl : 158 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7626143625562190554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1835073814064493790.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&(...9877
Formula 0 simplified : XF!"((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&((m...9871
Detected timeout of ITS tools.
[2023-03-16 19:59:40] [INFO ] Flatten gal took : 50 ms
[2023-03-16 19:59:40] [INFO ] Applying decomposition
[2023-03-16 19:59:40] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9929860325385607756.txt' '-o' '/tmp/graph9929860325385607756.bin' '-w' '/tmp/graph9929860325385607756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9929860325385607756.bin' '-l' '-1' '-v' '-w' '/tmp/graph9929860325385607756.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:59:40] [INFO ] Decomposing Gal with order
[2023-03-16 19:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:59:40] [INFO ] Removed a total of 228 redundant transitions.
[2023-03-16 19:59:40] [INFO ] Flatten gal took : 308 ms
[2023-03-16 19:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 81 ms.
[2023-03-16 19:59:40] [INFO ] Time to serialize gal into /tmp/LTL8981984945339546324.gal : 34 ms
[2023-03-16 19:59:41] [INFO ] Time to serialize properties into /tmp/LTL6777874544486579193.ltl : 41 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8981984945339546324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6777874544486579193.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((((u0.malicious_reservoir<1)||(i34.i0.u91.s4_17<1))&&((u0.malicious_reservoir<1)||(i44.i1.u94.s4_20<1)))&&(((u0.malic...15920
Formula 0 simplified : XF!"((((((((((((u0.malicious_reservoir<1)||(i34.i0.u91.s4_17<1))&&((u0.malicious_reservoir<1)||(i44.i1.u94.s4_20<1)))&&(((u0.malicio...15914
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2775559005812870722
[2023-03-16 19:59:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2775559005812870722
Running compilation step : cd /tmp/ltsmin2775559005812870722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1248 ms.
Running link step : cd /tmp/ltsmin2775559005812870722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2775559005812870722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 129462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 20:00:11] [INFO ] Invariant cache hit.
[2023-03-16 20:00:13] [INFO ] Implicit Places using invariants in 2194 ms returned []
[2023-03-16 20:00:13] [INFO ] Invariant cache hit.
[2023-03-16 20:00:17] [INFO ] Implicit Places using invariants and state equation in 4493 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 6694 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6823 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3711 reset in 283 ms.
Product exploration explored 100000 steps with 3721 reset in 239 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 614 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1956403 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :{}
Probabilistic random walk after 1956403 steps, saw 266777 distinct states, run finished after 3001 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-16 20:00:22] [INFO ] Computed 1540 place invariants in 216 ms
[2023-03-16 20:00:23] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 298 ms returned sat
[2023-03-16 20:00:23] [INFO ] After 507ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:00:23] [INFO ] After 578ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-16 20:00:24] [INFO ] After 1154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 20:00:24] [INFO ] Invariant cache hit.
[2023-03-16 20:00:26] [INFO ] Implicit Places using invariants in 1947 ms returned []
[2023-03-16 20:00:26] [INFO ] Invariant cache hit.
[2023-03-16 20:00:30] [INFO ] Implicit Places using invariants and state equation in 3757 ms returned []
Implicit Place search using SMT with State Equation took 5705 ms to find 0 implicit places.
[2023-03-16 20:00:30] [INFO ] Invariant cache hit.
[2023-03-16 20:00:30] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6364 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1937484 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 1937484 steps, saw 264327 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:00:34] [INFO ] Invariant cache hit.
[2023-03-16 20:00:34] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 283 ms returned sat
[2023-03-16 20:00:35] [INFO ] After 511ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:00:35] [INFO ] After 579ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 20:00:35] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3715 reset in 228 ms.
Product exploration explored 100000 steps with 3711 reset in 247 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1340 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.8 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1295 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 92 rules in 144 ms. Remains 1295 /1893 variables (removed 598) and now considering 265/356 (removed 91) transitions.
[2023-03-16 20:00:36] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 265 rows 1295 cols
[2023-03-16 20:00:36] [INFO ] Computed 1034 place invariants in 13 ms
[2023-03-16 20:00:37] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1893 places, 265/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 1295/1893 places, 265/356 transitions.
Built C files in :
/tmp/ltsmin10547447780490601015
[2023-03-16 20:00:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10547447780490601015
Running compilation step : cd /tmp/ltsmin10547447780490601015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1158 ms.
Running link step : cd /tmp/ltsmin10547447780490601015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10547447780490601015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17047352694535550370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-16 20:00:52] [INFO ] Computed 1540 place invariants in 189 ms
[2023-03-16 20:00:54] [INFO ] Implicit Places using invariants in 2264 ms returned []
[2023-03-16 20:00:54] [INFO ] Invariant cache hit.
[2023-03-16 20:00:58] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 6218 ms to find 0 implicit places.
[2023-03-16 20:00:58] [INFO ] Invariant cache hit.
[2023-03-16 20:00:59] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6917 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin13921831077437284249
[2023-03-16 20:00:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13921831077437284249
Running compilation step : cd /tmp/ltsmin13921831077437284249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1278 ms.
Running link step : cd /tmp/ltsmin13921831077437284249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13921831077437284249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12393685255256891757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:01:14] [INFO ] Flatten gal took : 40 ms
[2023-03-16 20:01:14] [INFO ] Flatten gal took : 39 ms
[2023-03-16 20:01:14] [INFO ] Time to serialize gal into /tmp/LTL4607608501878667839.gal : 6 ms
[2023-03-16 20:01:14] [INFO ] Time to serialize properties into /tmp/LTL17983583094626360811.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4607608501878667839.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5818570371328602204.hoa' '-atoms' '/tmp/LTL17983583094626360811.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17983583094626360811.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5818570371328602204.hoa
Detected timeout of ITS tools.
[2023-03-16 20:01:29] [INFO ] Flatten gal took : 36 ms
[2023-03-16 20:01:29] [INFO ] Flatten gal took : 36 ms
[2023-03-16 20:01:29] [INFO ] Time to serialize gal into /tmp/LTL9916076139360953676.gal : 8 ms
[2023-03-16 20:01:29] [INFO ] Time to serialize properties into /tmp/LTL16738586504733028979.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9916076139360953676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16738586504733028979.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(a4<1)"))))
Formula 0 simplified : XF!"(a4<1)"
Detected timeout of ITS tools.
[2023-03-16 20:01:44] [INFO ] Flatten gal took : 37 ms
[2023-03-16 20:01:44] [INFO ] Applying decomposition
[2023-03-16 20:01:44] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4415924347270710443.txt' '-o' '/tmp/graph4415924347270710443.bin' '-w' '/tmp/graph4415924347270710443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4415924347270710443.bin' '-l' '-1' '-v' '-w' '/tmp/graph4415924347270710443.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:01:45] [INFO ] Decomposing Gal with order
[2023-03-16 20:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:01:45] [INFO ] Removed a total of 229 redundant transitions.
[2023-03-16 20:01:45] [INFO ] Flatten gal took : 97 ms
[2023-03-16 20:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 29 ms.
[2023-03-16 20:01:45] [INFO ] Time to serialize gal into /tmp/LTL14304640905382781892.gal : 13 ms
[2023-03-16 20:01:45] [INFO ] Time to serialize properties into /tmp/LTL13105710405081824686.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14304640905382781892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13105710405081824686.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("(i31.i1.u63.a4<1)"))))
Formula 0 simplified : XF!"(i31.i1.u63.a4<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4675614719610692678
[2023-03-16 20:02:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4675614719610692678
Running compilation step : cd /tmp/ltsmin4675614719610692678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1187 ms.
Running link step : cd /tmp/ltsmin4675614719610692678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4675614719610692678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-04 finished in 124281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Applied a total of 93 rules in 153 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2023-03-16 20:02:15] [INFO ] Computed 1056 place invariants in 14 ms
[2023-03-16 20:02:16] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2023-03-16 20:02:16] [INFO ] Invariant cache hit.
[2023-03-16 20:02:19] [INFO ] Implicit Places using invariants and state equation in 2240 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 3510 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 55 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3718 ms. Remains : 1270/1916 places, 262/356 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s110 1) (AND (GEQ s111 1) (GEQ s1180 1) (GEQ s1181 1) (GEQ s1188 1) (GEQ s1189 1) (GEQ s1190 1) (GEQ s1191 1) (GEQ s1192 1) (GEQ s1193 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-06 finished in 3802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1387 are kept as prefixes of interest. Removing 529 places using SCC suffix rule.5 ms
Discarding 529 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
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 1340 transition count 264
Applied a total of 94 rules in 161 ms. Remains 1340 /1916 variables (removed 576) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1340 cols
[2023-03-16 20:02:19] [INFO ] Computed 1078 place invariants in 14 ms
[2023-03-16 20:02:20] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-16 20:02:20] [INFO ] Invariant cache hit.
[2023-03-16 20:02:23] [INFO ] Implicit Places using invariants and state equation in 2646 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 3873 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1916 places, 264/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1294 /1294 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4082 ms. Remains : 1294/1916 places, 264/356 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3473 reset in 270 ms.
Product exploration explored 100000 steps with 3471 reset in 277 ms.
Computed a total of 1294 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 264
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-08 finished in 5014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U X(X(p0)))||X(X(p1))))'
Support contains 26 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 20:02:24] [INFO ] Computed 1562 place invariants in 17 ms
[2023-03-16 20:02:26] [INFO ] Implicit Places using invariants in 2020 ms returned []
[2023-03-16 20:02:26] [INFO ] Invariant cache hit.
[2023-03-16 20:02:30] [INFO ] Implicit Places using invariants and state equation in 3627 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 5651 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1916 places, 356/356 transitions.
Applied a total of 0 rules in 76 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 5800 ms. Remains : 1894/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 6}], [{ cond=p0, acceptance={} source=8 dest: 5}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(AND (GEQ s867 1) (GEQ s868 1) (GEQ s869 1) (GEQ s870 1) (GEQ s874 1) (GEQ s973 1) (GEQ s974 1) (GEQ s979 1) (GEQ s980 1) (GEQ s981 1) (GEQ s982 1) (GE...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3716 reset in 258 ms.
Product exploration explored 100000 steps with 3713 reset in 251 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1893747 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1893747 steps, saw 257264 distinct states, run finished after 3003 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 356 rows 1894 cols
[2023-03-16 20:02:34] [INFO ] Computed 1540 place invariants in 22 ms
[2023-03-16 20:02:35] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 288 ms returned sat
[2023-03-16 20:02:35] [INFO ] After 714ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:02:36] [INFO ] After 921ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-16 20:02:36] [INFO ] After 1614ms SMT Verify possible using all constraints in real 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Support contains 24 out of 1894 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 20:02:36] [INFO ] Invariant cache hit.
[2023-03-16 20:02:38] [INFO ] Implicit Places using invariants in 1920 ms returned []
[2023-03-16 20:02:38] [INFO ] Invariant cache hit.
[2023-03-16 20:02:42] [INFO ] Implicit Places using invariants and state equation in 3847 ms returned []
Implicit Place search using SMT with State Equation took 5771 ms to find 0 implicit places.
[2023-03-16 20:02:42] [INFO ] Invariant cache hit.
[2023-03-16 20:02:43] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6460 ms. Remains : 1894/1894 places, 356/356 transitions.
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 : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1909913 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1909913 steps, saw 259961 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:02:46] [INFO ] Invariant cache hit.
[2023-03-16 20:02:47] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 288 ms returned sat
[2023-03-16 20:02:47] [INFO ] After 709ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:02:48] [INFO ] After 911ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-16 20:02:48] [INFO ] After 1615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 98 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=98 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3712 reset in 231 ms.
Product exploration explored 100000 steps with 3710 reset in 256 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0]
Support contains 24 out of 1894 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Graph (complete) has 14749 edges and 1894 vertex of which 1341 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.7 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1296 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1296 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1296 transition count 266
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 93 rules in 115 ms. Remains 1296 /1894 variables (removed 598) and now considering 266/356 (removed 90) transitions.
[2023-03-16 20:02:49] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 266 rows 1296 cols
[2023-03-16 20:02:49] [INFO ] Computed 1034 place invariants in 7 ms
[2023-03-16 20:02:49] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1894 places, 266/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 1296/1894 places, 266/356 transitions.
Built C files in :
/tmp/ltsmin1976629153490513068
[2023-03-16 20:02:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1976629153490513068
Running compilation step : cd /tmp/ltsmin1976629153490513068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1208 ms.
Running link step : cd /tmp/ltsmin1976629153490513068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1976629153490513068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18100063154138242710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 1894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2023-03-16 20:03:05] [INFO ] Computed 1540 place invariants in 19 ms
[2023-03-16 20:03:07] [INFO ] Implicit Places using invariants in 2180 ms returned []
[2023-03-16 20:03:07] [INFO ] Invariant cache hit.
[2023-03-16 20:03:11] [INFO ] Implicit Places using invariants and state equation in 4076 ms returned []
Implicit Place search using SMT with State Equation took 6258 ms to find 0 implicit places.
[2023-03-16 20:03:11] [INFO ] Invariant cache hit.
[2023-03-16 20:03:12] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6947 ms. Remains : 1894/1894 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin2746936708154851653
[2023-03-16 20:03:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2746936708154851653
Running compilation step : cd /tmp/ltsmin2746936708154851653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1225 ms.
Running link step : cd /tmp/ltsmin2746936708154851653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2746936708154851653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16389751015415418196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:03:27] [INFO ] Flatten gal took : 38 ms
[2023-03-16 20:03:27] [INFO ] Flatten gal took : 35 ms
[2023-03-16 20:03:27] [INFO ] Time to serialize gal into /tmp/LTL3209799977339858376.gal : 6 ms
[2023-03-16 20:03:27] [INFO ] Time to serialize properties into /tmp/LTL15616276640542587707.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3209799977339858376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11314946501785380367.hoa' '-atoms' '/tmp/LTL15616276640542587707.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15616276640542587707.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11314946501785380367.hoa
Detected timeout of ITS tools.
[2023-03-16 20:03:42] [INFO ] Flatten gal took : 34 ms
[2023-03-16 20:03:42] [INFO ] Flatten gal took : 34 ms
[2023-03-16 20:03:42] [INFO ] Time to serialize gal into /tmp/LTL8896684003134670716.gal : 5 ms
[2023-03-16 20:03:42] [INFO ] Time to serialize properties into /tmp/LTL10130236397877042249.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8896684003134670716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10130236397877042249.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!((!("((((((n7_1_10>=1)&&(n7_2_10>=1))&&((n7_3_10>=1)&&(n7_4_10>=1)))&&(((n7_0_10>=1)&&(n7_21_10>=1))&&((n7_22_10>=1)&&(n7_16_10>=...888
Formula 0 simplified : (!"((((((n7_1_10>=1)&&(n7_2_10>=1))&&((n7_3_10>=1)&&(n7_4_10>=1)))&&(((n7_0_10>=1)&&(n7_21_10>=1))&&((n7_22_10>=1)&&(n7_16_10>=1))))...870
Detected timeout of ITS tools.
[2023-03-16 20:03:57] [INFO ] Flatten gal took : 35 ms
[2023-03-16 20:03:57] [INFO ] Applying decomposition
[2023-03-16 20:03:57] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7469809218978341918.txt' '-o' '/tmp/graph7469809218978341918.bin' '-w' '/tmp/graph7469809218978341918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7469809218978341918.bin' '-l' '-1' '-v' '-w' '/tmp/graph7469809218978341918.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:03:57] [INFO ] Decomposing Gal with order
[2023-03-16 20:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:03:57] [INFO ] Removed a total of 229 redundant transitions.
[2023-03-16 20:03:57] [INFO ] Flatten gal took : 98 ms
[2023-03-16 20:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 31 ms.
[2023-03-16 20:03:57] [INFO ] Time to serialize gal into /tmp/LTL4034197816960349296.gal : 12 ms
[2023-03-16 20:03:57] [INFO ] Time to serialize properties into /tmp/LTL8646661930872428382.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4034197816960349296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8646661930872428382.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((!((!("((((((i28.u24.n7_1_10>=1)&&(i42.i0.u37.n7_2_10>=1))&&((i41.i1.u25.n7_3_10>=1)&&(i17.i0.u26.n7_4_10>=1)))&&(((i27.u75.n7_0_10...1400
Formula 0 simplified : (!"((((((i28.u24.n7_1_10>=1)&&(i42.i0.u37.n7_2_10>=1))&&((i41.i1.u25.n7_3_10>=1)&&(i17.i0.u26.n7_4_10>=1)))&&(((i27.u75.n7_0_10>=1)&...1382
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17389386218805954281
[2023-03-16 20:04:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17389386218805954281
Running compilation step : cd /tmp/ltsmin17389386218805954281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1196 ms.
Running link step : cd /tmp/ltsmin17389386218805954281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17389386218805954281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(!(LTLAPp0==true) U X(X((LTLAPp0==true))))||X(X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-10 finished in 123756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 20:04:28] [INFO ] Computed 1562 place invariants in 16 ms
[2023-03-16 20:04:30] [INFO ] Implicit Places using invariants in 2019 ms returned []
[2023-03-16 20:04:30] [INFO ] Invariant cache hit.
[2023-03-16 20:04:34] [INFO ] Implicit Places using invariants and state equation in 3918 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 5949 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 54 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 6068 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-11 finished in 6169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&(p1 U (p2 U p3))))))'
Support contains 5 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 3 place count 1891 transition count 353
Applied a total of 3 rules in 165 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-16 20:04:34] [INFO ] Computed 1540 place invariants in 18 ms
[2023-03-16 20:04:36] [INFO ] Implicit Places using invariants in 2057 ms returned []
[2023-03-16 20:04:36] [INFO ] Invariant cache hit.
[2023-03-16 20:04:40] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned [1153, 1154, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1179, 1181, 1182, 1183, 1184]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5717 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5954 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (NOT p3), (AND p1 (NOT p3) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12 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 p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s155 1), p0:(GEQ s1866 1), p3:(AND (GEQ s0 1) (GEQ s19 1)), p2:(AND (GEQ s0 1) (GEQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 6350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 20:04:40] [INFO ] Computed 1562 place invariants in 19 ms
[2023-03-16 20:04:42] [INFO ] Implicit Places using invariants in 2180 ms returned []
[2023-03-16 20:04:42] [INFO ] Invariant cache hit.
[2023-03-16 20:04:46] [INFO ] Implicit Places using invariants and state equation in 3378 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 5570 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 55 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 5687 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s65 1) (GEQ s1243 1) (GEQ s1263 1) (GEQ s1287 1) (GEQ s1309 1) (GEQ s1324 1) (GEQ s1350 1) (GEQ s1368 1) (GEQ s1376 1) (GEQ s1393 1) (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-13 finished in 5808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1387 are kept as prefixes of interest. Removing 529 places using SCC suffix rule.4 ms
Discarding 529 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
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1341 transition count 265
Applied a total of 93 rules in 125 ms. Remains 1341 /1916 variables (removed 575) and now considering 265/356 (removed 91) transitions.
// Phase 1: matrix 265 rows 1341 cols
[2023-03-16 20:04:46] [INFO ] Computed 1078 place invariants in 13 ms
[2023-03-16 20:04:47] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-16 20:04:47] [INFO ] Invariant cache hit.
[2023-03-16 20:04:50] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned [581, 582, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 607, 609, 610, 611, 612, 1277, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3514 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1916 places, 265/356 transitions.
Applied a total of 0 rules in 42 ms. Remains 1295 /1295 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3681 ms. Remains : 1295/1916 places, 265/356 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s112 1) (GEQ s1182 1) (GEQ s1183 1) (GEQ s1190 1) (GEQ s1191 1) (GEQ s1192 1) (GEQ s1193 1) (GEQ s1194 1) (GEQ s1195 1) (GEQ s1196 1) (GEQ s1...], nbAcceptance=2, 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 30 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-15 finished in 3742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLFireability-03
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 ms
Discarding 24 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 87 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2023-03-16 20:04:50] [INFO ] Computed 1540 place invariants in 16 ms
[2023-03-16 20:04:51] [INFO ] Implicit Places using invariants in 1593 ms returned []
[2023-03-16 20:04:51] [INFO ] Invariant cache hit.
[2023-03-16 20:04:54] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned [1848, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4165 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 42 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4295 ms. Remains : 1866/1916 places, 351/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s84 1)) (OR (LT s0 1) (LT s85 1)) (OR (LT s0 1) (LT s82 1)) (OR (LT s0 1) (LT s83 1)) (OR (LT s0 1) (LT s80 1)) (OR (LT s0 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3475 reset in 572 ms.
Product exploration explored 100000 steps with 3472 reset in 600 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1633477 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :{}
Probabilistic random walk after 1633477 steps, saw 226210 distinct states, run finished after 3001 ms. (steps per millisecond=544 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 351 rows 1866 cols
[2023-03-16 20:04:59] [INFO ] Computed 1518 place invariants in 27 ms
[2023-03-16 20:05:00] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 282 ms returned sat
[2023-03-16 20:05:01] [INFO ] After 1573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:05:01] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 283 ms returned sat
[2023-03-16 20:05:02] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:05:03] [INFO ] After 1813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1362 ms.
[2023-03-16 20:05:04] [INFO ] After 3682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 30 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-16 20:05:05] [INFO ] Invariant cache hit.
[2023-03-16 20:05:06] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2023-03-16 20:05:06] [INFO ] Invariant cache hit.
[2023-03-16 20:05:09] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 4022 ms to find 0 implicit places.
[2023-03-16 20:05:09] [INFO ] Invariant cache hit.
[2023-03-16 20:05:09] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4656 ms. Remains : 1866/1866 places, 351/351 transitions.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1649818 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1649818 steps, saw 228095 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:05:13] [INFO ] Invariant cache hit.
[2023-03-16 20:05:14] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 283 ms returned sat
[2023-03-16 20:05:15] [INFO ] After 1656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:05:15] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 279 ms returned sat
[2023-03-16 20:05:16] [INFO ] After 1023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:05:17] [INFO ] After 1706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 897 ms.
[2023-03-16 20:05:18] [INFO ] After 3105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3467 reset in 578 ms.
Product exploration explored 100000 steps with 3473 reset in 600 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 44 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-16 20:05:20] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-16 20:05:20] [INFO ] Invariant cache hit.
[2023-03-16 20:05:21] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 1866/1866 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin12214862866144827605
[2023-03-16 20:05:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12214862866144827605
Running compilation step : cd /tmp/ltsmin12214862866144827605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1255 ms.
Running link step : cd /tmp/ltsmin12214862866144827605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12214862866144827605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15538435413171345960.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 29 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-16 20:05:36] [INFO ] Invariant cache hit.
[2023-03-16 20:05:37] [INFO ] Implicit Places using invariants in 1577 ms returned []
[2023-03-16 20:05:37] [INFO ] Invariant cache hit.
[2023-03-16 20:05:40] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 3967 ms to find 0 implicit places.
[2023-03-16 20:05:40] [INFO ] Invariant cache hit.
[2023-03-16 20:05:40] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4593 ms. Remains : 1866/1866 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin16750582307766787290
[2023-03-16 20:05:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16750582307766787290
Running compilation step : cd /tmp/ltsmin16750582307766787290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1258 ms.
Running link step : cd /tmp/ltsmin16750582307766787290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16750582307766787290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14355853474601666988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:05:55] [INFO ] Flatten gal took : 35 ms
[2023-03-16 20:05:55] [INFO ] Flatten gal took : 34 ms
[2023-03-16 20:05:55] [INFO ] Time to serialize gal into /tmp/LTL9537090600107795934.gal : 6 ms
[2023-03-16 20:05:55] [INFO ] Time to serialize properties into /tmp/LTL16161525765606116334.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9537090600107795934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5856889751688111355.hoa' '-atoms' '/tmp/LTL16161525765606116334.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16161525765606116334.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5856889751688111355.hoa
Detected timeout of ITS tools.
[2023-03-16 20:06:11] [INFO ] Flatten gal took : 37 ms
[2023-03-16 20:06:11] [INFO ] Flatten gal took : 36 ms
[2023-03-16 20:06:11] [INFO ] Time to serialize gal into /tmp/LTL3179246244982659786.gal : 6 ms
[2023-03-16 20:06:11] [INFO ] Time to serialize properties into /tmp/LTL7794458530433496996.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3179246244982659786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7794458530433496996.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&(...9877
Formula 0 simplified : XF!"((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&((m...9871
Detected timeout of ITS tools.
[2023-03-16 20:06:26] [INFO ] Flatten gal took : 39 ms
[2023-03-16 20:06:26] [INFO ] Applying decomposition
[2023-03-16 20:06:26] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8859865837167826354.txt' '-o' '/tmp/graph8859865837167826354.bin' '-w' '/tmp/graph8859865837167826354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8859865837167826354.bin' '-l' '-1' '-v' '-w' '/tmp/graph8859865837167826354.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:06:26] [INFO ] Decomposing Gal with order
[2023-03-16 20:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:06:26] [INFO ] Removed a total of 253 redundant transitions.
[2023-03-16 20:06:26] [INFO ] Flatten gal took : 109 ms
[2023-03-16 20:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 33 ms.
[2023-03-16 20:06:26] [INFO ] Time to serialize gal into /tmp/LTL3450177445141454392.gal : 11 ms
[2023-03-16 20:06:26] [INFO ] Time to serialize properties into /tmp/LTL8331044187892923195.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3450177445141454392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8331044187892923195.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((((u0.malicious_reservoir<1)||(i44.u44.s4_17<1))&&((u0.malicious_reservoir<1)||(i30.u81.s4_20<1)))&&(((u0.malicious_r...14528
Formula 0 simplified : XF!"((((((((((((u0.malicious_reservoir<1)||(i44.u44.s4_17<1))&&((u0.malicious_reservoir<1)||(i30.u81.s4_20<1)))&&(((u0.malicious_res...14522
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17820307907209479686
[2023-03-16 20:06:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17820307907209479686
Running compilation step : cd /tmp/ltsmin17820307907209479686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1228 ms.
Running link step : cd /tmp/ltsmin17820307907209479686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17820307907209479686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 126696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLFireability-04
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Applied a total of 93 rules in 117 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2023-03-16 20:06:57] [INFO ] Computed 1056 place invariants in 12 ms
[2023-03-16 20:06:58] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2023-03-16 20:06:58] [INFO ] Invariant cache hit.
[2023-03-16 20:07:00] [INFO ] Implicit Places using invariants and state equation in 2279 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 3476 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 40 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3635 ms. Remains : 1270/1916 places, 262/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3472 reset in 260 ms.
Product exploration explored 100000 steps with 3480 reset in 287 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 : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 345 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 2537346 steps, run timeout after 3001 ms. (steps per millisecond=845 ) properties seen :{}
Probabilistic random walk after 2537346 steps, saw 346595 distinct states, run finished after 3001 ms. (steps per millisecond=845 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 1270 cols
[2023-03-16 20:07:04] [INFO ] Computed 1012 place invariants in 18 ms
[2023-03-16 20:07:04] [INFO ] [Real]Absence check using 0 positive and 1012 generalized place invariants in 185 ms returned sat
[2023-03-16 20:07:05] [INFO ] After 325ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:07:05] [INFO ] After 375ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 20:07:05] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 64 ms :[true, p0, p0]
Support contains 1 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 33 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-16 20:07:05] [INFO ] Invariant cache hit.
[2023-03-16 20:07:07] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2023-03-16 20:07:07] [INFO ] Invariant cache hit.
[2023-03-16 20:07:09] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
[2023-03-16 20:07:09] [INFO ] Invariant cache hit.
[2023-03-16 20:07:09] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3955 ms. Remains : 1270/1270 places, 262/262 transitions.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 2288117 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :{}
Probabilistic random walk after 2288117 steps, saw 317285 distinct states, run finished after 3001 ms. (steps per millisecond=762 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:07:13] [INFO ] Invariant cache hit.
[2023-03-16 20:07:13] [INFO ] [Real]Absence check using 0 positive and 1012 generalized place invariants in 180 ms returned sat
[2023-03-16 20:07:13] [INFO ] After 316ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 20:07:13] [INFO ] After 370ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-16 20:07:14] [INFO ] After 746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 59 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3481 reset in 280 ms.
Product exploration explored 100000 steps with 3475 reset in 298 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Support contains 1 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 46 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-16 20:07:15] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-16 20:07:15] [INFO ] Invariant cache hit.
[2023-03-16 20:07:15] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin4310457826004925514
[2023-03-16 20:07:15] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4310457826004925514
Running compilation step : cd /tmp/ltsmin4310457826004925514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 817 ms.
Running link step : cd /tmp/ltsmin4310457826004925514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4310457826004925514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4072015007711617393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 32 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-16 20:07:30] [INFO ] Invariant cache hit.
[2023-03-16 20:07:32] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2023-03-16 20:07:32] [INFO ] Invariant cache hit.
[2023-03-16 20:07:34] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
[2023-03-16 20:07:34] [INFO ] Invariant cache hit.
[2023-03-16 20:07:34] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3834 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin2104039124645601290
[2023-03-16 20:07:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2104039124645601290
Running compilation step : cd /tmp/ltsmin2104039124645601290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 801 ms.
Running link step : cd /tmp/ltsmin2104039124645601290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2104039124645601290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17370588331608979746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:07:49] [INFO ] Flatten gal took : 23 ms
[2023-03-16 20:07:49] [INFO ] Flatten gal took : 22 ms
[2023-03-16 20:07:49] [INFO ] Time to serialize gal into /tmp/LTL14384848500653453521.gal : 3 ms
[2023-03-16 20:07:49] [INFO ] Time to serialize properties into /tmp/LTL115546621226663167.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14384848500653453521.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1582167424654556928.hoa' '-atoms' '/tmp/LTL115546621226663167.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL115546621226663167.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1582167424654556928.hoa
Detected timeout of ITS tools.
[2023-03-16 20:08:04] [INFO ] Flatten gal took : 27 ms
[2023-03-16 20:08:04] [INFO ] Flatten gal took : 28 ms
[2023-03-16 20:08:04] [INFO ] Time to serialize gal into /tmp/LTL18397965000037810509.gal : 3 ms
[2023-03-16 20:08:04] [INFO ] Time to serialize properties into /tmp/LTL6159348791662475268.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18397965000037810509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6159348791662475268.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(a4<1)"))))
Formula 0 simplified : XF!"(a4<1)"
Detected timeout of ITS tools.
[2023-03-16 20:08:19] [INFO ] Flatten gal took : 22 ms
[2023-03-16 20:08:19] [INFO ] Applying decomposition
[2023-03-16 20:08:20] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2246749359867677584.txt' '-o' '/tmp/graph2246749359867677584.bin' '-w' '/tmp/graph2246749359867677584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2246749359867677584.bin' '-l' '-1' '-v' '-w' '/tmp/graph2246749359867677584.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:08:20] [INFO ] Decomposing Gal with order
[2023-03-16 20:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:08:20] [INFO ] Removed a total of 184 redundant transitions.
[2023-03-16 20:08:20] [INFO ] Flatten gal took : 42 ms
[2023-03-16 20:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 10 ms.
[2023-03-16 20:08:20] [INFO ] Time to serialize gal into /tmp/LTL17664097625626745568.gal : 6 ms
[2023-03-16 20:08:20] [INFO ] Time to serialize properties into /tmp/LTL12991883521569064337.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17664097625626745568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12991883521569064337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("(i20.u28.a4<1)"))))
Formula 0 simplified : XF!"(i20.u28.a4<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10951332108070127855
[2023-03-16 20:08:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10951332108070127855
Running compilation step : cd /tmp/ltsmin10951332108070127855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 791 ms.
Running link step : cd /tmp/ltsmin10951332108070127855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10951332108070127855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-04 finished in 113532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U X(X(p0)))||X(X(p1))))'
[2023-03-16 20:08:50] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13289012145243245918
[2023-03-16 20:08:50] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2023-03-16 20:08:50] [INFO ] Applying decomposition
[2023-03-16 20:08:50] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:08:50] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2023-03-16 20:08:50] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:08:50] [INFO ] Flatten gal took : 36 ms
[2023-03-16 20:08:50] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2023-03-16 20:08:50] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:08:50] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13289012145243245918
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph805254896877965606.txt' '-o' '/tmp/graph805254896877965606.bin' '-w' '/tmp/graph805254896877965606.weights'
Running compilation step : cd /tmp/ltsmin13289012145243245918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph805254896877965606.bin' '-l' '-1' '-v' '-w' '/tmp/graph805254896877965606.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:08:50] [INFO ] Decomposing Gal with order
[2023-03-16 20:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:08:50] [INFO ] Removed a total of 229 redundant transitions.
[2023-03-16 20:08:50] [INFO ] Flatten gal took : 92 ms
[2023-03-16 20:08:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 35 ms.
[2023-03-16 20:08:50] [INFO ] Time to serialize gal into /tmp/LTLFireability14786634222928689178.gal : 13 ms
[2023-03-16 20:08:50] [INFO ] Time to serialize properties into /tmp/LTLFireability6172781716022488908.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14786634222928689178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6172781716022488908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(G("((((((((((((u0.malicious_reservoir<1)||(i21.i0.u47.s4_17<1))&&((u0.malicious_reservoir<1)||(i44.i1.u91.s4_20<1)))&&(((u0.malic...15872
Formula 0 simplified : XF!"((((((((((((u0.malicious_reservoir<1)||(i21.i0.u47.s4_17<1))&&((u0.malicious_reservoir<1)||(i44.i1.u91.s4_20<1)))&&(((u0.malicio...15866
Compilation finished in 1470 ms.
Running link step : cd /tmp/ltsmin13289012145243245918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13289012145243245918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.021: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.300: DFS-FIFO for weak LTL, using special progress label 361
pins2lts-mc-linux64( 0/ 8), 0.300: There are 362 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.300: State length is 1917, there are 360 groups
pins2lts-mc-linux64( 0/ 8), 0.300: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.300: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.300: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.300: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.509: ~1 levels ~960 states ~23360 transitions
pins2lts-mc-linux64( 4/ 8), 0.686: ~1 levels ~1920 states ~52216 transitions
pins2lts-mc-linux64( 4/ 8), 0.910: ~1 levels ~3840 states ~101328 transitions
pins2lts-mc-linux64( 5/ 8), 1.398: ~1 levels ~7680 states ~171504 transitions
pins2lts-mc-linux64( 2/ 8), 2.159: ~1 levels ~15360 states ~354984 transitions
pins2lts-mc-linux64( 2/ 8), 3.774: ~1 levels ~30720 states ~767096 transitions
pins2lts-mc-linux64( 2/ 8), 6.523: ~1 levels ~61440 states ~1615632 transitions
pins2lts-mc-linux64( 2/ 8), 11.060: ~1 levels ~122880 states ~3139328 transitions
pins2lts-mc-linux64( 2/ 8), 19.915: ~1 levels ~245760 states ~6414208 transitions
pins2lts-mc-linux64( 2/ 8), 40.308: ~1 levels ~491520 states ~14308104 transitions
pins2lts-mc-linux64( 2/ 8), 80.929: ~1 levels ~983040 states ~30164696 transitions
pins2lts-mc-linux64( 2/ 8), 167.966: ~1 levels ~1966080 states ~64405608 transitions
pins2lts-mc-linux64( 2/ 8), 344.937: ~1 levels ~3932160 states ~134672088 transitions
pins2lts-mc-linux64( 2/ 8), 691.506: ~1 levels ~7864320 states ~263593688 transitions
pins2lts-mc-linux64( 2/ 8), 959.034: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 964.747:
pins2lts-mc-linux64( 0/ 8), 964.747: mean standard work distribution: 3.0% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 964.747:
pins2lts-mc-linux64( 0/ 8), 964.747: Explored 9968408 states 374126079 transitions, fanout: 37.531
pins2lts-mc-linux64( 0/ 8), 964.747: Total exploration time 964.400 sec (958.700 sec minimum, 959.685 sec on average)
pins2lts-mc-linux64( 0/ 8), 964.747: States per second: 10336, Transitions per second: 387937
pins2lts-mc-linux64( 0/ 8), 964.747:
pins2lts-mc-linux64( 0/ 8), 964.747: Progress states detected: 73073930
pins2lts-mc-linux64( 0/ 8), 964.747: Redundant explorations: -86.3585
pins2lts-mc-linux64( 0/ 8), 964.747:
pins2lts-mc-linux64( 0/ 8), 964.747: Queue width: 8B, total height: 83734979, memory: 638.85MB
pins2lts-mc-linux64( 0/ 8), 964.747: Tree memory: 813.5MB, 11.7 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 964.747: Tree fill ratio (roots/leafs): 54.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 964.747: Stored 358 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 964.763: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 964.769: Est. total memory use: 1452.4MB (~1662.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13289012145243245918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13289012145243245918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 20:32:41] [INFO ] Flatten gal took : 349 ms
[2023-03-16 20:32:41] [INFO ] Time to serialize gal into /tmp/LTLFireability10411151245418998120.gal : 37 ms
[2023-03-16 20:32:41] [INFO ] Time to serialize properties into /tmp/LTLFireability17394644269714218927.ltl : 17 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10411151245418998120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17394644269714218927.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((X(G("((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&(...9877
Formula 0 simplified : XF!"((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&((m...9871
Detected timeout of ITS tools.
[2023-03-16 20:56:34] [INFO ] Flatten gal took : 946 ms
[2023-03-16 20:56:35] [INFO ] Input system was already deterministic with 356 transitions.
[2023-03-16 20:56:35] [INFO ] Transformed 1916 places.
[2023-03-16 20:56:35] [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
[2023-03-16 20:56:35] [INFO ] Time to serialize gal into /tmp/LTLFireability3329014260723180286.gal : 18 ms
[2023-03-16 20:56:35] [INFO ] Time to serialize properties into /tmp/LTLFireability10917461465885074216.ltl : 10 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3329014260723180286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10917461465885074216.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&(...9877
Formula 0 simplified : XF!"((((((((((((malicious_reservoir<1)||(s4_17<1))&&((malicious_reservoir<1)||(s4_20<1)))&&(((malicious_reservoir<1)||(s4_7<1))&&((m...9871
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14661212 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15959836 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873946000892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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