fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r329-tall-167889202000436
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Referendum-COL-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
451.048 8108.00 13414.00 453.60 TFFFFFTFFTFTFTFT normal

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.r329-tall-167889202000436.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 ltsminxred
Input is Referendum-COL-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202000436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 Referendum-COL-0100-LTLFireability-00
FORMULA_NAME Referendum-COL-0100-LTLFireability-01
FORMULA_NAME Referendum-COL-0100-LTLFireability-02
FORMULA_NAME Referendum-COL-0100-LTLFireability-03
FORMULA_NAME Referendum-COL-0100-LTLFireability-04
FORMULA_NAME Referendum-COL-0100-LTLFireability-05
FORMULA_NAME Referendum-COL-0100-LTLFireability-06
FORMULA_NAME Referendum-COL-0100-LTLFireability-07
FORMULA_NAME Referendum-COL-0100-LTLFireability-08
FORMULA_NAME Referendum-COL-0100-LTLFireability-09
FORMULA_NAME Referendum-COL-0100-LTLFireability-10
FORMULA_NAME Referendum-COL-0100-LTLFireability-11
FORMULA_NAME Referendum-COL-0100-LTLFireability-12
FORMULA_NAME Referendum-COL-0100-LTLFireability-13
FORMULA_NAME Referendum-COL-0100-LTLFireability-14
FORMULA_NAME Referendum-COL-0100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679131117794

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:18:39] [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-18 09:18:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 09:18:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2023-03-18 09:18:39] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 301 PT places and 201.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 09:18:40] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2023-03-18 09:18:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-COL-0100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=0 )
[2023-03-18 09:18:40] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:18:40] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]]] introduces in Voters(100) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 100
[2023-03-18 09:18:40] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 9 ms.
[2023-03-18 09:18:40] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-COL-0100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 11 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 09:18:40] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-18 09:18:40] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-18 09:18:40] [INFO ] Invariant cache hit.
[2023-03-18 09:18:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-18 09:18:40] [INFO ] Invariant cache hit.
[2023-03-18 09:18:40] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-18 09:18:40] [INFO ] Flatten gal took : 3 ms
[2023-03-18 09:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 09:18:40] [INFO ] Input system was already deterministic with 2 transitions.
Finished random walk after 102 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=102 )
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 2 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:40] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 09:18:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 980 reset in 185 ms.
Product exploration explored 100000 steps with 980 reset in 93 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT 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 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLFireability-00 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-01 finished in 186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(!p1)))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-18 09:18:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:41] [INFO ] Invariant cache hit.
[2023-03-18 09:18:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s0 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 101 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-02 finished in 214 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)) U G(!p1)))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 09:18:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 133 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(OR (GEQ s0 1) (GEQ s1 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 101 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-03 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (X(!p0) U p1))||G(!p0))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (OR (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(LT s0 1), p1:(GEQ s1 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-04 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(G(!p0))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-05 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-18 09:18:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1), p1:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-07 finished in 117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 09:18:42] [INFO ] Invariant cache hit.
[2023-03-18 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-08 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLFireability-09 finished in 439 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(p0)&&(X(!p1) U (X(G(!p1))||(X(!p1)&&(!p1 U (!p2||G(!p1)))))))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s1 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-10 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p0)&&F(!p0)))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-18 09:18:43] [INFO ] Invariant cache hit.
[2023-03-18 09:18:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 980 reset in 51 ms.
Product exploration explored 100000 steps with 980 reset in 70 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT 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 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0100-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLFireability-11 finished in 415 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 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 09:18:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-13 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 s0 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 980 reset in 34 ms.
Product exploration explored 100000 steps with 980 reset in 48 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT 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 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLFireability-13 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 09:18:44] [INFO ] Invariant cache hit.
[2023-03-18 09:18:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LT s0 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLFireability-14 finished in 174 ms.
All properties solved by simple procedures.
Total runtime 5257 ms.
ITS solved all properties within timeout

BK_STOP 1679131125902

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Referendum-COL-0100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Referendum-COL-0100, 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 r329-tall-167889202000436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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