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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 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 131K 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-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678989305018

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-32
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 17:55:06] [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 17:55:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:55:06] [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 17:55:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 17:55:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 542 ms
[2023-03-16 17:55:07] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 17:55:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-16 17:55:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-15 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 10 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 10009 steps, including 227 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 23) seen :10
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 17:55:09] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-16 17:55:09] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-16 17:55:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 17:55:09] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-16 17:55:09] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 17:55:09] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 8 different solutions.
Finished Parikh walk after 170 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=170 )
Parikh walk visited 8 properties in 13 ms.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 17:55:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-16 17:55:09] [INFO ] Flatten gal took : 27 ms
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 17:55:09] [INFO ] Flatten gal took : 6 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-16 17:55:09] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 29 ms.
[2023-03-16 17:55:09] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 1426 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 3772 transition count 506
Applied a total of 34 rules in 286 ms. Remains 3772 /3806 variables (removed 34) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3772 cols
[2023-03-16 17:55:10] [INFO ] Computed 3267 place invariants in 169 ms
[2023-03-16 17:55:12] [INFO ] Implicit Places using invariants in 2397 ms returned []
[2023-03-16 17:55:12] [INFO ] Invariant cache hit.
[2023-03-16 17:55:14] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2023-03-16 17:55:14] [INFO ] Invariant cache hit.
[2023-03-16 17:55:15] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3772/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6313 ms. Remains : 3772/3806 places, 506/506 transitions.
Support contains 1426 out of 3772 places after structural reductions.
[2023-03-16 17:55:16] [INFO ] Flatten gal took : 194 ms
[2023-03-16 17:55:16] [INFO ] Flatten gal took : 136 ms
[2023-03-16 17:55:16] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-16 17:55:17] [INFO ] Invariant cache hit.
[2023-03-16 17:55:18] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 17:55:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-16 17:55:20] [INFO ] [Nat]Absence check using 2 positive and 3265 generalized place invariants in 806 ms returned sat
[2023-03-16 17:55:43] [INFO ] After 22677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-16 17:55:43] [INFO ] After 22682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 17:55:43] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 13 ms.
Support contains 1226 out of 3772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3772 transition count 501
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3771 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 3770 transition count 500
Applied a total of 8 rules in 277 ms. Remains 3770 /3772 variables (removed 2) and now considering 500/506 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 3770/3772 places, 500/506 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 393948 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{0=1, 1=1, 4=1, 5=1}
Probabilistic random walk after 393948 steps, saw 73259 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 500 rows 3770 cols
[2023-03-16 17:55:47] [INFO ] Computed 3270 place invariants in 39 ms
[2023-03-16 17:55:47] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2023-03-16 17:55:48] [INFO ] [Real]Absence check using 35 positive and 3235 generalized place invariants in 779 ms returned sat
[2023-03-16 17:55:48] [INFO ] After 1259ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 17:55:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2023-03-16 17:55:49] [INFO ] [Nat]Absence check using 35 positive and 3235 generalized place invariants in 806 ms returned sat
[2023-03-16 17:55:53] [INFO ] After 4522ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 3772 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3772 transition count 506
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' '!(X(X(X((X(!p0) U (X(G(!p0))||(p1&&X(!p0))))))))'
Support contains 100 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3737 transition count 506
Applied a total of 35 rules in 386 ms. Remains 3737 /3772 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2023-03-16 17:55:54] [INFO ] Computed 3233 place invariants in 290 ms
[2023-03-16 17:56:00] [INFO ] Implicit Places using invariants in 6230 ms returned []
[2023-03-16 17:56:00] [INFO ] Invariant cache hit.
[2023-03-16 17:56:10] [INFO ] Implicit Places using invariants and state equation in 10647 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16881 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3772 places, 506/506 transitions.
Applied a total of 0 rules in 254 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17522 ms. Remains : 3704/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 774 ms :[p0, p0, p0, p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-00 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=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s3500 s3501 s3502 s3503 s3504 s3505 s3506 s3507 s3508 s3509 s3510 s3511 s3512 s3513 s3514 s3515 s3516 s3517 s3518 s3519 s3520 s3521 s3522 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-00 finished in 18603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 34 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 276 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 17:56:12] [INFO ] Computed 3232 place invariants in 72 ms
[2023-03-16 17:56:18] [INFO ] Implicit Places using invariants in 5886 ms returned []
[2023-03-16 17:56:18] [INFO ] Invariant cache hit.
[2023-03-16 17:56:28] [INFO ] Implicit Places using invariants and state equation in 10334 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16230 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16752 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s3565 s3566 s3567 s3568 s3569 s3570 s3571 s3572 s3573 s3574 s3575 s3576 s3577 s3578 s3579 s3580 s3581 s3582 s3583 s3584 s3585 s3586 s3587 s35...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1277 ms.
Product exploration explored 100000 steps with 33333 reset in 1210 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-03 finished in 20242 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 34 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 3737 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.30 ms
Discarding 35 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3734 transition count 503
Applied a total of 5 rules in 613 ms. Remains 3734 /3772 variables (removed 38) and now considering 503/506 (removed 3) transitions.
// Phase 1: matrix 503 rows 3734 cols
[2023-03-16 17:56:33] [INFO ] Computed 3233 place invariants in 83 ms
[2023-03-16 17:56:36] [INFO ] Implicit Places using invariants in 3202 ms returned []
[2023-03-16 17:56:36] [INFO ] Invariant cache hit.
[2023-03-16 17:56:48] [INFO ] Implicit Places using invariants and state equation in 11970 ms returned [3434, 3435, 3436, 3437, 3438, 3439, 3440, 3441, 3442, 3443, 3444, 3445, 3446, 3447, 3448, 3449, 3450, 3451, 3452, 3453, 3454, 3455, 3456, 3457, 3458, 3459, 3460, 3461, 3462, 3463, 3464, 3465, 3466, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15182 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3668/3772 places, 503/506 transitions.
Applied a total of 0 rules in 293 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16089 ms. Remains : 3668/3772 places, 503/506 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 3 (ADD s3269 s3270 s3271 s3272 s3273 s3274 s3275 s3276 s3277 s3278 s3279 s3280 s3281 s3282 s3283 s3284 s3285 s3286 s3287 s3288 s3289 s3290 s329...], 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 2463 reset in 490 ms.
Product exploration explored 100000 steps with 2467 reset in 457 ms.
Computed a total of 3668 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3668 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3842 steps, run visited all 1 properties in 15 ms. (steps per millisecond=256 )
Probabilistic random walk after 3842 steps, saw 3771 distinct states, run finished after 15 ms. (steps per millisecond=256 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 34 out of 3668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3668/3668 places, 503/503 transitions.
Applied a total of 0 rules in 276 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
// Phase 1: matrix 503 rows 3668 cols
[2023-03-16 17:56:50] [INFO ] Computed 3168 place invariants in 60 ms
[2023-03-16 17:56:56] [INFO ] Implicit Places using invariants in 5895 ms returned []
[2023-03-16 17:56:56] [INFO ] Invariant cache hit.
[2023-03-16 17:57:08] [INFO ] Implicit Places using invariants and state equation in 11452 ms returned []
Implicit Place search using SMT with State Equation took 17349 ms to find 0 implicit places.
[2023-03-16 17:57:08] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-16 17:57:08] [INFO ] Invariant cache hit.
[2023-03-16 17:57:09] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19054 ms. Remains : 3668/3668 places, 503/503 transitions.
Computed a total of 3668 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3668 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 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)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3842 steps, run visited all 1 properties in 14 ms. (steps per millisecond=274 )
Probabilistic random walk after 3842 steps, saw 3771 distinct states, run finished after 14 ms. (steps per millisecond=274 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 153 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2465 reset in 425 ms.
Product exploration explored 100000 steps with 2461 reset in 447 ms.
Built C files in :
/tmp/ltsmin1175918367325311037
[2023-03-16 17:57:11] [INFO ] Computing symmetric may disable matrix : 503 transitions.
[2023-03-16 17:57:11] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:11] [INFO ] Computing symmetric may enable matrix : 503 transitions.
[2023-03-16 17:57:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:11] [INFO ] Computing Do-Not-Accords matrix : 503 transitions.
[2023-03-16 17:57:11] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:11] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1175918367325311037
Running compilation step : cd /tmp/ltsmin1175918367325311037;'/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 2945 ms.
Running link step : cd /tmp/ltsmin1175918367325311037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin1175918367325311037;'/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/stateBased861051185780648140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 34 out of 3668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3668/3668 places, 503/503 transitions.
Applied a total of 0 rules in 263 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2023-03-16 17:57:26] [INFO ] Invariant cache hit.
[2023-03-16 17:57:29] [INFO ] Implicit Places using invariants in 3019 ms returned []
[2023-03-16 17:57:29] [INFO ] Invariant cache hit.
[2023-03-16 17:57:40] [INFO ] Implicit Places using invariants and state equation in 11063 ms returned []
Implicit Place search using SMT with State Equation took 14084 ms to find 0 implicit places.
[2023-03-16 17:57:40] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-16 17:57:40] [INFO ] Invariant cache hit.
[2023-03-16 17:57:42] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15710 ms. Remains : 3668/3668 places, 503/503 transitions.
Built C files in :
/tmp/ltsmin8280223909079441102
[2023-03-16 17:57:42] [INFO ] Computing symmetric may disable matrix : 503 transitions.
[2023-03-16 17:57:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:42] [INFO ] Computing symmetric may enable matrix : 503 transitions.
[2023-03-16 17:57:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:42] [INFO ] Computing Do-Not-Accords matrix : 503 transitions.
[2023-03-16 17:57:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:57:42] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8280223909079441102
Running compilation step : cd /tmp/ltsmin8280223909079441102;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8280223909079441102;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8280223909079441102;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 17:57:45] [INFO ] Flatten gal took : 87 ms
[2023-03-16 17:57:45] [INFO ] Flatten gal took : 82 ms
[2023-03-16 17:57:45] [INFO ] Time to serialize gal into /tmp/LTL10776982247167881920.gal : 16 ms
[2023-03-16 17:57:45] [INFO ] Time to serialize properties into /tmp/LTL17258570184353267331.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/LTL10776982247167881920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13049064082316418388.hoa' '-atoms' '/tmp/LTL17258570184353267331.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/LTL17258570184353267331.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13049064082316418388.hoa
Detected timeout of ITS tools.
[2023-03-16 17:58:00] [INFO ] Flatten gal took : 77 ms
[2023-03-16 17:58:00] [INFO ] Flatten gal took : 76 ms
[2023-03-16 17:58:01] [INFO ] Time to serialize gal into /tmp/LTL3636567714014505455.gal : 13 ms
[2023-03-16 17:58:01] [INFO ] Time to serialize properties into /tmp/LTL14248133148924704951.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3636567714014505455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14248133148924704951.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("((((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6...309
Formula 0 simplified : GF!"((((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_1...303
Detected timeout of ITS tools.
[2023-03-16 17:58:16] [INFO ] Flatten gal took : 82 ms
[2023-03-16 17:58:16] [INFO ] Applying decomposition
[2023-03-16 17:58:16] [INFO ] Flatten gal took : 74 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/graph4263334600974307694.txt' '-o' '/tmp/graph4263334600974307694.bin' '-w' '/tmp/graph4263334600974307694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4263334600974307694.bin' '-l' '-1' '-v' '-w' '/tmp/graph4263334600974307694.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:58:16] [INFO ] Decomposing Gal with order
[2023-03-16 17:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:58:17] [INFO ] Removed a total of 64 redundant transitions.
[2023-03-16 17:58:17] [INFO ] Flatten gal took : 436 ms
[2023-03-16 17:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 42 ms.
[2023-03-16 17:58:17] [INFO ] Time to serialize gal into /tmp/LTL956668647484628539.gal : 17 ms
[2023-03-16 17:58:17] [INFO ] Time to serialize properties into /tmp/LTL1448970860763660516.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/LTL956668647484628539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1448970860763660516.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(G("((((((((gu1.n6_0+gu1.n6_1)+(gu1.n6_2+gu1.n6_3))+((gu1.n6_4+gu1.n6_5)+(gu1.n6_6+gu1.n6_7)))+(((gu1.n6_8+gu1.n6_9)+(gu1.n6_10+gu...449
Formula 0 simplified : GF!"((((((((gu1.n6_0+gu1.n6_1)+(gu1.n6_2+gu1.n6_3))+((gu1.n6_4+gu1.n6_5)+(gu1.n6_6+gu1.n6_7)))+(((gu1.n6_8+gu1.n6_9)+(gu1.n6_10+gu1....443
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4417660867528881073
[2023-03-16 17:58:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4417660867528881073
Running compilation step : cd /tmp/ltsmin4417660867528881073;'/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 2281 ms.
Running link step : cd /tmp/ltsmin4417660867528881073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4417660867528881073;'/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-32-LTLCardinality-05 finished in 135337 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))'
Support contains 1 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 1 are kept as prefixes of interest. Removing 3771 places using SCC suffix rule.11 ms
Discarding 3771 places :
Also discarding 505 output transitions
Drop transitions removed 505 transitions
Applied a total of 1 rules in 17 ms. Remains 1 /3772 variables (removed 3771) and now considering 1/506 (removed 505) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-16 17:58:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 17:58:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 17:58:47] [INFO ] Invariant cache hit.
[2023-03-16 17:58:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-16 17:58:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 17:58:47] [INFO ] Invariant cache hit.
[2023-03-16 17:58:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3772 places, 1/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 1/3772 places, 1/506 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 83 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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-06 finished in 401 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)||X(p1))))'
Support contains 1123 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3737 transition count 506
Applied a total of 35 rules in 121 ms. Remains 3737 /3772 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2023-03-16 17:58:48] [INFO ] Computed 3233 place invariants in 78 ms
[2023-03-16 17:58:50] [INFO ] Implicit Places using invariants in 2527 ms returned []
[2023-03-16 17:58:50] [INFO ] Invariant cache hit.
[2023-03-16 17:59:01] [INFO ] Implicit Places using invariants and state equation in 10598 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13127 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3772 places, 506/506 transitions.
Applied a total of 0 rules in 118 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13366 ms. Remains : 3704/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (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 s...], 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 50000 reset in 3002 ms.
Product exploration explored 100000 steps with 50000 reset in 3003 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-09 finished in 20336 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 33 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 1425 are kept as prefixes of interest. Removing 2347 places using SCC suffix rule.12 ms
Discarding 2347 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
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 103 place count 1422 transition count 304
Applied a total of 103 rules in 115 ms. Remains 1422 /3772 variables (removed 2350) and now considering 304/506 (removed 202) transitions.
// Phase 1: matrix 304 rows 1422 cols
[2023-03-16 17:59:08] [INFO ] Computed 1120 place invariants in 4 ms
[2023-03-16 17:59:09] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2023-03-16 17:59:09] [INFO ] Invariant cache hit.
[2023-03-16 17:59:11] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 3193 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1389/3772 places, 304/506 transitions.
Applied a total of 0 rules in 41 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3350 ms. Remains : 1389/3772 places, 304/506 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-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:(LEQ 3 (ADD s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s...], 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 2440 reset in 494 ms.
Product exploration explored 100000 steps with 2443 reset in 528 ms.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 992 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 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 45 ms. (steps per millisecond=145 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 46 ms. (steps per millisecond=142 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 173 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 50 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
// Phase 1: matrix 304 rows 1389 cols
[2023-03-16 17:59:14] [INFO ] Computed 1088 place invariants in 7 ms
[2023-03-16 17:59:15] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2023-03-16 17:59:15] [INFO ] Invariant cache hit.
[2023-03-16 17:59:17] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
[2023-03-16 17:59:17] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 17:59:17] [INFO ] Invariant cache hit.
[2023-03-16 17:59:17] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3541 ms. Remains : 1389/1389 places, 304/304 transitions.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 493 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)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 43 ms. (steps per millisecond=152 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 44 ms. (steps per millisecond=149 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 162 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2446 reset in 485 ms.
Product exploration explored 100000 steps with 2440 reset in 526 ms.
Built C files in :
/tmp/ltsmin677768335531224105
[2023-03-16 17:59:20] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2023-03-16 17:59:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:20] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2023-03-16 17:59:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:20] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2023-03-16 17:59:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:20] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin677768335531224105
Running compilation step : cd /tmp/ltsmin677768335531224105;'/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 1028 ms.
Running link step : cd /tmp/ltsmin677768335531224105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin677768335531224105;'/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/stateBased11023343406536523928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 44 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2023-03-16 17:59:35] [INFO ] Invariant cache hit.
[2023-03-16 17:59:36] [INFO ] Implicit Places using invariants in 1324 ms returned []
[2023-03-16 17:59:36] [INFO ] Invariant cache hit.
[2023-03-16 17:59:38] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
[2023-03-16 17:59:38] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-16 17:59:38] [INFO ] Invariant cache hit.
[2023-03-16 17:59:38] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3556 ms. Remains : 1389/1389 places, 304/304 transitions.
Built C files in :
/tmp/ltsmin4755296996463681959
[2023-03-16 17:59:38] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2023-03-16 17:59:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:38] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2023-03-16 17:59:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:38] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2023-03-16 17:59:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:59:38] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4755296996463681959
Running compilation step : cd /tmp/ltsmin4755296996463681959;'/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 1115 ms.
Running link step : cd /tmp/ltsmin4755296996463681959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4755296996463681959;'/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/stateBased2786865820295677542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:59:53] [INFO ] Flatten gal took : 41 ms
[2023-03-16 17:59:54] [INFO ] Flatten gal took : 37 ms
[2023-03-16 17:59:54] [INFO ] Time to serialize gal into /tmp/LTL2890599074051972512.gal : 4 ms
[2023-03-16 17:59:54] [INFO ] Time to serialize properties into /tmp/LTL18287780589006444768.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/LTL2890599074051972512.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5697046275767120731.hoa' '-atoms' '/tmp/LTL18287780589006444768.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/LTL18287780589006444768.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5697046275767120731.hoa
Detected timeout of ITS tools.
[2023-03-16 18:00:09] [INFO ] Flatten gal took : 30 ms
[2023-03-16 18:00:09] [INFO ] Flatten gal took : 28 ms
[2023-03-16 18:00:09] [INFO ] Time to serialize gal into /tmp/LTL2244362221452436749.gal : 5 ms
[2023-03-16 18:00:09] [INFO ] Time to serialize properties into /tmp/LTL17115959385334209007.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/LTL2244362221452436749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17115959385334209007.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("(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cst...422
Formula 0 simplified : GF!"(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cstar...416
Detected timeout of ITS tools.
[2023-03-16 18:00:24] [INFO ] Flatten gal took : 28 ms
[2023-03-16 18:00:24] [INFO ] Applying decomposition
[2023-03-16 18:00:24] [INFO ] Flatten gal took : 29 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/graph3439224288143862300.txt' '-o' '/tmp/graph3439224288143862300.bin' '-w' '/tmp/graph3439224288143862300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3439224288143862300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3439224288143862300.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:00:24] [INFO ] Decomposing Gal with order
[2023-03-16 18:00:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:00:24] [INFO ] Removed a total of 230 redundant transitions.
[2023-03-16 18:00:24] [INFO ] Flatten gal took : 88 ms
[2023-03-16 18:00:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 95 ms.
[2023-03-16 18:00:25] [INFO ] Time to serialize gal into /tmp/LTL16098535360250528129.gal : 17 ms
[2023-03-16 18:00:25] [INFO ] Time to serialize properties into /tmp/LTL553137575080693180.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/LTL16098535360250528129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL553137575080693180.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(G("(((((((gu61.Cstart_0+gu61.Cstart_1)+(gu61.Cstart_2+gu61.Cstart_3))+((gu61.Cstart_4+gu61.Cstart_5)+(gu61.Cstart_6+gu61.Cstart_7...587
Formula 0 simplified : GF!"(((((((gu61.Cstart_0+gu61.Cstart_1)+(gu61.Cstart_2+gu61.Cstart_3))+((gu61.Cstart_4+gu61.Cstart_5)+(gu61.Cstart_6+gu61.Cstart_7))...581
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin852703310308121102
[2023-03-16 18:00:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin852703310308121102
Running compilation step : cd /tmp/ltsmin852703310308121102;'/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 891 ms.
Running link step : cd /tmp/ltsmin852703310308121102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin852703310308121102;'/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-32-LTLCardinality-11 finished in 106837 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((X(G(p0))&&F(p1))) U (p2&&G((X(G(p0))&&F(p1)))))))'
Support contains 133 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 240 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 18:00:55] [INFO ] Computed 3232 place invariants in 86 ms
[2023-03-16 18:01:01] [INFO ] Implicit Places using invariants in 6184 ms returned []
[2023-03-16 18:01:01] [INFO ] Invariant cache hit.
[2023-03-16 18:01:12] [INFO ] Implicit Places using invariants and state equation in 11230 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17418 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17905 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 3 (ADD s3433 s3434 s3435 s3436 s3437 s3438 s3439 s3440 s3441 s3442 s3443 s3444 s3445 s3446 s3447 s3448 s3449 s3450 s3451 s3452 s3453 s3454 s3455 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-12 finished in 18183 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))'
Support contains 33 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 254 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
[2023-03-16 18:01:13] [INFO ] Invariant cache hit.
[2023-03-16 18:01:19] [INFO ] Implicit Places using invariants in 6191 ms returned []
[2023-03-16 18:01:19] [INFO ] Invariant cache hit.
[2023-03-16 18:01:30] [INFO ] Implicit Places using invariants and state equation in 11036 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17231 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17731 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s3532 s3533 s3534 s3535 s3536 s3537 s3538 s3539 s3540 s3541 s3542 s3543 s3544 s3545 s3546 s3547 s3548 s3549 s3550 s3551 s3552 s3553 s3554 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1670 ms.
Product exploration explored 100000 steps with 50000 reset in 1676 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-14 finished in 21770 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)))'
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 18:01:35] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7352370757135353350
[2023-03-16 18:01:35] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2023-03-16 18:01:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:01:35] [INFO ] Applying decomposition
[2023-03-16 18:01:35] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2023-03-16 18:01:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:01:35] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2023-03-16 18:01:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:01:35] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7352370757135353350
Running compilation step : cd /tmp/ltsmin7352370757135353350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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'
[2023-03-16 18:01:35] [INFO ] Flatten gal took : 77 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/graph13606694206334339290.txt' '-o' '/tmp/graph13606694206334339290.bin' '-w' '/tmp/graph13606694206334339290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13606694206334339290.bin' '-l' '-1' '-v' '-w' '/tmp/graph13606694206334339290.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:01:35] [INFO ] Decomposing Gal with order
[2023-03-16 18:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:01:36] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-16 18:01:36] [INFO ] Flatten gal took : 208 ms
[2023-03-16 18:01:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-16 18:01:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality9218996089235569446.gal : 19 ms
[2023-03-16 18:01:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality11383536894494379292.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/LTLCardinality9218996089235569446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11383536894494379292.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 2 LTL properties
Checking formula 0 : !((F(G("((((((((gu1.n6_0+gu1.n6_1)+(gu1.n6_2+gu1.n6_3))+((gu1.n6_4+gu1.n6_5)+(gu1.n6_6+gu1.n6_7)))+(((gu1.n6_8+gu1.n6_9)+(gu1.n6_10+gu...449
Formula 0 simplified : GF!"((((((((gu1.n6_0+gu1.n6_1)+(gu1.n6_2+gu1.n6_3))+((gu1.n6_4+gu1.n6_5)+(gu1.n6_6+gu1.n6_7)))+(((gu1.n6_8+gu1.n6_9)+(gu1.n6_10+gu1....443
Compilation finished in 2711 ms.
Running link step : cd /tmp/ltsmin7352370757135353350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7352370757135353350;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: Initializing POR dependencies: labels 508, guards 506
pins2lts-mc-linux64( 4/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 20.436: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 20.436: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 20.437: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 21.169: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 21.269: There are 509 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 21.269: State length is 3773, there are 510 groups
pins2lts-mc-linux64( 0/ 8), 21.269: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 21.269: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 21.269: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 21.269: Visible groups: 0 / 510, labels: 1 / 509
pins2lts-mc-linux64( 0/ 8), 21.269: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 21.269: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 21.830: [Blue] ~44 levels ~960 states ~12936 transitions
pins2lts-mc-linux64( 2/ 8), 21.909: [Blue] ~44 levels ~1920 states ~13872 transitions
pins2lts-mc-linux64( 2/ 8), 22.090: [Blue] ~44 levels ~3840 states ~17840 transitions
pins2lts-mc-linux64( 6/ 8), 22.449: [Blue] ~46 levels ~7680 states ~26976 transitions
pins2lts-mc-linux64( 5/ 8), 23.139: [Blue] ~45 levels ~15360 states ~42928 transitions
pins2lts-mc-linux64( 2/ 8), 24.581: [Blue] ~44 levels ~30720 states ~75272 transitions
pins2lts-mc-linux64( 2/ 8), 27.356: [Blue] ~44 levels ~61440 states ~142152 transitions
pins2lts-mc-linux64( 2/ 8), 32.922: [Blue] ~44 levels ~122880 states ~277896 transitions
pins2lts-mc-linux64( 2/ 8), 43.787: [Blue] ~44 levels ~245760 states ~555424 transitions
pins2lts-mc-linux64( 2/ 8), 66.181: [Blue] ~44 levels ~491520 states ~1147520 transitions
pins2lts-mc-linux64( 2/ 8), 126.549: [Blue] ~44 levels ~983040 states ~3120232 transitions
pins2lts-mc-linux64( 2/ 8), 239.964: [Blue] ~44 levels ~1966080 states ~6457544 transitions
pins2lts-mc-linux64( 2/ 8), 454.487: [Blue] ~45 levels ~3932160 states ~13155296 transitions
pins2lts-mc-linux64( 2/ 8), 907.559: [Blue] ~45 levels ~7864320 states ~27801480 transitions
pins2lts-mc-linux64( 7/ 8), 988.496: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 988.786:
pins2lts-mc-linux64( 0/ 8), 988.786: Explored 7430323 states 32501221 transitions, fanout: 4.374
pins2lts-mc-linux64( 0/ 8), 988.786: Total exploration time 967.510 sec (967.220 sec minimum, 967.383 sec on average)
pins2lts-mc-linux64( 0/ 8), 988.786: States per second: 7680, Transitions per second: 33593
pins2lts-mc-linux64( 0/ 8), 988.786:
pins2lts-mc-linux64( 0/ 8), 988.786: State space has 7440611 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 988.786: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 988.786: blue states: 7430323 (99.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 988.786: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 988.786: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 988.786:
pins2lts-mc-linux64( 0/ 8), 988.786: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 988.786:
pins2lts-mc-linux64( 0/ 8), 988.786: Queue width: 8B, total height: 364, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 988.786: Tree memory: 312.8MB, 44.1 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 988.786: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 988.786: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 988.786: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 988.786: Est. total memory use: 312.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7352370757135353350;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7352370757135353350;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 18:23:46] [INFO ] Applying decomposition
[2023-03-16 18:23:46] [INFO ] Flatten gal took : 383 ms
[2023-03-16 18:23:46] [INFO ] Decomposing Gal with order
[2023-03-16 18:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:23:47] [INFO ] Removed a total of 492 redundant transitions.
[2023-03-16 18:23:47] [INFO ] Flatten gal took : 314 ms
[2023-03-16 18:23:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 134 ms.
[2023-03-16 18:23:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality10586804220842659162.gal : 35 ms
[2023-03-16 18:23:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality9055307029716358477.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/LTLCardinality10586804220842659162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9055307029716358477.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 2 LTL properties
Checking formula 0 : !((F(G("((((((((gtsid0.n6_0+gtsid1.n6_1)+(gtsid2.n6_2+gtsid3.n6_3))+((gtsid4.n6_4+gtsid5.n6_5)+(gtsid6.n6_6+gtsid7.n6_7)))+(((gtsid8.n...575
Formula 0 simplified : GF!"((((((((gtsid0.n6_0+gtsid1.n6_1)+(gtsid2.n6_2+gtsid3.n6_3))+((gtsid4.n6_4+gtsid5.n6_5)+(gtsid6.n6_6+gtsid7.n6_7)))+(((gtsid8.n6_...569
Detected timeout of ITS tools.
[2023-03-16 18:46:38] [INFO ] Flatten gal took : 798 ms
[2023-03-16 18:46:40] [INFO ] Input system was already deterministic with 506 transitions.
[2023-03-16 18:46:52] [INFO ] Transformed 3772 places.
[2023-03-16 18:46:52] [INFO ] Transformed 506 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 18:46:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality6307681892719370759.gal : 12 ms
[2023-03-16 18:46:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality9124873108394964590.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/LTLCardinality6307681892719370759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9124873108394964590.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6...309
Formula 0 simplified : GF!"((((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_1...303
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7869500 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15828340 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-32"
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-32, 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-167873946000851"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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