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-167873945900820.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900820
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678978427905

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 14:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 14:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:53:49] [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:53:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 14:53:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2023-03-16 14:53:50] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 14:53:50] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-16 14:53:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 8 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 10000 steps, including 541 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 14:53:50] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-16 14:53:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-16 14:53:50] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:53:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:53:50] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:53:50] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 14:53:50] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 1 ms.
[2023-03-16 14:53:50] [INFO ] Flatten gal took : 17 ms
[2023-03-16 14:53:50] [INFO ] Flatten gal took : 4 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2023-03-16 14:53:50] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 23 ms.
[2023-03-16 14:53:50] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 491 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 11 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:53:50] [INFO ] Computed 350 place invariants in 38 ms
[2023-03-16 14:53:50] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-16 14:53:50] [INFO ] Invariant cache hit.
[2023-03-16 14:53:51] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-16 14:53:51] [INFO ] Invariant cache hit.
[2023-03-16 14:53:51] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 524/550 places, 176/176 transitions.
Support contains 491 out of 524 places after structural reductions.
[2023-03-16 14:53:51] [INFO ] Flatten gal took : 38 ms
[2023-03-16 14:53:51] [INFO ] Flatten gal took : 32 ms
[2023-03-16 14:53:51] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 690 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-16 14:53:51] [INFO ] Invariant cache hit.
[2023-03-16 14:53:52] [INFO ] [Real]Absence check using 0 positive and 350 generalized place invariants in 47 ms returned sat
[2023-03-16 14:53:52] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-16 14:53:52] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 48 ms returned sat
[2023-03-16 14:53:53] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-16 14:53:54] [INFO ] After 1459ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-16 14:53:54] [INFO ] After 2504ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 12 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 13 properties in 17 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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).
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(G(p0))&&G(p1)))))'
Support contains 2 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 43 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:53:55] [INFO ] Invariant cache hit.
[2023-03-16 14:53:55] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-16 14:53:55] [INFO ] Invariant cache hit.
[2023-03-16 14:53:56] [INFO ] Implicit Places using invariants and state equation in 527 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 871 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 21 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 935 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s508 1), p0:(LT s510 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6924 reset in 245 ms.
Product exploration explored 100000 steps with 6921 reset in 187 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 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 9 ms. (steps per millisecond=52 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 9 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 223 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 110 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 16 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:53:58] [INFO ] Computed 340 place invariants in 22 ms
[2023-03-16 14:53:59] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-16 14:53:59] [INFO ] Invariant cache hit.
[2023-03-16 14:53:59] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2023-03-16 14:53:59] [INFO ] Invariant cache hit.
[2023-03-16 14:53:59] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 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 : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 688 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 4 ms. (steps per millisecond=117 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 5 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 137 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 p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6921 reset in 213 ms.
Product exploration explored 100000 steps with 6922 reset in 176 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 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 72 are kept as prefixes of interest. Removing 441 places using SCC suffix rule.8 ms
Discarding 441 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 72 transition count 53
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 1 with 1 rules applied. Total rules applied 57 place count 72 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 57 rules in 22 ms. Remains 72 /513 variables (removed 441) and now considering 54/176 (removed 122) transitions.
[2023-03-16 14:54:01] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 54 rows 72 cols
[2023-03-16 14:54:01] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-16 14:54:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/513 places, 54/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 72/513 places, 54/176 transitions.
Built C files in :
/tmp/ltsmin9503130808155597881
[2023-03-16 14:54:01] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9503130808155597881
Running compilation step : cd /tmp/ltsmin9503130808155597881;'/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 539 ms.
Running link step : cd /tmp/ltsmin9503130808155597881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9503130808155597881;'/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/stateBased13566382889113490405.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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 19 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:54:16] [INFO ] Computed 340 place invariants in 21 ms
[2023-03-16 14:54:16] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-16 14:54:16] [INFO ] Invariant cache hit.
[2023-03-16 14:54:17] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2023-03-16 14:54:17] [INFO ] Invariant cache hit.
[2023-03-16 14:54:17] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin1299965344701804431
[2023-03-16 14:54:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1299965344701804431
Running compilation step : cd /tmp/ltsmin1299965344701804431;'/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 430 ms.
Running link step : cd /tmp/ltsmin1299965344701804431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1299965344701804431;'/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/stateBased137219921256031699.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:54:32] [INFO ] Flatten gal took : 22 ms
[2023-03-16 14:54:32] [INFO ] Flatten gal took : 21 ms
[2023-03-16 14:54:32] [INFO ] Time to serialize gal into /tmp/LTL15750351143674385295.gal : 5 ms
[2023-03-16 14:54:32] [INFO ] Time to serialize properties into /tmp/LTL2173242459761380428.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/LTL15750351143674385295.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6287847724146201099.hoa' '-atoms' '/tmp/LTL2173242459761380428.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/LTL2173242459761380428.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6287847724146201099.hoa
Detected timeout of ITS tools.
[2023-03-16 14:54:47] [INFO ] Flatten gal took : 19 ms
[2023-03-16 14:54:47] [INFO ] Flatten gal took : 17 ms
[2023-03-16 14:54:47] [INFO ] Time to serialize gal into /tmp/LTL16672196464160519851.gal : 3 ms
[2023-03-16 14:54:47] [INFO ] Time to serialize properties into /tmp/LTL6972607725497556489.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/LTL16672196464160519851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6972607725497556489.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((F(G("(a2_0<1)")))&&(G("(a4_0<1)"))))))
Formula 0 simplified : XXF(!"(a4_0<1)" | GF!"(a2_0<1)")
Detected timeout of ITS tools.
[2023-03-16 14:55:02] [INFO ] Flatten gal took : 20 ms
[2023-03-16 14:55:02] [INFO ] Applying decomposition
[2023-03-16 14:55:02] [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/graph3568902147617448029.txt' '-o' '/tmp/graph3568902147617448029.bin' '-w' '/tmp/graph3568902147617448029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3568902147617448029.bin' '-l' '-1' '-v' '-w' '/tmp/graph3568902147617448029.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:55:02] [INFO ] Decomposing Gal with order
[2023-03-16 14:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:55:03] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 14:55:03] [INFO ] Flatten gal took : 62 ms
[2023-03-16 14:55:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 23 ms.
[2023-03-16 14:55:03] [INFO ] Time to serialize gal into /tmp/LTL16227699116203872916.gal : 9 ms
[2023-03-16 14:55:03] [INFO ] Time to serialize properties into /tmp/LTL3186212535590546157.ltl : 5 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/LTL16227699116203872916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3186212535590546157.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i3.u23.a2_0<1)")))&&(G("(i3.u65.a4_0<1)"))))))
Formula 0 simplified : XXF(!"(i3.u65.a4_0<1)" | GF!"(i3.u23.a2_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10433889574974196151
[2023-03-16 14:55:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10433889574974196151
Running compilation step : cd /tmp/ltsmin10433889574974196151;'/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 392 ms.
Running link step : cd /tmp/ltsmin10433889574974196151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10433889574974196151;'/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)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-00 finished in 98054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 23 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.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 14:55:33] [INFO ] Computed 350 place invariants in 13 ms
[2023-03-16 14:55:33] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-16 14:55:33] [INFO ] Invariant cache hit.
[2023-03-16 14:55:34] [INFO ] Implicit Places using invariants and state equation in 544 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 896 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 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 919 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s408 1) (GEQ s409 1) (GEQ s410 1) (GEQ s411 1) (GEQ s412 1) (GEQ s413 1) (GEQ s414 1) (GEQ s415 1) (GEQ s416 1) (GEQ s417 1) (GEQ s418 1) (GE...], 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 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-01 finished in 1082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 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 7 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:34] [INFO ] Invariant cache hit.
[2023-03-16 14:55:34] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-16 14:55:34] [INFO ] Invariant cache hit.
[2023-03-16 14:55:35] [INFO ] Implicit Places using invariants and state equation in 549 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 895 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 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 909 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s512 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15394 reset in 233 ms.
Product exploration explored 100000 steps with 15430 reset in 254 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 : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-03 finished in 1725 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((X(G((G(F(!p1)) U p2)))||p0)))'
Support contains 45 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 10 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:36] [INFO ] Invariant cache hit.
[2023-03-16 14:55:36] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 14:55:36] [INFO ] Invariant cache hit.
[2023-03-16 14:55:36] [INFO ] Implicit Places using invariants and state equation in 462 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 769 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 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 784 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), p1, p1, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s422 1) (GEQ s444 1)) (AND (GEQ s425 1) (GEQ s447 1)) (AND (GEQ s426 1) (GEQ s448 1)) (AND (GEQ s429 1) (GEQ s451 1)) (AND (GEQ s421 1) (...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 54452 steps with 3770 reset in 141 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-04 finished in 1156 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(((p2||X(p0))&&p1))))'
Support contains 276 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 7 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:37] [INFO ] Invariant cache hit.
[2023-03-16 14:55:37] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-16 14:55:37] [INFO ] Invariant cache hit.
[2023-03-16 14:55:37] [INFO ] Implicit Places using invariants and state equation in 360 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 570 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 2 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 580 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s13 1) (LT s24 1) (LT s35 1) (LT s46 1) (LT s57 1) (LT s68 1) (LT s79 1) (LT s90 1) (LT s101 1) (LT s112 1) (LT s431 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6924 reset in 328 ms.
Product exploration explored 100000 steps with 6927 reset in 333 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 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 458 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 14:55:39] [INFO ] Computed 340 place invariants in 20 ms
[2023-03-16 14:55:39] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2023-03-16 14:55:40] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:55:40] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2023-03-16 14:55:40] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:55:40] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-16 14:55:40] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 513 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 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 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:41] [INFO ] Invariant cache hit.
[2023-03-16 14:55:41] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-16 14:55:41] [INFO ] Invariant cache hit.
[2023-03-16 14:55:42] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-16 14:55:42] [INFO ] Invariant cache hit.
[2023-03-16 14:55:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 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 : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:55:43] [INFO ] Invariant cache hit.
[2023-03-16 14:55:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2023-03-16 14:55:43] [INFO ] After 245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 14:55:43] [INFO ] After 446ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:55:43] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:55:43] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2023-03-16 14:55:44] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:55:44] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-16 14:55:44] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6922 reset in 321 ms.
Product exploration explored 100000 steps with 6921 reset in 328 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 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 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 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 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 25 ms. Remains 501 /513 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:55:46] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 176 rows 501 cols
[2023-03-16 14:55:46] [INFO ] Computed 330 place invariants in 21 ms
[2023-03-16 14:55:46] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 501/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin14175270695078334807
[2023-03-16 14:55:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14175270695078334807
Running compilation step : cd /tmp/ltsmin14175270695078334807;'/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 468 ms.
Running link step : cd /tmp/ltsmin14175270695078334807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14175270695078334807;'/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/stateBased14889270415695646825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 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 6 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:56:01] [INFO ] Computed 340 place invariants in 20 ms
[2023-03-16 14:56:01] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-16 14:56:01] [INFO ] Invariant cache hit.
[2023-03-16 14:56:02] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-16 14:56:02] [INFO ] Invariant cache hit.
[2023-03-16 14:56:02] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin1120883180150900659
[2023-03-16 14:56:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1120883180150900659
Running compilation step : cd /tmp/ltsmin1120883180150900659;'/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 425 ms.
Running link step : cd /tmp/ltsmin1120883180150900659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1120883180150900659;'/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/stateBased12865977791569710144.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:56:17] [INFO ] Flatten gal took : 18 ms
[2023-03-16 14:56:17] [INFO ] Flatten gal took : 14 ms
[2023-03-16 14:56:17] [INFO ] Time to serialize gal into /tmp/LTL14948117373845912967.gal : 2 ms
[2023-03-16 14:56:17] [INFO ] Time to serialize properties into /tmp/LTL10182409198138292411.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/LTL14948117373845912967.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11330386318176094634.hoa' '-atoms' '/tmp/LTL10182409198138292411.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/LTL10182409198138292411.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11330386318176094634.hoa
Detected timeout of ITS tools.
[2023-03-16 14:56:32] [INFO ] Flatten gal took : 14 ms
[2023-03-16 14:56:32] [INFO ] Flatten gal took : 12 ms
[2023-03-16 14:56:32] [INFO ] Time to serialize gal into /tmp/LTL13107964867870537988.gal : 7 ms
[2023-03-16 14:56:32] [INFO ] Time to serialize properties into /tmp/LTL12419459117221666279.ltl : 6 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/LTL13107964867870537988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12419459117221666279.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(F("(((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1))))&&(((n2_8>=1)&&(n2_9>=...3807
Formula 0 simplified : XXG!"(((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1))))&&(((n2_8>=1)&&(n2_9>=1))&...3789
Detected timeout of ITS tools.
[2023-03-16 14:56:47] [INFO ] Flatten gal took : 15 ms
[2023-03-16 14:56:47] [INFO ] Applying decomposition
[2023-03-16 14:56:47] [INFO ] Flatten gal took : 13 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/graph3042408998840037112.txt' '-o' '/tmp/graph3042408998840037112.bin' '-w' '/tmp/graph3042408998840037112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3042408998840037112.bin' '-l' '-1' '-v' '-w' '/tmp/graph3042408998840037112.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:56:47] [INFO ] Decomposing Gal with order
[2023-03-16 14:56:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:56:47] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 14:56:47] [INFO ] Flatten gal took : 35 ms
[2023-03-16 14:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 12 ms.
[2023-03-16 14:56:47] [INFO ] Time to serialize gal into /tmp/LTL209857818522184383.gal : 4 ms
[2023-03-16 14:56:47] [INFO ] Time to serialize properties into /tmp/LTL6428272523949123270.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL209857818522184383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6428272523949123270.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i9.u36.n2_0>=1)&&(i2.i1.u37.n2_1>=1))&&((i5.i1.u26.n2_2>=1)&&(i6.u27.n2_3>=1)))&&(((i10.i1.u34.n2_4>=1)&&(i11.i1.u28.n...5227
Formula 0 simplified : XXG!"(((((i9.u36.n2_0>=1)&&(i2.i1.u37.n2_1>=1))&&((i5.i1.u26.n2_2>=1)&&(i6.u27.n2_3>=1)))&&(((i10.i1.u34.n2_4>=1)&&(i11.i1.u28.n2_5>...5209
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9761014006536750690
[2023-03-16 14:57:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9761014006536750690
Running compilation step : cd /tmp/ltsmin9761014006536750690;'/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 423 ms.
Running link step : cd /tmp/ltsmin9761014006536750690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9761014006536750690;'/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))))||[]((((LTLAPp2==true)||X((LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 100692 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)||(p1&&X(p0)))))'
Support contains 23 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 10 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:57:17] [INFO ] Computed 350 place invariants in 6 ms
[2023-03-16 14:57:18] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-16 14:57:18] [INFO ] Invariant cache hit.
[2023-03-16 14:57:18] [INFO ] Implicit Places using invariants and state equation in 467 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 811 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 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 827 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s446 1)) (AND (GEQ s0 1) (GEQ s447 1)) (AND (GEQ s0 1) (GEQ s448 1)) (AND (GEQ s0 1) (GEQ s449 1)) (AND (GEQ s0 1) (GEQ s442 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-07 finished in 1017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 22 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 14 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 14:57:18] [INFO ] Invariant cache hit.
[2023-03-16 14:57:19] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 14:57:19] [INFO ] Invariant cache hit.
[2023-03-16 14:57:19] [INFO ] Implicit Places using invariants and state equation in 517 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 828 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 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 848 ms. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-10 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s397 1) (GEQ s452 1)) (AND (GEQ s400 1) (GEQ s455 1)) (AND (GEQ s401 1) (GEQ s456 1)) (AND (GEQ s404 1) (GEQ s459 1)) (AND (GEQ s405 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-10 finished in 1116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(p1)&&F(G(p2)))))'
Support contains 144 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
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 509 transition count 171
Applied a total of 5 rules in 41 ms. Remains 509 /524 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 509 cols
[2023-03-16 14:57:20] [INFO ] Computed 340 place invariants in 12 ms
[2023-03-16 14:57:20] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-16 14:57:20] [INFO ] Invariant cache hit.
[2023-03-16 14:57:20] [INFO ] Implicit Places using invariants and state equation in 398 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 663 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/524 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 716 ms. Remains : 487/524 places, 171/176 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2) p0), p0, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s441 1)) (AND (GEQ s0 1) (GEQ s442 1)) (AND (GEQ s0 1) (GEQ s443 1)) (AND (GEQ s0 1) (GEQ s448 1)) (AND (GEQ s0 1) (GEQ s449 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-11 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 144 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.4 ms
Discarding 12 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 509 transition count 171
Applied a total of 5 rules in 24 ms. Remains 509 /524 variables (removed 15) and now considering 171/176 (removed 5) transitions.
[2023-03-16 14:57:20] [INFO ] Invariant cache hit.
[2023-03-16 14:57:21] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-16 14:57:21] [INFO ] Invariant cache hit.
[2023-03-16 14:57:21] [INFO ] Implicit Places using invariants and state equation in 400 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 661 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/524 places, 171/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 699 ms. Remains : 498/524 places, 171/176 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s248 1) (LT s259 1) (LT s270 1) (LT s281 1) (LT s292 1) (LT s303 1) (LT s314 1) (LT s325 1) (LT s336 1) (LT s347 1) (LT s358 1) (LT s424 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-13 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 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 106 are kept as prefixes of interest. Removing 418 places using SCC suffix rule.2 ms
Discarding 418 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 105 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 104 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 104 transition count 76
Applied a total of 47 rules in 12 ms. Remains 104 /524 variables (removed 420) and now considering 76/176 (removed 100) transitions.
// Phase 1: matrix 76 rows 104 cols
[2023-03-16 14:57:21] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-16 14:57:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-16 14:57:21] [INFO ] Invariant cache hit.
[2023-03-16 14:57:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 149 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/524 places, 76/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 93/524 places, 76/176 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6647 reset in 164 ms.
Product exploration explored 100000 steps with 6651 reset in 156 ms.
Computed a total of 93 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 76
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-14 finished in 676 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(G(p0))&&G(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLFireability-00
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 72 are kept as prefixes of interest. Removing 452 places using SCC suffix rule.2 ms
Discarding 452 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 71 transition count 52
Applied a total of 56 rules in 8 ms. Remains 71 /524 variables (removed 453) and now considering 52/176 (removed 124) transitions.
// Phase 1: matrix 52 rows 71 cols
[2023-03-16 14:57:22] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 14:57:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-16 14:57:22] [INFO ] Invariant cache hit.
[2023-03-16 14:57:22] [INFO ] Implicit Places using invariants and state equation in 62 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 115 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/524 places, 52/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 125 ms. Remains : 60/524 places, 52/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s56 1), p0:(LT s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6646 reset in 146 ms.
Product exploration explored 100000 steps with 6629 reset in 162 ms.
Computed a total of 60 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 615 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 417 steps, run visited all 1 properties in 4 ms. (steps per millisecond=104 )
Probabilistic random walk after 417 steps, saw 395 distinct states, run finished after 4 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 193 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 110 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 60 cols
[2023-03-16 14:57:24] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 14:57:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 14:57:24] [INFO ] Invariant cache hit.
[2023-03-16 14:57:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-16 14:57:24] [INFO ] Invariant cache hit.
[2023-03-16 14:57:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 60/60 places, 52/52 transitions.
Computed a total of 60 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 52
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 : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 121 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 619 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 48 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 417 steps, run visited all 1 properties in 4 ms. (steps per millisecond=104 )
Probabilistic random walk after 417 steps, saw 395 distinct states, run finished after 4 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 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 101 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6652 reset in 146 ms.
Product exploration explored 100000 steps with 6657 reset in 154 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 52/52 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 1 place count 60 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 53/52 (removed -1) transitions.
[2023-03-16 14:57:25] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 53 rows 60 cols
[2023-03-16 14:57:25] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 14:57:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/60 places, 53/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 60/60 places, 53/52 transitions.
Built C files in :
/tmp/ltsmin7275334196253047596
[2023-03-16 14:57:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7275334196253047596
Running compilation step : cd /tmp/ltsmin7275334196253047596;'/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 120 ms.
Running link step : cd /tmp/ltsmin7275334196253047596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7275334196253047596;'/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/stateBased1146239857449443039.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 60 cols
[2023-03-16 14:57:40] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 14:57:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-16 14:57:40] [INFO ] Invariant cache hit.
[2023-03-16 14:57:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-16 14:57:40] [INFO ] Invariant cache hit.
[2023-03-16 14:57:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 60/60 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin667747449522474621
[2023-03-16 14:57:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin667747449522474621
Running compilation step : cd /tmp/ltsmin667747449522474621;'/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 123 ms.
Running link step : cd /tmp/ltsmin667747449522474621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin667747449522474621;'/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/stateBased4910262087231112104.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:57:55] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:57:55] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:57:55] [INFO ] Time to serialize gal into /tmp/LTL270337081554513304.gal : 1 ms
[2023-03-16 14:57:55] [INFO ] Time to serialize properties into /tmp/LTL17243913779031450406.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/LTL270337081554513304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17160897006973294571.hoa' '-atoms' '/tmp/LTL17243913779031450406.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/LTL17243913779031450406.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17160897006973294571.hoa
Reverse transition relation is NOT exact ! Due to transitions t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72...296
Computing Next relation with stutter on 54168 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
166 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.67974,77084,1,0,233,350286,133,155,1784,421415,308
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-00 finished in 35345 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-00 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' '!((X(X(F(p0)))||G(((p2||X(p0))&&p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-10-LTLFireability-05
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 524 places. Attempting structural reductions.
Starting structural reductions in LI_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.3 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 510 transition count 172
Applied a total of 5 rules in 26 ms. Remains 510 /524 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 510 cols
[2023-03-16 14:57:58] [INFO ] Computed 340 place invariants in 12 ms
[2023-03-16 14:57:58] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-16 14:57:58] [INFO ] Invariant cache hit.
[2023-03-16 14:57:58] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 513 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/524 places, 172/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 545 ms. Remains : 499/524 places, 172/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s13 1) (LT s24 1) (LT s35 1) (LT s46 1) (LT s57 1) (LT s68 1) (LT s79 1) (LT s90 1) (LT s101 1) (LT s112 1) (LT s420 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6923 reset in 304 ms.
Product exploration explored 100000 steps with 6924 reset in 317 ms.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
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 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 420 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 172 rows 499 cols
[2023-03-16 14:58:00] [INFO ] Computed 330 place invariants in 16 ms
[2023-03-16 14:58:00] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 43 ms returned sat
[2023-03-16 14:58:00] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:58:00] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 41 ms returned sat
[2023-03-16 14:58:00] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:58:00] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-16 14:58:01] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 468 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 14:58:01] [INFO ] Invariant cache hit.
[2023-03-16 14:58:01] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-16 14:58:01] [INFO ] Invariant cache hit.
[2023-03-16 14:58:02] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-16 14:58:02] [INFO ] Invariant cache hit.
[2023-03-16 14:58:02] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 499/499 places, 172/172 transitions.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 689 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:58:03] [INFO ] Invariant cache hit.
[2023-03-16 14:58:03] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 42 ms returned sat
[2023-03-16 14:58:03] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:58:03] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 38 ms returned sat
[2023-03-16 14:58:03] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:58:03] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-16 14:58:04] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p2 (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 618 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6916 reset in 313 ms.
Product exploration explored 100000 steps with 6925 reset in 317 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 12 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 14:58:05] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 14:58:05] [INFO ] Invariant cache hit.
[2023-03-16 14:58:06] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 499/499 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin7920514932820734258
[2023-03-16 14:58:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7920514932820734258
Running compilation step : cd /tmp/ltsmin7920514932820734258;'/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 407 ms.
Running link step : cd /tmp/ltsmin7920514932820734258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7920514932820734258;'/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/stateBased16916301920897856203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 14:58:21] [INFO ] Invariant cache hit.
[2023-03-16 14:58:21] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-16 14:58:21] [INFO ] Invariant cache hit.
[2023-03-16 14:58:21] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-16 14:58:21] [INFO ] Invariant cache hit.
[2023-03-16 14:58:21] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 499/499 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin2793622581948976342
[2023-03-16 14:58:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2793622581948976342
Running compilation step : cd /tmp/ltsmin2793622581948976342;'/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 426 ms.
Running link step : cd /tmp/ltsmin2793622581948976342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2793622581948976342;'/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/stateBased2349017605942448784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 14:58:37] [INFO ] Flatten gal took : 17 ms
[2023-03-16 14:58:37] [INFO ] Flatten gal took : 11 ms
[2023-03-16 14:58:37] [INFO ] Time to serialize gal into /tmp/LTL4166130494472592679.gal : 2 ms
[2023-03-16 14:58:37] [INFO ] Time to serialize properties into /tmp/LTL17221271787170756986.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/LTL4166130494472592679.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13239485625178399722.hoa' '-atoms' '/tmp/LTL17221271787170756986.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17221271787170756986.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13239485625178399722.hoa
Detected timeout of ITS tools.
[2023-03-16 14:58:52] [INFO ] Flatten gal took : 13 ms
[2023-03-16 14:58:52] [INFO ] Flatten gal took : 15 ms
[2023-03-16 14:58:52] [INFO ] Time to serialize gal into /tmp/LTL10496354869141981749.gal : 2 ms
[2023-03-16 14:58:52] [INFO ] Time to serialize properties into /tmp/LTL10597031451554254498.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/LTL10496354869141981749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10597031451554254498.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(F("(((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1))))&&(((n2_8>=1)&&(n2_9>=...3807
Formula 0 simplified : XXG!"(((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1))))&&(((n2_8>=1)&&(n2_9>=1))&...3789
Detected timeout of ITS tools.
[2023-03-16 14:59:07] [INFO ] Flatten gal took : 15 ms
[2023-03-16 14:59:07] [INFO ] Applying decomposition
[2023-03-16 14:59:07] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7159237042152716772.txt' '-o' '/tmp/graph7159237042152716772.bin' '-w' '/tmp/graph7159237042152716772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7159237042152716772.bin' '-l' '-1' '-v' '-w' '/tmp/graph7159237042152716772.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:59:07] [INFO ] Decomposing Gal with order
[2023-03-16 14:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:59:07] [INFO ] Removed a total of 121 redundant transitions.
[2023-03-16 14:59:07] [INFO ] Flatten gal took : 29 ms
[2023-03-16 14:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 9 ms.
[2023-03-16 14:59:07] [INFO ] Time to serialize gal into /tmp/LTL17993037355956365716.gal : 4 ms
[2023-03-16 14:59:07] [INFO ] Time to serialize properties into /tmp/LTL490601332625929848.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17993037355956365716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL490601332625929848.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i10.u14.n2_0>=1)&&(i4.u24.n2_1>=1))&&((i2.u25.n2_2>=1)&&(i8.u26.n2_3>=1)))&&(((i5.u20.n2_4>=1)&&(i6.u16.n2_5>=1))&&((i...5051
Formula 0 simplified : XXG!"(((((i10.u14.n2_0>=1)&&(i4.u24.n2_1>=1))&&((i2.u25.n2_2>=1)&&(i8.u26.n2_3>=1)))&&(((i5.u20.n2_4>=1)&&(i6.u16.n2_5>=1))&&((i7.u1...5033
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18286702221951176647
[2023-03-16 14:59:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18286702221951176647
Running compilation step : cd /tmp/ltsmin18286702221951176647;'/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 431 ms.
Running link step : cd /tmp/ltsmin18286702221951176647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18286702221951176647;'/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))))||[]((((LTLAPp2==true)||X((LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 99665 ms.
[2023-03-16 14:59:37] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15125712941137618023
[2023-03-16 14:59:37] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-16 14:59:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:59:37] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-16 14:59:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:59:37] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-16 14:59:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:59:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15125712941137618023
Running compilation step : cd /tmp/ltsmin15125712941137618023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 14:59:37] [INFO ] Applying decomposition
[2023-03-16 14:59:37] [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/graph11101739404811129888.txt' '-o' '/tmp/graph11101739404811129888.bin' '-w' '/tmp/graph11101739404811129888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11101739404811129888.bin' '-l' '-1' '-v' '-w' '/tmp/graph11101739404811129888.weights' '-q' '0' '-e' '0.001'
[2023-03-16 14:59:37] [INFO ] Decomposing Gal with order
[2023-03-16 14:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 14:59:37] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 14:59:37] [INFO ] Flatten gal took : 28 ms
[2023-03-16 14:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 12 ms.
[2023-03-16 14:59:37] [INFO ] Time to serialize gal into /tmp/LTLFireability2683723806600599754.gal : 5 ms
[2023-03-16 14:59:37] [INFO ] Time to serialize properties into /tmp/LTLFireability13291856109345303924.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2683723806600599754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13291856109345303924.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i10.i1.u26.n2_0>=1)&&(i11.i1.u47.n2_1>=1))&&((i12.i0.u48.n2_2>=1)&&(i4.i1.u28.n2_3>=1)))&&(((i1.u29.n2_4>=1)&&(i7.i1.u...6045
Formula 0 simplified : XXG!"(((((i10.i1.u26.n2_0>=1)&&(i11.i1.u47.n2_1>=1))&&((i12.i0.u48.n2_2>=1)&&(i4.i1.u28.n2_3>=1)))&&(((i1.u29.n2_4>=1)&&(i7.i1.u30.n...6027
Compilation finished in 506 ms.
Running link step : cd /tmp/ltsmin15125712941137618023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15125712941137618023;'/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(<>((LTLAPp2==true))))||[]((((LTLAPp4==true)||X((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 72869 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 421706 ms.

BK_STOP 1678978855426

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945900820"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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