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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 01:23 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 72K 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-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678978265864

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-10
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 14:51:07] [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 14:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:51:07] [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 14:51:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 14:51:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2023-03-16 14:51:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 14:51:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-16 14:51:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 TRUE 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 13 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 10002 steps, including 556 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1002 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 14:51:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-16 14:51:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:51:08] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-16 14:51:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:51:09] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-16 14:51:09] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 14:51:09] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 10 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 13 properties in 26 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-16 14:51:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-16 14:51:09] [INFO ] Flatten gal took : 29 ms
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:51:09] [INFO ] Flatten gal took : 6 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2023-03-16 14:51:09] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 13 ms.
[2023-03-16 14:51:09] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 383 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 539 transition count 176
Applied a total of 11 rules in 21 ms. Remains 539 /550 variables (removed 11) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 539 cols
[2023-03-16 14:51:09] [INFO ] Computed 364 place invariants in 15 ms
[2023-03-16 14:51:09] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-16 14:51:09] [INFO ] Invariant cache hit.
[2023-03-16 14:51:09] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2023-03-16 14:51:09] [INFO ] Invariant cache hit.
[2023-03-16 14:51:10] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 539/550 places, 176/176 transitions.
Support contains 383 out of 539 places after structural reductions.
[2023-03-16 14:51:10] [INFO ] Flatten gal took : 36 ms
[2023-03-16 14:51:10] [INFO ] Flatten gal took : 28 ms
[2023-03-16 14:51:10] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-16 14:51:10] [INFO ] Invariant cache hit.
[2023-03-16 14:51:11] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-16 14:51:11] [INFO ] [Real]Absence check using 14 positive and 350 generalized place invariants in 48 ms returned sat
[2023-03-16 14:51:11] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 14:51:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-16 14:51:11] [INFO ] [Nat]Absence check using 14 positive and 350 generalized place invariants in 49 ms returned sat
[2023-03-16 14:51:13] [INFO ] After 1536ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2023-03-16 14:51:15] [INFO ] After 3303ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :21
Attempting to minimize the solution found.
Minimization took 1424 ms.
[2023-03-16 14:51:16] [INFO ] After 5234ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :21
Fused 23 Parikh solutions to 20 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 11 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 21 properties in 9 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 539 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 539 transition count 176
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' '!((G(p0) U X((p1||X(X(p2))))))'
Support contains 23 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 43 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:51:16] [INFO ] Computed 350 place invariants in 18 ms
[2023-03-16 14:51:17] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-16 14:51:17] [INFO ] Invariant cache hit.
[2023-03-16 14:51:17] [INFO ] Implicit Places using invariants and state equation in 534 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 976 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1030 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 557 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ 1 (ADD s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495)), p2:(LEQ 1 (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 1648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&(p1 U p2)) U p3))'
Support contains 56 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 536 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 534 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 534 transition count 174
Applied a total of 4 rules in 75 ms. Remains 534 /539 variables (removed 5) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 534 cols
[2023-03-16 14:51:18] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-16 14:51:19] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-16 14:51:19] [INFO ] Invariant cache hit.
[2023-03-16 14:51:19] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1143 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/539 places, 174/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1239 ms. Remains : 512/539 places, 174/176 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), true, (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GT (ADD s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495) s500), p0:(GT 3 (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511)), p2:(LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-01 finished in 1484 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((F(p1)||p0))))'
Support contains 36 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 20 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:51:20] [INFO ] Computed 350 place invariants in 11 ms
[2023-03-16 14:51:20] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-16 14:51:20] [INFO ] Invariant cache hit.
[2023-03-16 14:51:20] [INFO ] Implicit Places using invariants and state equation in 584 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 961 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 989 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407) s511) (AND (LEQ (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407) s511)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6921 reset in 337 ms.
Product exploration explored 100000 steps with 6917 reset in 260 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 287 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1252239 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{1=1}
Probabilistic random walk after 1252239 steps, saw 166452 distinct states, run finished after 3003 ms. (steps per millisecond=416 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 14:51:25] [INFO ] Computed 340 place invariants in 23 ms
[2023-03-16 14:51:25] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:51:25] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2023-03-16 14:51:25] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 5998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 9 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:51:25] [INFO ] Computed 350 place invariants in 9 ms
[2023-03-16 14:51:26] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 14:51:26] [INFO ] Invariant cache hit.
[2023-03-16 14:51:26] [INFO ] Implicit Places using invariants and state equation in 551 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 876 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 890 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ (ADD s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473) (ADD s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484)), p0:(LEQ 1 (ADD s485 s4...], 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 427 ms.
Product exploration explored 100000 steps with 33333 reset in 365 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-07 finished in 2223 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||(p1&&X(X(F(!p1)))))))'
Support contains 22 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 10 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:51:28] [INFO ] Invariant cache hit.
[2023-03-16 14:51:28] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-16 14:51:28] [INFO ] Invariant cache hit.
[2023-03-16 14:51:29] [INFO ] Implicit Places using invariants and state equation in 541 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 912 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 928 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 1 (ADD s496 s497 s498 s499 s500 s501 s502 s503 s504 s505 s506)), p1:(LEQ 2 (ADD s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-08 finished in 1083 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(G(p0))))'
Support contains 2 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 10 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:51:29] [INFO ] Invariant cache hit.
[2023-03-16 14:51:29] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-16 14:51:29] [INFO ] Invariant cache hit.
[2023-03-16 14:51:30] [INFO ] Implicit Places using invariants and state equation in 556 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 893 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 911 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s510 s509)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6927 reset in 204 ms.
Product exploration explored 100000 steps with 6924 reset in 141 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 689 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 234 steps, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
Probabilistic random walk after 234 steps, saw 224 distinct states, run finished after 5 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 14:51:31] [INFO ] Computed 340 place invariants in 17 ms
[2023-03-16 14:51:31] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-16 14:51:31] [INFO ] Invariant cache hit.
[2023-03-16 14:51:32] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2023-03-16 14:51:32] [INFO ] Invariant cache hit.
[2023-03-16 14:51:32] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1087 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 234 steps, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
Probabilistic random walk after 234 steps, saw 224 distinct states, run finished after 4 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6923 reset in 143 ms.
Product exploration explored 100000 steps with 6918 reset in 153 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 71 are kept as prefixes of interest. Removing 442 places using SCC suffix rule.4 ms
Discarding 442 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 71 transition count 52
Applied a total of 55 rules in 11 ms. Remains 71 /513 variables (removed 442) and now considering 52/176 (removed 124) transitions.
[2023-03-16 14:51:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 52 rows 71 cols
[2023-03-16 14:51:34] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 14:51:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/513 places, 52/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 71/513 places, 52/176 transitions.
Built C files in :
/tmp/ltsmin4876545118687353561
[2023-03-16 14:51:34] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4876545118687353561
Running compilation step : cd /tmp/ltsmin4876545118687353561;'/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 508 ms.
Running link step : cd /tmp/ltsmin4876545118687353561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4876545118687353561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2576150775575468951.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 14:51:49] [INFO ] Computed 340 place invariants in 20 ms
[2023-03-16 14:51:49] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-16 14:51:49] [INFO ] Invariant cache hit.
[2023-03-16 14:51:50] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-16 14:51:50] [INFO ] Invariant cache hit.
[2023-03-16 14:51:50] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1090 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin13049849667673200866
[2023-03-16 14:51:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13049849667673200866
Running compilation step : cd /tmp/ltsmin13049849667673200866;'/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 409 ms.
Running link step : cd /tmp/ltsmin13049849667673200866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13049849667673200866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased597146642057558023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:52:05] [INFO ] Flatten gal took : 23 ms
[2023-03-16 14:52:05] [INFO ] Flatten gal took : 21 ms
[2023-03-16 14:52:05] [INFO ] Time to serialize gal into /tmp/LTL9259216953245848633.gal : 5 ms
[2023-03-16 14:52:05] [INFO ] Time to serialize properties into /tmp/LTL15832647345110582924.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/LTL9259216953245848633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5709771318257478718.hoa' '-atoms' '/tmp/LTL15832647345110582924.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/LTL15832647345110582924.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5709771318257478718.hoa
Detected timeout of ITS tools.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 20 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 18 ms
[2023-03-16 14:52:20] [INFO ] Time to serialize gal into /tmp/LTL14007235806999100854.gal : 3 ms
[2023-03-16 14:52:20] [INFO ] Time to serialize properties into /tmp/LTL10153641896859103421.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/LTL14007235806999100854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10153641896859103421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(a2_0<=a3_0)")))))
Formula 0 simplified : XXF!"(a2_0<=a3_0)"
Detected timeout of ITS tools.
[2023-03-16 14:52:35] [INFO ] Flatten gal took : 18 ms
[2023-03-16 14:52:35] [INFO ] Applying decomposition
[2023-03-16 14:52:35] [INFO ] Flatten gal took : 17 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/graph13429022220540216727.txt' '-o' '/tmp/graph13429022220540216727.bin' '-w' '/tmp/graph13429022220540216727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13429022220540216727.bin' '-l' '-1' '-v' '-w' '/tmp/graph13429022220540216727.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:52:35] [INFO ] Decomposing Gal with order
[2023-03-16 14:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:52:36] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 14:52:36] [INFO ] Flatten gal took : 90 ms
[2023-03-16 14:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 24 ms.
[2023-03-16 14:52:36] [INFO ] Time to serialize gal into /tmp/LTL13051539622263442081.gal : 8 ms
[2023-03-16 14:52:36] [INFO ] Time to serialize properties into /tmp/LTL6095582530413326539.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/LTL13051539622263442081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6095582530413326539.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(gu68.a2_0<=gu68.a3_0)")))))
Formula 0 simplified : XXF!"(gu68.a2_0<=gu68.a3_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16895703318503693071
[2023-03-16 14:52:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16895703318503693071
Running compilation step : cd /tmp/ltsmin16895703318503693071;'/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 416 ms.
Running link step : cd /tmp/ltsmin16895703318503693071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16895703318503693071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 97165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((p1||(p2 U (p3||G(p2))))))))'
Support contains 57 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 525 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 525 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 524 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 524 transition count 175
Applied a total of 5 rules in 62 ms. Remains 524 /539 variables (removed 15) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 524 cols
[2023-03-16 14:53:06] [INFO ] Computed 350 place invariants in 11 ms
[2023-03-16 14:53:06] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-16 14:53:06] [INFO ] Invariant cache hit.
[2023-03-16 14:53:07] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2023-03-16 14:53:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 14:53:07] [INFO ] Invariant cache hit.
[2023-03-16 14:53:07] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/539 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1136 ms. Remains : 524/539 places, 175/176 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s522 s1), p1:(GT 2 (ADD s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397)), p3:(AND (GT (ADD s420 s421 s422 s423 s424 s425 s426 s427 s428 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6928 reset in 186 ms.
Product exploration explored 100000 steps with 6923 reset in 198 ms.
Computed a total of 524 stabilizing places and 175 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 175
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 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 602 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 14:53:09] [INFO ] Invariant cache hit.
[2023-03-16 14:53:09] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 14:53:09] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 46 ms returned sat
[2023-03-16 14:53:09] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p3) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))
Knowledge based reduction with 14 factoid took 485 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-10 finished in 3779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 23 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 536 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 533 transition count 173
Applied a total of 5 rules in 34 ms. Remains 533 /539 variables (removed 6) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 533 cols
[2023-03-16 14:53:10] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-16 14:53:10] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-16 14:53:10] [INFO ] Invariant cache hit.
[2023-03-16 14:53:11] [INFO ] Implicit Places using invariants and state equation in 578 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 913 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/539 places, 173/176 transitions.
Applied a total of 0 rules in 35 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 983 ms. Remains : 511/539 places, 173/176 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429) s499), p1:(GT 2 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510))], nbAcceptance=2, 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 6784 reset in 285 ms.
Product exploration explored 100000 steps with 6778 reset in 295 ms.
Computed a total of 511 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 511 transition count 173
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 (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) 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 based reduction with 11 factoid took 375 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1796 steps, run visited all 4 properties in 26 ms. (steps per millisecond=69 )
Probabilistic random walk after 1796 steps, saw 1709 distinct states, run finished after 26 ms. (steps per millisecond=69 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) 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 : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 496 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 23 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 173/173 transitions.
Applied a total of 0 rules in 13 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 511 cols
[2023-03-16 14:53:13] [INFO ] Computed 340 place invariants in 23 ms
[2023-03-16 14:53:13] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-16 14:53:13] [INFO ] Invariant cache hit.
[2023-03-16 14:53:14] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2023-03-16 14:53:14] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 14:53:14] [INFO ] Invariant cache hit.
[2023-03-16 14:53:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1057 ms. Remains : 511/511 places, 173/173 transitions.
Computed a total of 511 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 511 transition count 173
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 (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) 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 based reduction with 11 factoid took 486 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1796 steps, run visited all 4 properties in 30 ms. (steps per millisecond=59 )
Probabilistic random walk after 1796 steps, saw 1709 distinct states, run finished after 30 ms. (steps per millisecond=59 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) 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 : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 486 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6782 reset in 286 ms.
Product exploration explored 100000 steps with 6781 reset in 291 ms.
Built C files in :
/tmp/ltsmin1148825082154647148
[2023-03-16 14:53:16] [INFO ] Computing symmetric may disable matrix : 173 transitions.
[2023-03-16 14:53:16] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:16] [INFO ] Computing symmetric may enable matrix : 173 transitions.
[2023-03-16 14:53:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:16] [INFO ] Computing Do-Not-Accords matrix : 173 transitions.
[2023-03-16 14:53:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:16] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1148825082154647148
Running compilation step : cd /tmp/ltsmin1148825082154647148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin1148825082154647148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1148825082154647148;'/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/stateBased9046422971497119477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 23 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 173/173 transitions.
Applied a total of 0 rules in 21 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-16 14:53:31] [INFO ] Invariant cache hit.
[2023-03-16 14:53:31] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-16 14:53:31] [INFO ] Invariant cache hit.
[2023-03-16 14:53:32] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-16 14:53:32] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 14:53:32] [INFO ] Invariant cache hit.
[2023-03-16 14:53:32] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1072 ms. Remains : 511/511 places, 173/173 transitions.
Built C files in :
/tmp/ltsmin16232944019274619273
[2023-03-16 14:53:32] [INFO ] Computing symmetric may disable matrix : 173 transitions.
[2023-03-16 14:53:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:32] [INFO ] Computing symmetric may enable matrix : 173 transitions.
[2023-03-16 14:53:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:32] [INFO ] Computing Do-Not-Accords matrix : 173 transitions.
[2023-03-16 14:53:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:53:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16232944019274619273
Running compilation step : cd /tmp/ltsmin16232944019274619273;'/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 490 ms.
Running link step : cd /tmp/ltsmin16232944019274619273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16232944019274619273;'/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/stateBased11197322524828047669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:53:47] [INFO ] Flatten gal took : 27 ms
[2023-03-16 14:53:47] [INFO ] Flatten gal took : 19 ms
[2023-03-16 14:53:47] [INFO ] Time to serialize gal into /tmp/LTL4835210383726116678.gal : 2 ms
[2023-03-16 14:53:47] [INFO ] Time to serialize properties into /tmp/LTL8668347695025984336.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/LTL4835210383726116678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13071889013825081612.hoa' '-atoms' '/tmp/LTL8668347695025984336.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/LTL8668347695025984336.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13071889013825081612.hoa
Detected timeout of ITS tools.
[2023-03-16 14:54:02] [INFO ] Flatten gal took : 15 ms
[2023-03-16 14:54:02] [INFO ] Flatten gal took : 13 ms
[2023-03-16 14:54:02] [INFO ] Time to serialize gal into /tmp/LTL12483554190514023172.gal : 2 ms
[2023-03-16 14:54:02] [INFO ] Time to serialize properties into /tmp/LTL14292933970345944678.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/LTL12483554190514023172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14292933970345944678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))<=AstopOK_0)"))||(G("(((((CstopOK_0+CstopOK_1)+(C...267
Formula 0 simplified : G(F!"(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))<=AstopOK_0)" & F!"(((((CstopOK_0+CstopOK_1)+(Cstop...259
Detected timeout of ITS tools.
[2023-03-16 14:54:17] [INFO ] Flatten gal took : 19 ms
[2023-03-16 14:54:17] [INFO ] Applying decomposition
[2023-03-16 14:54:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2687318542791172303.txt' '-o' '/tmp/graph2687318542791172303.bin' '-w' '/tmp/graph2687318542791172303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2687318542791172303.bin' '-l' '-1' '-v' '-w' '/tmp/graph2687318542791172303.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:54:17] [INFO ] Decomposing Gal with order
[2023-03-16 14:54:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:54:18] [INFO ] Removed a total of 142 redundant transitions.
[2023-03-16 14:54:18] [INFO ] Flatten gal took : 35 ms
[2023-03-16 14:54:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 36 ms.
[2023-03-16 14:54:18] [INFO ] Time to serialize gal into /tmp/LTL18156373119083177445.gal : 6 ms
[2023-03-16 14:54:18] [INFO ] Time to serialize properties into /tmp/LTL10054617604967618499.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/LTL18156373119083177445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10054617604967618499.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((gu29.c1_0+gu29.c1_1)+(gu29.c1_2+gu29.c1_3))+((gu29.c1_4+gu29.c1_5)+(gu29.c1_6+gu29.c1_7)))+((gu29.c1_8+gu29.c1_9)+gu29.c...382
Formula 0 simplified : G(F!"(((((gu29.c1_0+gu29.c1_1)+(gu29.c1_2+gu29.c1_3))+((gu29.c1_4+gu29.c1_5)+(gu29.c1_6+gu29.c1_7)))+((gu29.c1_8+gu29.c1_9)+gu29.c1_...374
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10680400109250395558
[2023-03-16 14:54:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10680400109250395558
Running compilation step : cd /tmp/ltsmin10680400109250395558;'/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 421 ms.
Running link step : cd /tmp/ltsmin10680400109250395558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10680400109250395558;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-11 finished in 98162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G((F(p1)&&F(G(!p0))))))))'
Support contains 134 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 525 transition count 176
Applied a total of 14 rules in 12 ms. Remains 525 /539 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2023-03-16 14:54:48] [INFO ] Computed 350 place invariants in 9 ms
[2023-03-16 14:54:48] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-16 14:54:48] [INFO ] Invariant cache hit.
[2023-03-16 14:54:49] [INFO ] Implicit Places using invariants and state equation in 507 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 799 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/539 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 816 ms. Remains : 514/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s509 (ADD s1 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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-12 finished in 1119 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||G(p1))))))'
Support contains 123 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 525 transition count 176
Applied a total of 14 rules in 4 ms. Remains 525 /539 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2023-03-16 14:54:49] [INFO ] Computed 351 place invariants in 9 ms
[2023-03-16 14:54:49] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-16 14:54:49] [INFO ] Invariant cache hit.
[2023-03-16 14:54:50] [INFO ] Implicit Places using invariants and state equation in 542 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 831 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/539 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 840 ms. Remains : 514/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(LEQ 3 (ADD s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32455 reset in 414 ms.
Product exploration explored 100000 steps with 32360 reset in 473 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 514 cols
[2023-03-16 14:54:51] [INFO ] Computed 340 place invariants in 12 ms
[2023-03-16 14:54:52] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 48 ms returned sat
[2023-03-16 14:54:52] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:54:52] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2023-03-16 14:54:52] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:54:52] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-16 14:54:52] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-16 14:54:53] [INFO ] Invariant cache hit.
[2023-03-16 14:54:53] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 187 ms returned sat
[2023-03-16 14:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:54:53] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2023-03-16 14:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:54:54] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 238 ms returned sat
[2023-03-16 14:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:54:56] [INFO ] [Nat]Absence check using state equation in 1962 ms returned sat
[2023-03-16 14:54:56] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2023-03-16 14:54:56] [INFO ] Added : 46 causal constraints over 10 iterations in 320 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 123 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:54:56] [INFO ] Invariant cache hit.
[2023-03-16 14:54:56] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-16 14:54:56] [INFO ] Invariant cache hit.
[2023-03-16 14:54:57] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-16 14:54:57] [INFO ] Invariant cache hit.
[2023-03-16 14:54:57] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 862 ms. Remains : 514/514 places, 176/176 transitions.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:54:58] [INFO ] Invariant cache hit.
[2023-03-16 14:54:58] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 48 ms returned sat
[2023-03-16 14:54:58] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:54:58] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2023-03-16 14:54:58] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:54:58] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-16 14:54:58] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 333 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-16 14:54:59] [INFO ] Invariant cache hit.
[2023-03-16 14:54:59] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 187 ms returned sat
[2023-03-16 14:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:55:00] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2023-03-16 14:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:55:00] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 239 ms returned sat
[2023-03-16 14:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:55:02] [INFO ] [Nat]Absence check using state equation in 1893 ms returned sat
[2023-03-16 14:55:02] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2023-03-16 14:55:02] [INFO ] Added : 46 causal constraints over 10 iterations in 312 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 32468 reset in 455 ms.
Product exploration explored 100000 steps with 32472 reset in 457 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 123 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2096 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 502 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 16 ms. Remains 502 /514 variables (removed 12) and now considering 175/176 (removed 1) transitions.
[2023-03-16 14:55:04] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 175 rows 502 cols
[2023-03-16 14:55:04] [INFO ] Computed 330 place invariants in 6 ms
[2023-03-16 14:55:04] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/514 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 502/514 places, 175/176 transitions.
Built C files in :
/tmp/ltsmin14359073023436149856
[2023-03-16 14:55:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14359073023436149856
Running compilation step : cd /tmp/ltsmin14359073023436149856;'/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 420 ms.
Running link step : cd /tmp/ltsmin14359073023436149856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14359073023436149856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4316549248235383087.hoa' '--buchi-type=spotba'
LTSmin run took 703 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 16138 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(F(p0))||(G(p1)&&X(F(p2)))))))'
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 535 transition count 176
Applied a total of 4 rules in 12 ms. Remains 535 /539 variables (removed 4) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 535 cols
[2023-03-16 14:55:05] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-16 14:55:05] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-16 14:55:05] [INFO ] Invariant cache hit.
[2023-03-16 14:55:06] [INFO ] Implicit Places using invariants and state equation in 609 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 948 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/539 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 967 ms. Remains : 524/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523) (ADD s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484)), p0:(LEQ 1 (ADD s430 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25024 reset in 335 ms.
Product exploration explored 100000 steps with 24941 reset in 343 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1316401 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1316401 steps, saw 175618 distinct states, run finished after 3002 ms. (steps per millisecond=438 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:55:11] [INFO ] Computed 350 place invariants in 6 ms
[2023-03-16 14:55:11] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:55:11] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 10 factoid took 428 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:12] [INFO ] Invariant cache hit.
[2023-03-16 14:55:12] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-16 14:55:12] [INFO ] Invariant cache hit.
[2023-03-16 14:55:13] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-16 14:55:13] [INFO ] Invariant cache hit.
[2023-03-16 14:55:13] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 524/524 places, 176/176 transitions.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1711 steps, run visited all 2 properties in 17 ms. (steps per millisecond=100 )
Probabilistic random walk after 1711 steps, saw 1630 distinct states, run finished after 17 ms. (steps per millisecond=100 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 6918 reset in 175 ms.
Product exploration explored 100000 steps with 6923 reset in 186 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 512 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 29 ms. Remains 512 /524 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:15] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 176 rows 512 cols
[2023-03-16 14:55:15] [INFO ] Computed 340 place invariants in 2 ms
[2023-03-16 14:55:15] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/524 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 512/524 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin12934429594677427206
[2023-03-16 14:55:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12934429594677427206
Running compilation step : cd /tmp/ltsmin12934429594677427206;'/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 410 ms.
Running link step : cd /tmp/ltsmin12934429594677427206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12934429594677427206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1925970662758952385.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:55:30] [INFO ] Computed 350 place invariants in 8 ms
[2023-03-16 14:55:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-16 14:55:30] [INFO ] Invariant cache hit.
[2023-03-16 14:55:31] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-16 14:55:31] [INFO ] Invariant cache hit.
[2023-03-16 14:55:31] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1037 ms. Remains : 524/524 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin3781817768544221479
[2023-03-16 14:55:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3781817768544221479
Running compilation step : cd /tmp/ltsmin3781817768544221479;'/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 433 ms.
Running link step : cd /tmp/ltsmin3781817768544221479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3781817768544221479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17473391906810421377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:55:46] [INFO ] Flatten gal took : 13 ms
[2023-03-16 14:55:46] [INFO ] Flatten gal took : 13 ms
[2023-03-16 14:55:46] [INFO ] Time to serialize gal into /tmp/LTL15814149982951903539.gal : 2 ms
[2023-03-16 14:55:46] [INFO ] Time to serialize properties into /tmp/LTL14944015242885409974.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/LTL15814149982951903539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10797920205320985161.hoa' '-atoms' '/tmp/LTL14944015242885409974.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/LTL14944015242885409974.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10797920205320985161.hoa
Detected timeout of ITS tools.
[2023-03-16 14:56:01] [INFO ] Flatten gal took : 13 ms
[2023-03-16 14:56:01] [INFO ] Flatten gal took : 12 ms
[2023-03-16 14:56:01] [INFO ] Time to serialize gal into /tmp/LTL4372760711279001166.gal : 3 ms
[2023-03-16 14:56:01] [INFO ] Time to serialize properties into /tmp/LTL9675683567379698989.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/LTL4372760711279001166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9675683567379698989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))>=1)")))||((G("(((((CstopOK_0+CstopOK_1)+(Cst...563
Formula 0 simplified : XF(XG!"(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))>=1)" & (F!"(((((CstopOK_0+CstopOK_1)+(CstopOK_2+...547
Detected timeout of ITS tools.
[2023-03-16 14:56:16] [INFO ] Flatten gal took : 17 ms
[2023-03-16 14:56:16] [INFO ] Applying decomposition
[2023-03-16 14:56:16] [INFO ] Flatten gal took : 14 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/graph12106602736121556698.txt' '-o' '/tmp/graph12106602736121556698.bin' '-w' '/tmp/graph12106602736121556698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12106602736121556698.bin' '-l' '-1' '-v' '-w' '/tmp/graph12106602736121556698.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:56:16] [INFO ] Decomposing Gal with order
[2023-03-16 14:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:56:16] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 14:56:16] [INFO ] Flatten gal took : 28 ms
[2023-03-16 14:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 7 ms.
[2023-03-16 14:56:16] [INFO ] Time to serialize gal into /tmp/LTL16056233730096916757.gal : 4 ms
[2023-03-16 14:56:16] [INFO ] Time to serialize properties into /tmp/LTL12398268066225185810.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/LTL16056233730096916757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12398268066225185810.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(((((gu34.c1_0+gu34.c1_1)+(gu34.c1_2+gu34.c1_3))+((gu34.c1_4+gu34.c1_5)+(gu34.c1_6+gu34.c1_7)))+((gu34.c1_8+gu34.c1_9)+gu...838
Formula 0 simplified : XF(XG!"(((((gu34.c1_0+gu34.c1_1)+(gu34.c1_2+gu34.c1_3))+((gu34.c1_4+gu34.c1_5)+(gu34.c1_6+gu34.c1_7)))+((gu34.c1_8+gu34.c1_9)+gu34.c...822
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8674287177208705337
[2023-03-16 14:56:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8674287177208705337
Running compilation step : cd /tmp/ltsmin8674287177208705337;'/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 446 ms.
Running link step : cd /tmp/ltsmin8674287177208705337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8674287177208705337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp0==true)))||([]((LTLAPp1==true))&&X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 101516 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(G(p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-09
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 539 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 71 are kept as prefixes of interest. Removing 468 places using SCC suffix rule.1 ms
Discarding 468 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 70 transition count 51
Applied a total of 55 rules in 10 ms. Remains 70 /539 variables (removed 469) and now considering 51/176 (removed 125) transitions.
// Phase 1: matrix 51 rows 70 cols
[2023-03-16 14:56:47] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 14:56:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-16 14:56:47] [INFO ] Invariant cache hit.
[2023-03-16 14:56:47] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 122 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/539 places, 51/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 133 ms. Remains : 59/539 places, 51/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s57 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63980 steps with 4247 reset in 89 ms.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 438 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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(F(p0))||(G(p1)&&X(F(p2)))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-14
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 523 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 520 transition count 171
Applied a total of 5 rules in 27 ms. Remains 520 /539 variables (removed 19) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2023-03-16 14:56:47] [INFO ] Computed 351 place invariants in 6 ms
[2023-03-16 14:56:48] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-16 14:56:48] [INFO ] Invariant cache hit.
[2023-03-16 14:56:48] [INFO ] Implicit Places using invariants and state equation in 675 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1020 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 498/539 places, 171/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1057 ms. Remains : 498/539 places, 171/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497) (ADD s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462)), p0:(LEQ 1 (ADD s408 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25027 reset in 358 ms.
Product exploration explored 100000 steps with 24926 reset in 372 ms.
Computed a total of 498 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 498 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1287848 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1287848 steps, saw 169807 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 498 cols
[2023-03-16 14:56:53] [INFO ] Computed 330 place invariants in 5 ms
[2023-03-16 14:56:53] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:56:53] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 10 factoid took 424 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-16 14:56:54] [INFO ] Invariant cache hit.
[2023-03-16 14:56:54] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-16 14:56:54] [INFO ] Invariant cache hit.
[2023-03-16 14:56:55] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-16 14:56:55] [INFO ] Invariant cache hit.
[2023-03-16 14:56:55] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 498/498 places, 171/171 transitions.
Computed a total of 498 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 498 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 675 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1636 steps, run visited all 2 properties in 14 ms. (steps per millisecond=116 )
Probabilistic random walk after 1636 steps, saw 1559 distinct states, run finished after 14 ms. (steps per millisecond=116 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 474 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 6783 reset in 191 ms.
Product exploration explored 100000 steps with 6785 reset in 198 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-16 14:56:57] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-16 14:56:57] [INFO ] Invariant cache hit.
[2023-03-16 14:56:57] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 498/498 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin9491744417110529510
[2023-03-16 14:56:57] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491744417110529510
Running compilation step : cd /tmp/ltsmin9491744417110529510;'/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 415 ms.
Running link step : cd /tmp/ltsmin9491744417110529510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9491744417110529510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9499765960215679971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-16 14:57:12] [INFO ] Invariant cache hit.
[2023-03-16 14:57:13] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-16 14:57:13] [INFO ] Invariant cache hit.
[2023-03-16 14:57:13] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-16 14:57:13] [INFO ] Invariant cache hit.
[2023-03-16 14:57:13] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 498/498 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin14765842128843417690
[2023-03-16 14:57:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14765842128843417690
Running compilation step : cd /tmp/ltsmin14765842128843417690;'/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 429 ms.
Running link step : cd /tmp/ltsmin14765842128843417690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14765842128843417690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10144659726388833023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:57:28] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:57:28] [INFO ] Flatten gal took : 9 ms
[2023-03-16 14:57:28] [INFO ] Time to serialize gal into /tmp/LTL16693813497893674020.gal : 2 ms
[2023-03-16 14:57:28] [INFO ] Time to serialize properties into /tmp/LTL3473673426527203236.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/LTL16693813497893674020.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9664256730526614908.hoa' '-atoms' '/tmp/LTL3473673426527203236.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/LTL3473673426527203236.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9664256730526614908.hoa
Detected timeout of ITS tools.
[2023-03-16 14:57:43] [INFO ] Flatten gal took : 12 ms
[2023-03-16 14:57:43] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:57:43] [INFO ] Time to serialize gal into /tmp/LTL8690840222127408018.gal : 2 ms
[2023-03-16 14:57:43] [INFO ] Time to serialize properties into /tmp/LTL1801646987567634004.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/LTL8690840222127408018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1801646987567634004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))>=1)")))||((G("(((((CstopOK_0+CstopOK_1)+(Cst...563
Formula 0 simplified : XF(XG!"(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))>=1)" & (F!"(((((CstopOK_0+CstopOK_1)+(CstopOK_2+...547
Detected timeout of ITS tools.
[2023-03-16 14:57:59] [INFO ] Flatten gal took : 9 ms
[2023-03-16 14:57:59] [INFO ] Applying decomposition
[2023-03-16 14:57:59] [INFO ] Flatten gal took : 8 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/graph1649508948540898743.txt' '-o' '/tmp/graph1649508948540898743.bin' '-w' '/tmp/graph1649508948540898743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1649508948540898743.bin' '-l' '-1' '-v' '-w' '/tmp/graph1649508948540898743.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:57:59] [INFO ] Decomposing Gal with order
[2023-03-16 14:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:57:59] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-16 14:57:59] [INFO ] Flatten gal took : 55 ms
[2023-03-16 14:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 4 ms.
[2023-03-16 14:57:59] [INFO ] Time to serialize gal into /tmp/LTL2028351212355310285.gal : 3 ms
[2023-03-16 14:57:59] [INFO ] Time to serialize properties into /tmp/LTL17697605286680268138.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/LTL2028351212355310285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17697605286680268138.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(((((gu18.c1_0+gu18.c1_1)+(gu18.c1_2+gu18.c1_3))+((gu18.c1_4+gu18.c1_5)+(gu18.c1_6+gu18.c1_7)))+((gu18.c1_8+gu18.c1_9)+gu...970
Formula 0 simplified : XF(XG!"(((((gu18.c1_0+gu18.c1_1)+(gu18.c1_2+gu18.c1_3))+((gu18.c1_4+gu18.c1_5)+(gu18.c1_6+gu18.c1_7)))+((gu18.c1_8+gu18.c1_9)+gu18.c...954
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11362368815191726289
[2023-03-16 14:58:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11362368815191726289
Running compilation step : cd /tmp/ltsmin11362368815191726289;'/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 397 ms.
Running link step : cd /tmp/ltsmin11362368815191726289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11362368815191726289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp0==true)))||([]((LTLAPp1==true))&&X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 101821 ms.
[2023-03-16 14:58:29] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2974534794118987266
[2023-03-16 14:58:29] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-16 14:58:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:58:29] [INFO ] Applying decomposition
[2023-03-16 14:58:29] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-16 14:58:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:58:29] [INFO ] Flatten gal took : 12 ms
[2023-03-16 14:58:29] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-16 14:58:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:58:29] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2974534794118987266
Running compilation step : cd /tmp/ltsmin2974534794118987266;'/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'
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/graph5321630560833025168.txt' '-o' '/tmp/graph5321630560833025168.bin' '-w' '/tmp/graph5321630560833025168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5321630560833025168.bin' '-l' '-1' '-v' '-w' '/tmp/graph5321630560833025168.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:58:29] [INFO ] Decomposing Gal with order
[2023-03-16 14:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:58:29] [INFO ] Removed a total of 52 redundant transitions.
[2023-03-16 14:58:29] [INFO ] Flatten gal took : 58 ms
[2023-03-16 14:58:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-16 14:58:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality9756439816849620131.gal : 3 ms
[2023-03-16 14:58:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4729665179672610311.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/LTLCardinality9756439816849620131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4729665179672610311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F((G("(((((gu35.c1_0+gu35.c1_1)+(gu35.c1_2+gu35.c1_3))+((gu35.c1_4+gu35.c1_5)+(gu35.c1_6+gu35.c1_7)))+((gu35.c1_8+gu35.c1_9)+gu35.c...382
Formula 0 simplified : G(F!"(((((gu35.c1_0+gu35.c1_1)+(gu35.c1_2+gu35.c1_3))+((gu35.c1_4+gu35.c1_5)+(gu35.c1_6+gu35.c1_7)))+((gu35.c1_8+gu35.c1_9)+gu35.c1_...374
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin2974534794118987266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2974534794118987266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 15:20:57] [INFO ] Applying decomposition
[2023-03-16 15:20:57] [INFO ] Flatten gal took : 25 ms
[2023-03-16 15:20:57] [INFO ] Decomposing Gal with order
[2023-03-16 15:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:20:57] [INFO ] Removed a total of 171 redundant transitions.
[2023-03-16 15:20:57] [INFO ] Flatten gal took : 77 ms
[2023-03-16 15:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 5 ms.
[2023-03-16 15:20:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality337202071970859429.gal : 20 ms
[2023-03-16 15:20:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality18342501186051659463.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/LTLCardinality337202071970859429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18342501186051659463.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F((G("(((((gtsid0.c1_0+gtsid1.c1_1)+(gtsid2.c1_2+gtsid3.c1_3))+((gtsid4.c1_4+gtsid5.c1_5)+(gtsid6.c1_6+gtsid7.c1_7)))+((gtsid8.c1_8...432
Formula 0 simplified : G(F!"(((((gtsid0.c1_0+gtsid1.c1_1)+(gtsid2.c1_2+gtsid3.c1_3))+((gtsid4.c1_4+gtsid5.c1_5)+(gtsid6.c1_6+gtsid7.c1_7)))+((gtsid8.c1_8+g...424
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2974534794118987266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2974534794118987266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp3==true)))||([]((LTLAPp4==true))&&X(<>((LTLAPp5==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 15:43:25] [INFO ] Flatten gal took : 40 ms
[2023-03-16 15:43:25] [INFO ] Input system was already deterministic with 176 transitions.
[2023-03-16 15:43:25] [INFO ] Transformed 539 places.
[2023-03-16 15:43:25] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 15:43:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality7548977571375650321.gal : 2 ms
[2023-03-16 15:43:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality18400258864716839210.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/LTLCardinality7548977571375650321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18400258864716839210.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))<=AstopOK_0)"))||(G("(((((CstopOK_0+CstopOK_1)+(C...267
Formula 0 simplified : G(F!"(((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+((c1_8+c1_9)+c1_10))<=AstopOK_0)" & F!"(((((CstopOK_0+CstopOK_1)+(Cstop...259
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: LTL layer: formula: X([]((X(<>((LTLAPp3==true)))||([]((LTLAPp4==true))&&X(<>((LTLAPp5==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.007: "X([]((X(<>((LTLAPp3==true)))||([]((LTLAPp4==true))&&X(<>((LTLAPp5==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: 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( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.109: DFS-FIFO for weak LTL, using special progress label 183
pins2lts-mc-linux64( 0/ 8), 0.109: There are 184 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.109: State length is 540, there are 182 groups
pins2lts-mc-linux64( 0/ 8), 0.109: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.109: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.109: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.109: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.149: ~2 levels ~960 states ~3104 transitions
pins2lts-mc-linux64( 6/ 8), 0.172: ~2 levels ~1920 states ~6176 transitions
pins2lts-mc-linux64( 6/ 8), 0.221: ~2 levels ~3840 states ~11392 transitions
pins2lts-mc-linux64( 7/ 8), 0.325: ~2 levels ~7680 states ~29984 transitions
pins2lts-mc-linux64( 7/ 8), 0.514: ~2 levels ~15360 states ~80928 transitions
pins2lts-mc-linux64( 0/ 8), 0.815: ~2 levels ~30720 states ~150576 transitions
pins2lts-mc-linux64( 5/ 8), 1.378: ~2 levels ~61440 states ~319072 transitions
pins2lts-mc-linux64( 5/ 8), 2.171: ~2 levels ~122880 states ~614496 transitions
pins2lts-mc-linux64( 5/ 8), 3.729: ~2 levels ~245760 states ~1489344 transitions
pins2lts-mc-linux64( 5/ 8), 6.418: ~2 levels ~491520 states ~3222400 transitions
pins2lts-mc-linux64( 7/ 8), 11.018: ~2 levels ~983040 states ~6746256 transitions
pins2lts-mc-linux64( 7/ 8), 20.662: ~2 levels ~1966080 states ~14848848 transitions
pins2lts-mc-linux64( 7/ 8), 39.434: ~2 levels ~3932160 states ~30797168 transitions
pins2lts-mc-linux64( 7/ 8), 76.251: ~2 levels ~7864320 states ~60598736 transitions
pins2lts-mc-linux64( 7/ 8), 145.072: ~2 levels ~15728640 states ~114357952 transitions
pins2lts-mc-linux64( 1/ 8), 298.341: ~2 levels ~31457280 states ~223882800 transitions
pins2lts-mc-linux64( 7/ 8), 596.179: ~2 levels ~62914560 states ~446143632 transitions
pins2lts-mc-linux64( 5/ 8), 1022.976: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1023.320:
pins2lts-mc-linux64( 0/ 8), 1023.320: mean standard work distribution: 5.0% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1023.320:
pins2lts-mc-linux64( 0/ 8), 1023.320: Explored 98159099 states 762585373 transitions, fanout: 7.769
pins2lts-mc-linux64( 0/ 8), 1023.320: Total exploration time 1023.180 sec (1022.860 sec minimum, 1022.926 sec on average)
pins2lts-mc-linux64( 0/ 8), 1023.320: States per second: 95935, Transitions per second: 745309
pins2lts-mc-linux64( 0/ 8), 1023.320:
pins2lts-mc-linux64( 0/ 8), 1023.320: Progress states detected: 58159825
pins2lts-mc-linux64( 0/ 8), 1023.320: Redundant explorations: -15.6130
pins2lts-mc-linux64( 0/ 8), 1023.320:
pins2lts-mc-linux64( 0/ 8), 1023.320: Queue width: 8B, total height: 32599839, memory: 248.72MB
pins2lts-mc-linux64( 0/ 8), 1023.320: Tree memory: 1143.5MB, 10.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1023.320: Tree fill ratio (roots/leafs): 86.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1023.320: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1023.320: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1023.320: Est. total memory use: 1392.2MB (~1272.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2974534794118987266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp3==true)))||([]((LTLAPp4==true))&&X(<>((LTLAPp5==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2974534794118987266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(<>((LTLAPp3==true)))||([]((LTLAPp4==true))&&X(<>((LTLAPp5==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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7305652 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15541708 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-10"
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-10, 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-167873945900819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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