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-167873945900827.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-COL-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:23 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 3.8K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678980009763

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 15:20:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 15:20:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 15:20:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 15:20:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 15:20:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 501 ms
[2023-03-16 15:20:12] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 15:20:12] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 11 ms.
[2023-03-16 15:20:12] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10005 steps, including 370 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 15:20:13] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-16 15:20:13] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 15:20:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 15:20:13] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-16 15:20:13] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 15:20:13] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 6 different solutions.
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
Parikh walk visited 9 properties in 17 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-16 15:20:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-16 15:20:14] [INFO ] Flatten gal took : 107 ms
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 15:20:14] [INFO ] Flatten gal took : 9 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2023-03-16 15:20:14] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 21 ms.
[2023-03-16 15:20:14] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 844 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1377 transition count 296
Applied a total of 21 rules in 64 ms. Remains 1377 /1398 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1377 cols
[2023-03-16 15:20:14] [INFO ] Computed 1082 place invariants in 42 ms
[2023-03-16 15:20:15] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2023-03-16 15:20:15] [INFO ] Invariant cache hit.
[2023-03-16 15:20:17] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2921 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1358/1398 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 1358 /1358 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3003 ms. Remains : 1358/1398 places, 296/296 transitions.
Support contains 844 out of 1358 places after structural reductions.
[2023-03-16 15:20:17] [INFO ] Flatten gal took : 86 ms
[2023-03-16 15:20:17] [INFO ] Flatten gal took : 62 ms
[2023-03-16 15:20:17] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 825 out of 1358 places (down from 844) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 296 rows 1358 cols
[2023-03-16 15:20:18] [INFO ] Computed 1063 place invariants in 92 ms
[2023-03-16 15:20:18] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-16 15:20:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 15:20:19] [INFO ] [Nat]Absence check using 1 positive and 1062 generalized place invariants in 166 ms returned sat
[2023-03-16 15:20:26] [INFO ] After 7205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-16 15:20:32] [INFO ] After 12991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5907 ms.
[2023-03-16 15:20:38] [INFO ] After 19618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 8 properties in 18 ms.
Computed a total of 1358 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1358 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1356 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1355 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1355 transition count 294
Applied a total of 5 rules in 212 ms. Remains 1355 /1358 variables (removed 3) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2023-03-16 15:20:39] [INFO ] Computed 1062 place invariants in 76 ms
[2023-03-16 15:20:40] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-16 15:20:40] [INFO ] Invariant cache hit.
[2023-03-16 15:20:42] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned [1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2929 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1358 places, 294/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3184 ms. Remains : 1336/1358 places, 294/296 transitions.
Stuttering acceptance computed with spot in 502 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1252 s1253 s1254 s1255)) (LEQ 1 s1)), p2:(AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6297 reset in 2016 ms.
Product exploration explored 100000 steps with 6241 reset in 1906 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-16 15:20:47] [INFO ] Computed 1044 place invariants in 114 ms
[2023-03-16 15:20:47] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:20:48] [INFO ] Invariant cache hit.
[2023-03-16 15:20:49] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 894 ms returned sat
[2023-03-16 15:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:20:52] [INFO ] [Real]Absence check using state equation in 2831 ms returned sat
[2023-03-16 15:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:20:53] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 914 ms returned sat
[2023-03-16 15:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:20:56] [INFO ] [Nat]Absence check using state equation in 3087 ms returned sat
[2023-03-16 15:20:57] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 50 ms.
[2023-03-16 15:20:57] [INFO ] Added : 15 causal constraints over 3 iterations in 326 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 40 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-16 15:20:57] [INFO ] Invariant cache hit.
[2023-03-16 15:20:58] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-16 15:20:58] [INFO ] Invariant cache hit.
[2023-03-16 15:21:00] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2023-03-16 15:21:00] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 15:21:00] [INFO ] Invariant cache hit.
[2023-03-16 15:21:00] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3177 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:21:01] [INFO ] Invariant cache hit.
[2023-03-16 15:21:02] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 924 ms returned sat
[2023-03-16 15:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:21:05] [INFO ] [Real]Absence check using state equation in 2682 ms returned sat
[2023-03-16 15:21:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:21:06] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 913 ms returned sat
[2023-03-16 15:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:21:09] [INFO ] [Nat]Absence check using state equation in 3010 ms returned sat
[2023-03-16 15:21:09] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 21 ms.
[2023-03-16 15:21:09] [INFO ] Added : 15 causal constraints over 3 iterations in 243 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6272 reset in 836 ms.
Product exploration explored 100000 steps with 6284 reset in 828 ms.
Built C files in :
/tmp/ltsmin3102593318318114183
[2023-03-16 15:21:11] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2023-03-16 15:21:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:11] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2023-03-16 15:21:11] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:11] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2023-03-16 15:21:11] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:11] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3102593318318114183
Running compilation step : cd /tmp/ltsmin3102593318318114183;'/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 1122 ms.
Running link step : cd /tmp/ltsmin3102593318318114183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3102593318318114183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2870650960919593984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 44 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-16 15:21:26] [INFO ] Invariant cache hit.
[2023-03-16 15:21:27] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-16 15:21:27] [INFO ] Invariant cache hit.
[2023-03-16 15:21:29] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2023-03-16 15:21:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 15:21:29] [INFO ] Invariant cache hit.
[2023-03-16 15:21:30] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3228 ms. Remains : 1336/1336 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin7238605263234966252
[2023-03-16 15:21:30] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2023-03-16 15:21:30] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:30] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2023-03-16 15:21:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:30] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2023-03-16 15:21:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:21:30] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7238605263234966252
Running compilation step : cd /tmp/ltsmin7238605263234966252;'/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 1005 ms.
Running link step : cd /tmp/ltsmin7238605263234966252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7238605263234966252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12485209921393152463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:21:45] [INFO ] Flatten gal took : 43 ms
[2023-03-16 15:21:45] [INFO ] Flatten gal took : 40 ms
[2023-03-16 15:21:45] [INFO ] Time to serialize gal into /tmp/LTL910001231447891028.gal : 7 ms
[2023-03-16 15:21:45] [INFO ] Time to serialize properties into /tmp/LTL16129416404133591511.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/LTL910001231447891028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1295626494653823997.hoa' '-atoms' '/tmp/LTL16129416404133591511.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/LTL16129416404133591511.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1295626494653823997.hoa
Detected timeout of ITS tools.
[2023-03-16 15:22:00] [INFO ] Flatten gal took : 37 ms
[2023-03-16 15:22:00] [INFO ] Flatten gal took : 35 ms
[2023-03-16 15:22:00] [INFO ] Time to serialize gal into /tmp/LTL7423087659236558095.gal : 11 ms
[2023-03-16 15:22:00] [INFO ] Time to serialize properties into /tmp/LTL9925861760479581256.ltl : 12 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/LTL7423087659236558095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9925861760479581256.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 : !((F(("(((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+((s3_16+...10361
Formula 0 simplified : G(!"(((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+((s3_16+s...6974
Detected timeout of ITS tools.
[2023-03-16 15:22:15] [INFO ] Flatten gal took : 43 ms
[2023-03-16 15:22:15] [INFO ] Applying decomposition
[2023-03-16 15:22:15] [INFO ] Flatten gal took : 44 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/graph5552382710398244943.txt' '-o' '/tmp/graph5552382710398244943.bin' '-w' '/tmp/graph5552382710398244943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5552382710398244943.bin' '-l' '-1' '-v' '-w' '/tmp/graph5552382710398244943.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:22:16] [INFO ] Decomposing Gal with order
[2023-03-16 15:22:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:22:16] [INFO ] Removed a total of 263 redundant transitions.
[2023-03-16 15:22:16] [INFO ] Flatten gal took : 276 ms
[2023-03-16 15:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 67 ms.
[2023-03-16 15:22:17] [INFO ] Time to serialize gal into /tmp/LTL14735671990217347885.gal : 61 ms
[2023-03-16 15:22:17] [INFO ] Time to serialize properties into /tmp/LTL11141808037496985289.ltl : 9 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/LTL14735671990217347885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11141808037496985289.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((gi1.gi26.gu59.s3_0+gi1.gi26.gu59.s3_1)+(gi1.gi26.gu59.s3_2+gi1.gi26.gu59.s3_3))+((gi1.gi26.gu59.s3_4+gi1.gi26.gu59.s3_5)...16353
Formula 0 simplified : G(!"(((((((gi1.gi26.gu59.s3_0+gi1.gi26.gu59.s3_1)+(gi1.gi26.gu59.s3_2+gi1.gi26.gu59.s3_3))+((gi1.gi26.gu59.s3_4+gi1.gi26.gu59.s3_5)+...11066
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17737030065503209222
[2023-03-16 15:22:32] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17737030065503209222
Running compilation step : cd /tmp/ltsmin17737030065503209222;'/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 993 ms.
Running link step : cd /tmp/ltsmin17737030065503209222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17737030065503209222;'/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' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 128806 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))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 559 are kept as prefixes of interest. Removing 799 places using SCC suffix rule.5 ms
Discarding 799 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 559 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 559 transition count 183
Applied a total of 58 rules in 30 ms. Remains 559 /1358 variables (removed 799) and now considering 183/296 (removed 113) transitions.
// Phase 1: matrix 183 rows 559 cols
[2023-03-16 15:22:47] [INFO ] Computed 378 place invariants in 4 ms
[2023-03-16 15:22:47] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 15:22:47] [INFO ] Invariant cache hit.
[2023-03-16 15:22:48] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-16 15:22:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 15:22:48] [INFO ] Invariant cache hit.
[2023-03-16 15:22:48] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1358 places, 183/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 903 ms. Remains : 559/1358 places, 183/296 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10679 reset in 850 ms.
Product exploration explored 100000 steps with 10625 reset in 875 ms.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 564 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 15:22:51] [INFO ] Invariant cache hit.
[2023-03-16 15:22:51] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 57 ms returned sat
[2023-03-16 15:22:51] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 15:22:51] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 55 ms returned sat
[2023-03-16 15:22:53] [INFO ] After 2084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 15:22:54] [INFO ] After 3164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1306 ms.
[2023-03-16 15:22:56] [INFO ] After 4633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 6 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-16 15:22:57] [INFO ] Invariant cache hit.
[2023-03-16 15:22:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-16 15:22:57] [INFO ] Invariant cache hit.
[2023-03-16 15:22:57] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-16 15:22:57] [INFO ] Invariant cache hit.
[2023-03-16 15:22:57] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 559/559 places, 183/183 transitions.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 397 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 15:22:58] [INFO ] Invariant cache hit.
[2023-03-16 15:22:58] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 59 ms returned sat
[2023-03-16 15:22:58] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 15:22:58] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 54 ms returned sat
[2023-03-16 15:23:01] [INFO ] After 2570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 15:23:02] [INFO ] After 3096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 791 ms.
[2023-03-16 15:23:02] [INFO ] After 4048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 413 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10683 reset in 759 ms.
Product exploration explored 100000 steps with 10611 reset in 770 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 13 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-16 15:23:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 15:23:06] [INFO ] Invariant cache hit.
[2023-03-16 15:23:06] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 559/559 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin9788951055158543911
[2023-03-16 15:23:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9788951055158543911
Running compilation step : cd /tmp/ltsmin9788951055158543911;'/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 485 ms.
Running link step : cd /tmp/ltsmin9788951055158543911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9788951055158543911;'/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/stateBased2073837861825973734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 5 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-16 15:23:21] [INFO ] Invariant cache hit.
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-16 15:23:21] [INFO ] Invariant cache hit.
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-16 15:23:22] [INFO ] Invariant cache hit.
[2023-03-16 15:23:22] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 559/559 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin6075183536218225231
[2023-03-16 15:23:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6075183536218225231
Running compilation step : cd /tmp/ltsmin6075183536218225231;'/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 483 ms.
Running link step : cd /tmp/ltsmin6075183536218225231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6075183536218225231;'/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/stateBased1162923069681989863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:23:37] [INFO ] Flatten gal took : 17 ms
[2023-03-16 15:23:37] [INFO ] Flatten gal took : 16 ms
[2023-03-16 15:23:37] [INFO ] Time to serialize gal into /tmp/LTL4373018372756289591.gal : 3 ms
[2023-03-16 15:23:37] [INFO ] Time to serialize properties into /tmp/LTL3449351080123344254.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/LTL4373018372756289591.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4231638264048513928.hoa' '-atoms' '/tmp/LTL3449351080123344254.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/LTL3449351080123344254.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4231638264048513928.hoa
Detected timeout of ITS tools.
[2023-03-16 15:23:52] [INFO ] Flatten gal took : 14 ms
[2023-03-16 15:23:52] [INFO ] Flatten gal took : 13 ms
[2023-03-16 15:23:52] [INFO ] Time to serialize gal into /tmp/LTL11137044811624287519.gal : 2 ms
[2023-03-16 15:23:52] [INFO ] Time to serialize properties into /tmp/LTL11348834628426476832.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/LTL11137044811624287519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11348834628426476832.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...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((n7_0+n7_1)+(n7_2+n7_3))+((n7_4+n7_5)+(n7_6+n7_7)))+(((n7_8+n7_9)+(n7_10+n7_11))+((n7_12+n7_13)+(n7_14+n7_15))))+(((...6510
Formula 0 simplified : FG!"((((((((((n7_0+n7_1)+(n7_2+n7_3))+((n7_4+n7_5)+(n7_6+n7_7)))+(((n7_8+n7_9)+(n7_10+n7_11))+((n7_12+n7_13)+(n7_14+n7_15))))+((((n7...6496
Detected timeout of ITS tools.
[2023-03-16 15:24:07] [INFO ] Flatten gal took : 14 ms
[2023-03-16 15:24:07] [INFO ] Applying decomposition
[2023-03-16 15:24:07] [INFO ] Flatten gal took : 12 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/graph13810195679304405719.txt' '-o' '/tmp/graph13810195679304405719.bin' '-w' '/tmp/graph13810195679304405719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13810195679304405719.bin' '-l' '-1' '-v' '-w' '/tmp/graph13810195679304405719.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:24:08] [INFO ] Decomposing Gal with order
[2023-03-16 15:24:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:24:08] [INFO ] Removed a total of 130 redundant transitions.
[2023-03-16 15:24:08] [INFO ] Flatten gal took : 23 ms
[2023-03-16 15:24:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 14 ms.
[2023-03-16 15:24:08] [INFO ] Time to serialize gal into /tmp/LTL2454646959633012391.gal : 3 ms
[2023-03-16 15:24:08] [INFO ] Time to serialize properties into /tmp/LTL370062728422260946.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/LTL2454646959633012391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL370062728422260946.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...274
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((gu2.n7_0+gu2.n7_1)+(gu2.n7_2+gu2.n7_3))+((gu2.n7_4+gu2.n7_5)+(gu2.n7_6+gu2.n7_7)))+(((gu2.n7_8+gu2.n7_9)+(gu2.n7_10...9756
Formula 0 simplified : FG!"((((((((((gu2.n7_0+gu2.n7_1)+(gu2.n7_2+gu2.n7_3))+((gu2.n7_4+gu2.n7_5)+(gu2.n7_6+gu2.n7_7)))+(((gu2.n7_8+gu2.n7_9)+(gu2.n7_10+gu...9742
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9142211683304892828
[2023-03-16 15:24:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9142211683304892828
Running compilation step : cd /tmp/ltsmin9142211683304892828;'/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 486 ms.
Running link step : cd /tmp/ltsmin9142211683304892828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9142211683304892828;'/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)))||(<>((LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-01 finished in 110818 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(p0)&&F(!p0)))'
Support contains 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 49 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 15:24:38] [INFO ] Computed 1044 place invariants in 78 ms
[2023-03-16 15:24:39] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2023-03-16 15:24:39] [INFO ] Invariant cache hit.
[2023-03-16 15:24:42] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
[2023-03-16 15:24:42] [INFO ] Invariant cache hit.
[2023-03-16 15:24:42] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4163 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102) s1336)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 4310 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((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1336 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 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 1335 transition count 293
Applied a total of 3 rules in 109 ms. Remains 1335 /1358 variables (removed 23) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2023-03-16 15:24:42] [INFO ] Computed 1044 place invariants in 17 ms
[2023-03-16 15:24:44] [INFO ] Implicit Places using invariants in 1356 ms returned []
[2023-03-16 15:24:44] [INFO ] Invariant cache hit.
[2023-03-16 15:24:46] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 3556 ms to find 0 implicit places.
[2023-03-16 15:24:46] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 15:24:46] [INFO ] Invariant cache hit.
[2023-03-16 15:24:46] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4146 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334) (ADD s1293 s1294 s1295 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 4260 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(p0)||G(F(!p0))))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1 are kept as prefixes of interest. Removing 1357 places using SCC suffix rule.2 ms
Discarding 1357 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /1358 variables (removed 1357) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-16 15:24:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 15:24:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-16 15:24:46] [INFO ] Invariant cache hit.
[2023-03-16 15:24:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-16 15:24:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 15:24:46] [INFO ] Invariant cache hit.
[2023-03-16 15:24:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1358 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 1/1358 places, 1/296 transitions.
Stuttering acceptance computed with spot in 102 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 (NOT p0)), true, (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 5 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 536 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(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 43 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 15:24:47] [INFO ] Computed 1044 place invariants in 100 ms
[2023-03-16 15:24:48] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2023-03-16 15:24:48] [INFO ] Invariant cache hit.
[2023-03-16 15:24:51] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3625 ms to find 0 implicit places.
[2023-03-16 15:24:51] [INFO ] Invariant cache hit.
[2023-03-16 15:24:51] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4114 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 460 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102)), p1:(LEQ s1335 (ADD s13...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-06 finished in 4590 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)))'
Support contains 19 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 178 are kept as prefixes of interest. Removing 1180 places using SCC suffix rule.3 ms
Discarding 1180 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
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 1 with 4 rules applied. Total rules applied 80 place count 175 transition count 123
Applied a total of 80 rules in 17 ms. Remains 175 /1358 variables (removed 1183) and now considering 123/296 (removed 173) transitions.
// Phase 1: matrix 123 rows 175 cols
[2023-03-16 15:24:52] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-16 15:24:52] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-16 15:24:52] [INFO ] Invariant cache hit.
[2023-03-16 15:24:52] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 257 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/1358 places, 123/296 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 156/1358 places, 123/296 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-07 finished in 327 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((p0 U (G(p0)||(X(!p2)&&p1)))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1356 transition count 296
Applied a total of 2 rules in 41 ms. Remains 1356 /1358 variables (removed 2) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2023-03-16 15:24:52] [INFO ] Computed 1062 place invariants in 11 ms
[2023-03-16 15:24:53] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-16 15:24:53] [INFO ] Invariant cache hit.
[2023-03-16 15:24:55] [INFO ] Implicit Places using invariants and state equation in 2277 ms returned []
Implicit Place search using SMT with State Equation took 3534 ms to find 0 implicit places.
[2023-03-16 15:24:55] [INFO ] Invariant cache hit.
[2023-03-16 15:24:56] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4051 ms. Remains : 1356/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s1354 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4420 reset in 699 ms.
Product exploration explored 100000 steps with 4415 reset in 689 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 999 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-16 15:24:59] [INFO ] Invariant cache hit.
[2023-03-16 15:25:00] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 171 ms returned sat
[2023-03-16 15:25:00] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-16 15:25:00] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 166 ms returned sat
[2023-03-16 15:25:02] [INFO ] After 1680ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 1831 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:25:04] [INFO ] Invariant cache hit.
[2023-03-16 15:25:05] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 683 ms returned sat
[2023-03-16 15:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:25:07] [INFO ] [Real]Absence check using state equation in 2590 ms returned sat
[2023-03-16 15:25:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:25:08] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 653 ms returned sat
[2023-03-16 15:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:25:11] [INFO ] [Nat]Absence check using state equation in 2872 ms returned sat
[2023-03-16 15:25:11] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2023-03-16 15:25:11] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1356 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 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 2 place count 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1355 transition count 295
Applied a total of 3 rules in 148 ms. Remains 1355 /1356 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-16 15:25:12] [INFO ] Computed 1062 place invariants in 6 ms
[2023-03-16 15:25:13] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2023-03-16 15:25:13] [INFO ] Invariant cache hit.
[2023-03-16 15:25:15] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2023-03-16 15:25:15] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-16 15:25:15] [INFO ] Invariant cache hit.
[2023-03-16 15:25:16] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1356 places, 295/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4275 ms. Remains : 1355/1356 places, 295/296 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:25:16] [INFO ] Invariant cache hit.
[2023-03-16 15:25:17] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 657 ms returned sat
[2023-03-16 15:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:25:20] [INFO ] [Real]Absence check using state equation in 2231 ms returned sat
[2023-03-16 15:25:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:25:21] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 685 ms returned sat
[2023-03-16 15:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:25:23] [INFO ] [Nat]Absence check using state equation in 2593 ms returned sat
[2023-03-16 15:25:23] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 21 ms.
[2023-03-16 15:25:24] [INFO ] Added : 0 causal constraints over 0 iterations in 107 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10739 reset in 417 ms.
Product exploration explored 100000 steps with 10832 reset in 436 ms.
Built C files in :
/tmp/ltsmin409595725857310663
[2023-03-16 15:25:24] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2023-03-16 15:25:24] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:24] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2023-03-16 15:25:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:24] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2023-03-16 15:25:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:24] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin409595725857310663
Running compilation step : cd /tmp/ltsmin409595725857310663;'/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 1320 ms.
Running link step : cd /tmp/ltsmin409595725857310663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin409595725857310663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14804466175287127480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.6 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 14 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-16 15:25:40] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-16 15:25:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-16 15:25:40] [INFO ] Invariant cache hit.
[2023-03-16 15:25:40] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-16 15:25:40] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 15:25:40] [INFO ] Invariant cache hit.
[2023-03-16 15:25:40] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 177/1355 places, 125/295 transitions.
Built C files in :
/tmp/ltsmin11167743669010659823
[2023-03-16 15:25:40] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-16 15:25:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:40] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-16 15:25:40] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:40] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-16 15:25:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:25:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11167743669010659823
Running compilation step : cd /tmp/ltsmin11167743669010659823;'/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 284 ms.
Running link step : cd /tmp/ltsmin11167743669010659823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11167743669010659823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4988073728106932564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:25:55] [INFO ] Flatten gal took : 6 ms
[2023-03-16 15:25:55] [INFO ] Flatten gal took : 5 ms
[2023-03-16 15:25:55] [INFO ] Time to serialize gal into /tmp/LTL6395507930587530171.gal : 2 ms
[2023-03-16 15:25:55] [INFO ] Time to serialize properties into /tmp/LTL16674928817925689310.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/LTL6395507930587530171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1540749687067919570.hoa' '-atoms' '/tmp/LTL16674928817925689310.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/LTL16674928817925689310.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1540749687067919570.hoa
Detected timeout of ITS tools.
[2023-03-16 15:26:10] [INFO ] Flatten gal took : 27 ms
[2023-03-16 15:26:10] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:26:10] [INFO ] Time to serialize gal into /tmp/LTL16062691979000689243.gal : 5 ms
[2023-03-16 15:26:10] [INFO ] Time to serialize properties into /tmp/LTL18002834503953918031.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/LTL16062691979000689243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18002834503953918031.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("((a5_0>=2)||((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))...937
Formula 0 simplified : G(("((a5_0>=2)||((((((CstopOK_0+CstopOK_1)+(CstopOK_2+CstopOK_3))+((CstopOK_4+CstopOK_5)+(CstopOK_6+CstopOK_7)))+(((CstopOK_8+CstopO...595
Detected timeout of ITS tools.
[2023-03-16 15:26:25] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:26:25] [INFO ] Applying decomposition
[2023-03-16 15:26:25] [INFO ] Flatten gal took : 26 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/graph4424685623180035527.txt' '-o' '/tmp/graph4424685623180035527.bin' '-w' '/tmp/graph4424685623180035527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4424685623180035527.bin' '-l' '-1' '-v' '-w' '/tmp/graph4424685623180035527.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:26:25] [INFO ] Decomposing Gal with order
[2023-03-16 15:26:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:26:25] [INFO ] Removed a total of 209 redundant transitions.
[2023-03-16 15:26:25] [INFO ] Flatten gal took : 109 ms
[2023-03-16 15:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 52 ms.
[2023-03-16 15:26:26] [INFO ] Time to serialize gal into /tmp/LTL9904259685612553812.gal : 13 ms
[2023-03-16 15:26:26] [INFO ] Time to serialize properties into /tmp/LTL596072079421740008.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/LTL9904259685612553812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL596072079421740008.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("((gi2.gi10.gi10.gu105.a5_0>=2)||((((((gu46.n1_0+gu46.n1_1)+(gu46.n1_2+gu46.n1_3))+((gu46.n1_4+gu46.n1_5)+(gu46.n1_6+gu46.n1_7))...1511
Formula 0 simplified : G(("((gi2.gi10.gi10.gu105.a5_0>=2)||((((((gu107.CstopOK_0+gu107.CstopOK_1)+(gu107.CstopOK_2+gu107.CstopOK_3))+((gu107.CstopOK_4+gu10...939
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11552185897358613350
[2023-03-16 15:26:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11552185897358613350
Running compilation step : cd /tmp/ltsmin11552185897358613350;'/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 905 ms.
Running link step : cd /tmp/ltsmin11552185897358613350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11552185897358613350;'/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 ([]((LTLAPp0==true))||(X(!(LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 123993 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 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 36 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 15:26:56] [INFO ] Computed 1044 place invariants in 74 ms
[2023-03-16 15:26:57] [INFO ] Implicit Places using invariants in 1308 ms returned []
[2023-03-16 15:26:57] [INFO ] Invariant cache hit.
[2023-03-16 15:26:59] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2023-03-16 15:26:59] [INFO ] Invariant cache hit.
[2023-03-16 15:27:00] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4034 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10 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:(GT 3 s0)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 4145 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)))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1317 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 ms
Discarding 41 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 1314 transition count 291
Applied a total of 5 rules in 81 ms. Remains 1314 /1358 variables (removed 44) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2023-03-16 15:27:00] [INFO ] Computed 1026 place invariants in 91 ms
[2023-03-16 15:27:02] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2023-03-16 15:27:02] [INFO ] Invariant cache hit.
[2023-03-16 15:27:04] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3616 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1358 places, 291/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3732 ms. Remains : 1295/1358 places, 291/296 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4210 reset in 226 ms.
Product exploration explored 100000 steps with 4213 reset in 237 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 291 rows 1295 cols
[2023-03-16 15:27:05] [INFO ] Computed 1008 place invariants in 146 ms
[2023-03-16 15:27:06] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 785 ms returned sat
[2023-03-16 15:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:27:09] [INFO ] [Real]Absence check using state equation in 2734 ms returned sat
[2023-03-16 15:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:27:10] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 791 ms returned sat
[2023-03-16 15:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:27:13] [INFO ] [Nat]Absence check using state equation in 3210 ms returned sat
[2023-03-16 15:27:13] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 21 ms.
[2023-03-16 15:27:13] [INFO ] Added : 9 causal constraints over 2 iterations in 184 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 39 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-16 15:27:14] [INFO ] Invariant cache hit.
[2023-03-16 15:27:15] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2023-03-16 15:27:15] [INFO ] Invariant cache hit.
[2023-03-16 15:27:17] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
[2023-03-16 15:27:17] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-16 15:27:17] [INFO ] Invariant cache hit.
[2023-03-16 15:27:18] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4281 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-16 15:27:18] [INFO ] Invariant cache hit.
[2023-03-16 15:27:20] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 826 ms returned sat
[2023-03-16 15:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:27:22] [INFO ] [Real]Absence check using state equation in 2654 ms returned sat
[2023-03-16 15:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:27:23] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 823 ms returned sat
[2023-03-16 15:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:27:29] [INFO ] [Nat]Absence check using state equation in 5878 ms returned sat
[2023-03-16 15:27:29] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 21 ms.
[2023-03-16 15:27:30] [INFO ] Added : 76 causal constraints over 16 iterations in 843 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4211 reset in 220 ms.
Product exploration explored 100000 steps with 4200 reset in 232 ms.
Built C files in :
/tmp/ltsmin17126671629502412793
[2023-03-16 15:27:31] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2023-03-16 15:27:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:31] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2023-03-16 15:27:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:31] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2023-03-16 15:27:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:31] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17126671629502412793
Running compilation step : cd /tmp/ltsmin17126671629502412793;'/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 1003 ms.
Running link step : cd /tmp/ltsmin17126671629502412793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17126671629502412793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17143855793497950211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 44 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-16 15:27:47] [INFO ] Invariant cache hit.
[2023-03-16 15:27:48] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2023-03-16 15:27:48] [INFO ] Invariant cache hit.
[2023-03-16 15:27:50] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2023-03-16 15:27:50] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-16 15:27:50] [INFO ] Invariant cache hit.
[2023-03-16 15:27:50] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3902 ms. Remains : 1295/1295 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin8165326691527215535
[2023-03-16 15:27:50] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2023-03-16 15:27:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:50] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2023-03-16 15:27:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:50] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2023-03-16 15:27:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:27:50] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8165326691527215535
Running compilation step : cd /tmp/ltsmin8165326691527215535;'/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 1055 ms.
Running link step : cd /tmp/ltsmin8165326691527215535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8165326691527215535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7955832414058639918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:28:06] [INFO ] Flatten gal took : 24 ms
[2023-03-16 15:28:06] [INFO ] Flatten gal took : 23 ms
[2023-03-16 15:28:06] [INFO ] Time to serialize gal into /tmp/LTL550193481587211938.gal : 6 ms
[2023-03-16 15:28:06] [INFO ] Time to serialize properties into /tmp/LTL2933854664360327070.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/LTL550193481587211938.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12769035867872592383.hoa' '-atoms' '/tmp/LTL2933854664360327070.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/LTL2933854664360327070.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12769035867872592383.hoa
Detected timeout of ITS tools.
[2023-03-16 15:28:21] [INFO ] Flatten gal took : 23 ms
[2023-03-16 15:28:21] [INFO ] Flatten gal took : 22 ms
[2023-03-16 15:28:21] [INFO ] Time to serialize gal into /tmp/LTL5293240490339238670.gal : 4 ms
[2023-03-16 15:28:21] [INFO ] Time to serialize properties into /tmp/LTL16317045196146923142.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/LTL5293240490339238670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16317045196146923142.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 : !((F(G("(malicious_reservoir_0<1)"))))
Formula 0 simplified : GF!"(malicious_reservoir_0<1)"
Detected timeout of ITS tools.
[2023-03-16 15:28:36] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:28:36] [INFO ] Applying decomposition
[2023-03-16 15:28:36] [INFO ] Flatten gal took : 23 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/graph15844364465410471241.txt' '-o' '/tmp/graph15844364465410471241.bin' '-w' '/tmp/graph15844364465410471241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15844364465410471241.bin' '-l' '-1' '-v' '-w' '/tmp/graph15844364465410471241.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:28:36] [INFO ] Decomposing Gal with order
[2023-03-16 15:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:28:36] [INFO ] Removed a total of 209 redundant transitions.
[2023-03-16 15:28:36] [INFO ] Flatten gal took : 64 ms
[2023-03-16 15:28:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 18 ms.
[2023-03-16 15:28:36] [INFO ] Time to serialize gal into /tmp/LTL15886604331864860902.gal : 22 ms
[2023-03-16 15:28:36] [INFO ] Time to serialize properties into /tmp/LTL6906149833882165720.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/LTL15886604331864860902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6906149833882165720.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.malicious_reservoir_0<1)"))))
Formula 0 simplified : GF!"(u0.malicious_reservoir_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9091248460196532689
[2023-03-16 15:28:51] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9091248460196532689
Running compilation step : cd /tmp/ltsmin9091248460196532689;'/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 903 ms.
Running link step : cd /tmp/ltsmin9091248460196532689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9091248460196532689;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 126209 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 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output 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 1354 transition count 293
Applied a total of 5 rules in 82 ms. Remains 1354 /1358 variables (removed 4) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1354 cols
[2023-03-16 15:29:06] [INFO ] Computed 1062 place invariants in 47 ms
[2023-03-16 15:29:08] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2023-03-16 15:29:08] [INFO ] Invariant cache hit.
[2023-03-16 15:29:10] [INFO ] Implicit Places using invariants and state equation in 2360 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3687 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3808 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1315 (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 3934 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(((p1 U (p2||G(p1)))||p0)))'
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))||(F(p0)&&F((p1||G(p2))))))'
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((p0 U (G(p0)||(X(!p2)&&p1)))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-09
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1356 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output 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 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1355 transition count 295
Applied a total of 4 rules in 136 ms. Remains 1355 /1358 variables (removed 3) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-16 15:29:11] [INFO ] Computed 1062 place invariants in 19 ms
[2023-03-16 15:29:12] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2023-03-16 15:29:12] [INFO ] Invariant cache hit.
[2023-03-16 15:29:14] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
[2023-03-16 15:29:14] [INFO ] Invariant cache hit.
[2023-03-16 15:29:15] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1358 places, 295/296 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4101 ms. Remains : 1355/1358 places, 295/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4417 reset in 652 ms.
Product exploration explored 100000 steps with 4421 reset in 670 ms.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 861 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-16 15:29:18] [INFO ] Invariant cache hit.
[2023-03-16 15:29:18] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 174 ms returned sat
[2023-03-16 15:29:18] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-16 15:29:18] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 184 ms returned sat
[2023-03-16 15:29:19] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 1220 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:29:20] [INFO ] Invariant cache hit.
[2023-03-16 15:29:21] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 695 ms returned sat
[2023-03-16 15:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:29:23] [INFO ] [Real]Absence check using state equation in 2233 ms returned sat
[2023-03-16 15:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:29:25] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 727 ms returned sat
[2023-03-16 15:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:29:27] [INFO ] [Nat]Absence check using state equation in 2616 ms returned sat
[2023-03-16 15:29:27] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 25 ms.
[2023-03-16 15:29:27] [INFO ] Added : 0 causal constraints over 0 iterations in 105 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1355 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Applied a total of 0 rules in 43 ms. Remains 1355 /1355 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-16 15:29:27] [INFO ] Invariant cache hit.
[2023-03-16 15:29:29] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2023-03-16 15:29:29] [INFO ] Invariant cache hit.
[2023-03-16 15:29:31] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
[2023-03-16 15:29:31] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 15:29:31] [INFO ] Invariant cache hit.
[2023-03-16 15:29:31] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3963 ms. Remains : 1355/1355 places, 295/295 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 266 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 15:29:32] [INFO ] Invariant cache hit.
[2023-03-16 15:29:33] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 670 ms returned sat
[2023-03-16 15:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:29:35] [INFO ] [Real]Absence check using state equation in 2206 ms returned sat
[2023-03-16 15:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 15:29:37] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 684 ms returned sat
[2023-03-16 15:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 15:29:39] [INFO ] [Nat]Absence check using state equation in 2720 ms returned sat
[2023-03-16 15:29:39] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 24 ms.
[2023-03-16 15:29:39] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10848 reset in 425 ms.
Product exploration explored 100000 steps with 10852 reset in 440 ms.
Built C files in :
/tmp/ltsmin16181599097641822710
[2023-03-16 15:29:40] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2023-03-16 15:29:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:40] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2023-03-16 15:29:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:40] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2023-03-16 15:29:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:40] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16181599097641822710
Running compilation step : cd /tmp/ltsmin16181599097641822710;'/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 1127 ms.
Running link step : cd /tmp/ltsmin16181599097641822710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16181599097641822710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8087047193476518135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.2 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 7 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-16 15:29:55] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-16 15:29:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-16 15:29:56] [INFO ] Invariant cache hit.
[2023-03-16 15:29:56] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-16 15:29:56] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 15:29:56] [INFO ] Invariant cache hit.
[2023-03-16 15:29:56] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 177/1355 places, 125/295 transitions.
Built C files in :
/tmp/ltsmin7719873006685958536
[2023-03-16 15:29:56] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-16 15:29:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:56] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-16 15:29:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:56] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-16 15:29:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:29:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7719873006685958536
Running compilation step : cd /tmp/ltsmin7719873006685958536;'/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 295 ms.
Running link step : cd /tmp/ltsmin7719873006685958536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7719873006685958536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9111522974002852657.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:30:11] [INFO ] Flatten gal took : 5 ms
[2023-03-16 15:30:11] [INFO ] Flatten gal took : 5 ms
[2023-03-16 15:30:11] [INFO ] Time to serialize gal into /tmp/LTL13523837179806437304.gal : 1 ms
[2023-03-16 15:30:11] [INFO ] Time to serialize properties into /tmp/LTL10382128263037667872.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/LTL13523837179806437304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17806773092286075434.hoa' '-atoms' '/tmp/LTL10382128263037667872.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...320
Loading property file /tmp/LTL10382128263037667872.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17806773092286075434.hoa
Detected timeout of ITS tools.
[2023-03-16 15:30:26] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:30:26] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:30:26] [INFO ] Time to serialize gal into /tmp/LTL14304092503172367366.gal : 6 ms
[2023-03-16 15:30:26] [INFO ] Time to serialize properties into /tmp/LTL8966656962025152864.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/LTL14304092503172367366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8966656962025152864.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 : !((F(("((a5_0>=2)||((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))...937
Formula 0 simplified : G(("((a5_0>=2)||((((((CstopOK_0+CstopOK_1)+(CstopOK_2+CstopOK_3))+((CstopOK_4+CstopOK_5)+(CstopOK_6+CstopOK_7)))+(((CstopOK_8+CstopO...595
Detected timeout of ITS tools.
[2023-03-16 15:30:41] [INFO ] Flatten gal took : 30 ms
[2023-03-16 15:30:41] [INFO ] Applying decomposition
[2023-03-16 15:30:41] [INFO ] Flatten gal took : 33 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/graph12582886453464973668.txt' '-o' '/tmp/graph12582886453464973668.bin' '-w' '/tmp/graph12582886453464973668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12582886453464973668.bin' '-l' '-1' '-v' '-w' '/tmp/graph12582886453464973668.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:30:41] [INFO ] Decomposing Gal with order
[2023-03-16 15:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:30:41] [INFO ] Removed a total of 208 redundant transitions.
[2023-03-16 15:30:41] [INFO ] Flatten gal took : 68 ms
[2023-03-16 15:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 434 labels/synchronizations in 68 ms.
[2023-03-16 15:30:42] [INFO ] Time to serialize gal into /tmp/LTL10464156688756210439.gal : 15 ms
[2023-03-16 15:30:42] [INFO ] Time to serialize properties into /tmp/LTL18249510143014541498.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/LTL10464156688756210439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18249510143014541498.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("((gi2.gi1.gi9.gi14.gu108.a5_0>=2)||((((((gu50.n1_0+gu50.n1_1)+(gu50.n1_2+gu50.n1_3))+((gu50.n1_4+gu50.n1_5)+(gu50.n1_6+gu50.n1_...1523
Formula 0 simplified : G(("((gi2.gi1.gi9.gi14.gu108.a5_0>=2)||((((((gu110.CstopOK_0+gu110.CstopOK_1)+(gu110.CstopOK_2+gu110.CstopOK_3))+((gu110.CstopOK_4+g...945
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17089919921220420447
[2023-03-16 15:30:57] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17089919921220420447
Running compilation step : cd /tmp/ltsmin17089919921220420447;'/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 909 ms.
Running link step : cd /tmp/ltsmin17089919921220420447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17089919921220420447;'/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 ([]((LTLAPp0==true))||(X(!(LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 121562 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)))'
[2023-03-16 15:31:12] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9321872008310243564
[2023-03-16 15:31:12] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-16 15:31:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:31:12] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-16 15:31:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:31:12] [INFO ] Applying decomposition
[2023-03-16 15:31:12] [INFO ] Flatten gal took : 26 ms
[2023-03-16 15:31:12] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-16 15:31:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:31:12] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9321872008310243564
Running compilation step : cd /tmp/ltsmin9321872008310243564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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'
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/graph14620393307983241109.txt' '-o' '/tmp/graph14620393307983241109.bin' '-w' '/tmp/graph14620393307983241109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14620393307983241109.bin' '-l' '-1' '-v' '-w' '/tmp/graph14620393307983241109.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:31:13] [INFO ] Decomposing Gal with order
[2023-03-16 15:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:31:13] [INFO ] Removed a total of 211 redundant transitions.
[2023-03-16 15:31:13] [INFO ] Flatten gal took : 94 ms
[2023-03-16 15:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 23 ms.
[2023-03-16 15:31:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality9733915680877427598.gal : 22 ms
[2023-03-16 15:31:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality11471602715216758731.ltl : 3 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/LTLCardinality9733915680877427598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11471602715216758731.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...298
Read 4 LTL properties
Compilation finished in 1299 ms.
Running link step : cd /tmp/ltsmin9321872008310243564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Checking formula 0 : !((F(("(((((((gi5.gi10.gu61.s3_0+gi5.gi10.gu61.s3_1)+(gi5.gi10.gu61.s3_2+gi5.gi10.gu61.s3_3))+((gi5.gi10.gu61.s3_4+gi5.gi10.gu61.s3_5)...15205
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9321872008310243564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Formula 0 simplified : G(!"(((((((gi5.gi10.gu61.s3_0+gi5.gi10.gu61.s3_1)+(gi5.gi10.gu61.s3_2+gi5.gi10.gu61.s3_3))+((gi5.gi10.gu61.s3_4+gi5.gi10.gu61.s3_5)+...10298
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9321872008310243564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9321872008310243564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp3==true)))||(<>((LTLAPp3==true))&&<>(((LTLAPp4==true)||[]((LTLAPp5==true))))))' '--buchi-type=spotba'
LTSmin run took 74228 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9321872008310243564;'/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' '<>(((LTLAPp6==true) U ([]((LTLAPp6==true))||(X(!(LTLAPp4==true))&&(LTLAPp7==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.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: LTL layer: formula: <>(((LTLAPp6==true) U ([]((LTLAPp6==true))||(X(!(LTLAPp4==true))&&(LTLAPp7==true)))))
pins2lts-mc-linux64( 1/ 8), 0.018: "<>(((LTLAPp6==true) U ([]((LTLAPp6==true))||(X(!(LTLAPp4==true))&&(LTLAPp7==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.172: There are 306 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.172: State length is 1359, there are 312 groups
pins2lts-mc-linux64( 0/ 8), 0.172: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.172: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.172: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.172: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.244: [Blue] ~23 levels ~960 states ~4592 transitions
pins2lts-mc-linux64( 0/ 8), 0.280: [Blue] ~22 levels ~1920 states ~8360 transitions
pins2lts-mc-linux64( 7/ 8), 0.352: [Blue] ~23 levels ~3840 states ~17920 transitions
pins2lts-mc-linux64( 0/ 8), 0.494: [Blue] ~22 levels ~7680 states ~38056 transitions
pins2lts-mc-linux64( 7/ 8), 0.691: [Blue] ~23 levels ~15360 states ~68024 transitions
pins2lts-mc-linux64( 7/ 8), 1.059: [Blue] ~23 levels ~30720 states ~146008 transitions
pins2lts-mc-linux64( 5/ 8), 1.806: [Blue] ~22 levels ~61440 states ~305568 transitions
pins2lts-mc-linux64( 5/ 8), 3.136: [Blue] ~23 levels ~122880 states ~643504 transitions
pins2lts-mc-linux64( 7/ 8), 5.622: [Blue] ~24 levels ~245760 states ~1441384 transitions
pins2lts-mc-linux64( 1/ 8), 10.230: [Blue] ~23 levels ~491520 states ~2972096 transitions
pins2lts-mc-linux64( 1/ 8), 19.127: [Blue] ~23 levels ~983040 states ~5951400 transitions
pins2lts-mc-linux64( 5/ 8), 37.038: [Blue] ~24 levels ~1966080 states ~13536000 transitions
pins2lts-mc-linux64( 7/ 8), 71.797: [Blue] ~25 levels ~3932160 states ~27522264 transitions
pins2lts-mc-linux64( 7/ 8), 142.352: [Blue] ~25 levels ~7864320 states ~56779728 transitions
pins2lts-mc-linux64( 3/ 8), 291.199: [Blue] ~24 levels ~15728640 states ~116453736 transitions
pins2lts-mc-linux64( 5/ 8), 422.657: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 422.706:
pins2lts-mc-linux64( 0/ 8), 422.706: Explored 21798732 states 168873807 transitions, fanout: 7.747
pins2lts-mc-linux64( 0/ 8), 422.706: Total exploration time 422.500 sec (422.470 sec minimum, 422.487 sec on average)
pins2lts-mc-linux64( 0/ 8), 422.706: States per second: 51595, Transitions per second: 399701
pins2lts-mc-linux64( 0/ 8), 422.706:
pins2lts-mc-linux64( 0/ 8), 422.706: State space has 21798177 states, 2675 are accepting
pins2lts-mc-linux64( 0/ 8), 422.706: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 422.706: blue states: 21798732 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 422.706: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 422.706: all-red states: 2675 (0.01%), bogus 7 (0.00%)
pins2lts-mc-linux64( 0/ 8), 422.706:
pins2lts-mc-linux64( 0/ 8), 422.706: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 422.706:
pins2lts-mc-linux64( 0/ 8), 422.706: Queue width: 8B, total height: 200, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 422.706: Tree memory: 422.3MB, 20.3 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 422.706: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 422.706: Stored 302 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 422.706: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 422.706: Est. total memory use: 422.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9321872008310243564;'/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' '<>(((LTLAPp6==true) U ([]((LTLAPp6==true))||(X(!(LTLAPp4==true))&&(LTLAPp7==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9321872008310243564;'/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' '<>(((LTLAPp6==true) U ([]((LTLAPp6==true))||(X(!(LTLAPp4==true))&&(LTLAPp7==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 15:54:54] [INFO ] Applying decomposition
[2023-03-16 15:54:54] [INFO ] Flatten gal took : 27 ms
[2023-03-16 15:54:54] [INFO ] Decomposing Gal with order
[2023-03-16 15:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:54:54] [INFO ] Removed a total of 160 redundant transitions.
[2023-03-16 15:54:54] [INFO ] Flatten gal took : 55 ms
[2023-03-16 15:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 18 ms.
[2023-03-16 15:54:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality9918400833151745362.gal : 27 ms
[2023-03-16 15:54:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality8247542201197261548.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/LTLCardinality9918400833151745362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8247542201197261548.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...297
Read 3 LTL properties
Checking formula 0 : !((F(("(((((((gtsid0.s3_0+gtsid1.s3_1)+(gtsid2.s3_2+gtsid3.s3_3))+((gtsid4.s3_4+gtsid5.s3_5)+(gtsid6.s3_6+gtsid7.s3_7)))+(((gtsid8.s3_...24702
Formula 0 simplified : G(!"(((((((gtsid0.s3_0+gtsid1.s3_1)+(gtsid2.s3_2+gtsid3.s3_3))+((gtsid4.s3_4+gtsid5.s3_5)+(gtsid6.s3_6+gtsid7.s3_7)))+(((gtsid8.s3_8...16590
Detected timeout of ITS tools.
[2023-03-16 16:18:48] [INFO ] Flatten gal took : 212 ms
[2023-03-16 16:18:50] [INFO ] Input system was already deterministic with 296 transitions.
[2023-03-16 16:18:50] [INFO ] Transformed 1358 places.
[2023-03-16 16:18:50] [INFO ] Transformed 296 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 16:18:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality4715905231904423647.gal : 7 ms
[2023-03-16 16:18:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality3984822812373662266.ltl : 4 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/LTLCardinality4715905231904423647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3984822812373662266.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...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+((s3_16+...10361
Formula 0 simplified : G(!"(((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+((s3_16+s...6974
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14313316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16000260 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945900827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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