Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572200379.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.4K Apr 29 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 22K May 10 09:34 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-COL-0500-LTLCardinality-01
FORMULA_NAME Referendum-COL-0500-LTLCardinality-02
FORMULA_NAME Referendum-COL-0500-LTLCardinality-03
FORMULA_NAME Referendum-COL-0500-LTLCardinality-04
FORMULA_NAME Referendum-COL-0500-LTLCardinality-05
FORMULA_NAME Referendum-COL-0500-LTLCardinality-06
FORMULA_NAME Referendum-COL-0500-LTLCardinality-07
FORMULA_NAME Referendum-COL-0500-LTLCardinality-08
FORMULA_NAME Referendum-COL-0500-LTLCardinality-09
FORMULA_NAME Referendum-COL-0500-LTLCardinality-10
FORMULA_NAME Referendum-COL-0500-LTLCardinality-11
FORMULA_NAME Referendum-COL-0500-LTLCardinality-12
FORMULA_NAME Referendum-COL-0500-LTLCardinality-13
FORMULA_NAME Referendum-COL-0500-LTLCardinality-14
FORMULA_NAME Referendum-COL-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083220975

Running Version 202205111006
[2022-05-20 21:47:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:47:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:47:02] [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.
[2022-05-20 21:47:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:47:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2022-05-20 21:47:03] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 1501 PT places and 1001.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0500-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:47:03] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2022-05-20 21:47:03] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-COL-0500-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0500-LTLCardinality-14 TRUE 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 12 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).
Incomplete random walk after 10059 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=457 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:03] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-20 21:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-20 21:47:03] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Referendum-COL-0500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:47:03] [INFO ] Flatten gal took : 20 ms
[2022-05-20 21:47:03] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Arc [3:1*[20]] contains constants of sort Voters
Arc [3:1*[21]] contains constants of sort Voters
Arc [3:1*[22]] contains constants of sort Voters
Arc [3:1*[23]] contains constants of sort Voters
Arc [3:1*[24]] contains constants of sort Voters
Arc [3:1*[25]] contains constants of sort Voters
Arc [3:1*[26]] contains constants of sort Voters
Arc [3:1*[27]] contains constants of sort Voters
Arc [3:1*[28]] contains constants of sort Voters
Arc [3:1*[29]] contains constants of sort Voters
Arc [3:1*[30]] contains constants of sort Voters
Arc [3:1*[31]] contains constants of sort Voters
Arc [3:1*[32]] contains constants of sort Voters
Arc [3:1*[33]] contains constants of sort Voters
Arc [3:1*[34]] contains constants of sort Voters
Arc [3:1*[35]] contains constants of sort Voters
Arc [3:1*[36]] contains constants of sort Voters
Arc [3:1*[37]] contains constants of sort Voters
Arc [3:1*[38]] contains constants of sort Voters
Arc [3:1*[39]] contains constants of sort Voters
Arc [3:1*[40]] contains constants of sort Voters
Arc [3:1*[41]] contains constants of sort Voters
Arc [3:1*[42]] contains constants of sort Voters
Arc [3:1*[43]] contains constants of sort Voters
Arc [3:1*[44]] contains constants of sort Voters
Arc [3:1*[45]] contains constants of sort Voters
Arc [3:1*[46]] contains constants of sort Voters
Arc [3:1*[47]] contains constants of sort Voters
Arc [3:1*[48]] contains constants of sort Voters
Arc [3:1*[49]] contains constants of sort Voters
Arc [3:1*[50]] contains constants of sort Voters
Arc [3:1*[51]] contains constants of sort Voters
Arc [3:1*[52]] contains constants of sort Voters
Arc [3:1*[53]] contains constants of sort Voters
Arc [3:1*[54]] contains constants of sort Voters
Arc [3:1*[55]] contains constants of sort Voters
Arc [3:1*[56]] contains constants of sort Voters
Arc [3:1*[57]] contains constants of sort Voters
Arc [3:1*[58]] contains constants of sort Voters
Arc [3:1*[59]] contains constants of sort Voters
Arc [3:1*[60]] contains constants of sort Voters
Arc [3:1*[61]] contains constants of sort Voters
Arc [3:1*[62]] contains constants of sort Voters
Arc [3:1*[63]] contains constants of sort Voters
Arc [3:1*[64]] contains constants of sort Voters
Arc [3:1*[65]] contains constants of sort Voters
Arc [3:1*[66]] contains constants of sort Voters
Arc [3:1*[67]] contains constants of sort Voters
Arc [3:1*[68]] contains constants of sort Voters
Arc [3:1*[69]] contains constants of sort Voters
Arc [3:1*[70]] contains constants of sort Voters
Arc [3:1*[71]] contains constants of sort Voters
Arc [3:1*[72]] contains constants of sort Voters
Arc [3:1*[73]] contains constants of sort Voters
Arc [3:1*[74]] contains constants of sort Voters
Arc [3:1*[75]] contains constants of sort Voters
Arc [3:1*[76]] contains constants of sort Voters
Arc [3:1*[77]] contains constants of sort Voters
Arc [3:1*[78]] contains constants of sort Voters
Arc [3:1*[79]] contains constants of sort Voters
Arc [3:1*[80]] contains constants of sort Voters
Arc [3:1*[81]] contains constants of sort Voters
Arc [3:1*[82]] contains constants of sort Voters
Arc [3:1*[83]] contains constants of sort Voters
Arc [3:1*[84]] contains constants of sort Voters
Arc [3:1*[85]] contains constants of sort Voters
Arc [3:1*[86]] contains constants of sort Voters
Arc [3:1*[87]] contains constants of sort Voters
Arc [3:1*[88]] contains constants of sort Voters
Arc [3:1*[89]] contains constants of sort Voters
Arc [3:1*[90]] contains constants of sort Voters
Arc [3:1*[91]] contains constants of sort Voters
Arc [3:1*[92]] contains constants of sort Voters
Arc [3:1*[93]] contains constants of sort Voters
Arc [3:1*[94]] contains constants of sort Voters
Arc [3:1*[95]] contains constants of sort Voters
Arc [3:1*[96]] contains constants of sort Voters
Arc [3:1*[97]] contains constants of sort Voters
Arc [3:1*[98]] contains constants of sort Voters
Arc [3:1*[99]] contains constants of sort Voters
Arc [3:1*[100]] contains constants of sort Voters
Arc [3:1*[101]] contains constants of sort Voters
Arc [3:1*[102]] contains constants of sort Voters
Arc [3:1*[103]] contains constants of sort Voters
Arc [3:1*[104]] contains constants of sort Voters
Arc [3:1*[105]] contains constants of sort Voters
Arc [3:1*[106]] contains constants of sort Voters
Arc [3:1*[107]] contains constants of sort Voters
Arc [3:1*[108]] contains constants of sort Voters
Arc [3:1*[109]] contains constants of sort Voters
Arc [3:1*[110]] contains constants of sort Voters
Arc [3:1*[111]] contains constants of sort Voters
Arc [3:1*[112]] contains constants of sort Voters
Arc [3:1*[113]] contains constants of sort Voters
Arc [3:1*[114]] contains constants of sort Voters
Arc [3:1*[115]] contains constants of sort Voters
Arc [3:1*[116]] contains constants of sort Voters
Arc [3:1*[117]] contains constants of sort Voters
Arc [3:1*[118]] contains constants of sort Voters
Arc [3:1*[119]] contains constants of sort Voters
Arc [3:1*[120]] contains constants of sort Voters
Arc [3:1*[121]] contains constants of sort Voters
Arc [3:1*[122]] contains constants of sort Voters
Arc [3:1*[123]] contains constants of sort Voters
Arc [3:1*[124]] contains constants of sort Voters
Arc [3:1*[125]] contains constants of sort Voters
Arc [3:1*[126]] contains constants of sort Voters
Arc [3:1*[127]] contains constants of sort Voters
Arc [3:1*[128]] contains constants of sort Voters
Arc [3:1*[129]] contains constants of sort Voters
Arc [3:1*[130]] contains constants of sort Voters
Arc [3:1*[131]] contains constants of sort Voters
Arc [3:1*[132]] contains constants of sort Voters
Arc [3:1*[133]] contains constants of sort Voters
Arc [3:1*[134]] contains constants of sort Voters
Arc [3:1*[135]] contains constants of sort Voters
Arc [3:1*[136]] contains constants of sort Voters
Arc [3:1*[137]] contains constants of sort Voters
Arc [3:1*[138]] contains constants of sort Voters
Arc [3:1*[139]] contains constants of sort Voters
Arc [3:1*[140]] contains constants of sort Voters
Arc [3:1*[141]] contains constants of sort Voters
Arc [3:1*[142]] contains constants of sort Voters
Arc [3:1*[143]] contains constants of sort Voters
Arc [3:1*[144]] contains constants of sort Voters
Arc [3:1*[145]] contains constants of sort Voters
Arc [3:1*[146]] contains constants of sort Voters
Arc [3:1*[147]] contains constants of sort Voters
Arc [3:1*[148]] contains constants of sort Voters
Arc [3:1*[149]] contains constants of sort Voters
Arc [3:1*[150]] contains constants of sort Voters
Arc [3:1*[151]] contains constants of sort Voters
Arc [3:1*[152]] contains constants of sort Voters
Arc [3:1*[153]] contains constants of sort Voters
Arc [3:1*[154]] contains constants of sort Voters
Arc [3:1*[155]] contains constants of sort Voters
Arc [3:1*[156]] contains constants of sort Voters
Arc [3:1*[157]] contains constants of sort Voters
Arc [3:1*[158]] contains constants of sort Voters
Arc [3:1*[159]] contains constants of sort Voters
Arc [3:1*[160]] contains constants of sort Voters
Arc [3:1*[161]] contains constants of sort Voters
Arc [3:1*[162]] contains constants of sort Voters
Arc [3:1*[163]] contains constants of sort Voters
Arc [3:1*[164]] contains constants of sort Voters
Arc [3:1*[165]] contains constants of sort Voters
Arc [3:1*[166]] contains constants of sort Voters
Arc [3:1*[167]] contains constants of sort Voters
Arc [3:1*[168]] contains constants of sort Voters
Arc [3:1*[169]] contains constants of sort Voters
Arc [3:1*[170]] contains constants of sort Voters
Arc [3:1*[171]] contains constants of sort Voters
Arc [3:1*[172]] contains constants of sort Voters
Arc [3:1*[173]] contains constants of sort Voters
Arc [3:1*[174]] contains constants of sort Voters
Arc [3:1*[175]] contains constants of sort Voters
Arc [3:1*[176]] contains constants of sort Voters
Arc [3:1*[177]] contains constants of sort Voters
Arc [3:1*[178]] contains constants of sort Voters
Arc [3:1*[179]] contains constants of sort Voters
Arc [3:1*[180]] contains constants of sort Voters
Arc [3:1*[181]] contains constants of sort Voters
Arc [3:1*[182]] contains constants of sort Voters
Arc [3:1*[183]] contains constants of sort Voters
Arc [3:1*[184]] contains constants of sort Voters
Arc [3:1*[185]] contains constants of sort Voters
Arc [3:1*[186]] contains constants of sort Voters
Arc [3:1*[187]] contains constants of sort Voters
Arc [3:1*[188]] contains constants of sort Voters
Arc [3:1*[189]] contains constants of sort Voters
Arc [3:1*[190]] contains constants of sort Voters
Arc [3:1*[191]] contains constants of sort Voters
Arc [3:1*[192]] contains constants of sort Voters
Arc [3:1*[193]] contains constants of sort Voters
Arc [3:1*[194]] contains constants of sort Voters
Arc [3:1*[195]] contains constants of sort Voters
Arc [3:1*[196]] contains constants of sort Voters
Arc [3:1*[197]] contains constants of sort Voters
Arc [3:1*[198]] contains constants of sort Voters
Arc [3:1*[199]] contains constants of sort Voters
Arc [3:1*[200]] contains constants of sort Voters
Arc [3:1*[201]] contains constants of sort Voters
Arc [3:1*[202]] contains constants of sort Voters
Arc [3:1*[203]] contains constants of sort Voters
Arc [3:1*[204]] contains constants of sort Voters
Arc [3:1*[205]] contains constants of sort Voters
Arc [3:1*[206]] contains constants of sort Voters
Arc [3:1*[207]] contains constants of sort Voters
Arc [3:1*[208]] contains constants of sort Voters
Arc [3:1*[209]] contains constants of sort Voters
Arc [3:1*[210]] contains constants of sort Voters
Arc [3:1*[211]] contains constants of sort Voters
Arc [3:1*[212]] contains constants of sort Voters
Arc [3:1*[213]] contains constants of sort Voters
Arc [3:1*[214]] contains constants of sort Voters
Arc [3:1*[215]] contains constants of sort Voters
Arc [3:1*[216]] contains constants of sort Voters
Arc [3:1*[217]] contains constants of sort Voters
Arc [3:1*[218]] contains constants of sort Voters
Arc [3:1*[219]] contains constants of sort Voters
Arc [3:1*[220]] contains constants of sort Voters
Arc [3:1*[221]] contains constants of sort Voters
Arc [3:1*[222]] contains constants of sort Voters
Arc [3:1*[223]] contains constants of sort Voters
Arc [3:1*[224]] contains constants of sort Voters
Arc [3:1*[225]] contains constants of sort Voters
Arc [3:1*[226]] contains constants of sort Voters
Arc [3:1*[227]] contains constants of sort Voters
Arc [3:1*[228]] contains constants of sort Voters
Arc [3:1*[229]] contains constants of sort Voters
Arc [3:1*[230]] contains constants of sort Voters
Arc [3:1*[231]] contains constants of sort Voters
Arc [3:1*[232]] contains constants of sort Voters
Arc [3:1*[233]] contains constants of sort Voters
Arc [3:1*[234]] contains constants of sort Voters
Arc [3:1*[235]] contains constants of sort Voters
Arc [3:1*[236]] contains constants of sort Voters
Arc [3:1*[237]] contains constants of sort Voters
Arc [3:1*[238]] contains constants of sort Voters
Arc [3:1*[239]] contains constants of sort Voters
Arc [3:1*[240]] contains constants of sort Voters
Arc [3:1*[241]] contains constants of sort Voters
Arc [3:1*[242]] contains constants of sort Voters
Arc [3:1*[243]] contains constants of sort Voters
Arc [3:1*[244]] contains constants of sort Voters
Arc [3:1*[245]] contains constants of sort Voters
Arc [3:1*[246]] contains constants of sort Voters
Arc [3:1*[247]] contains constants of sort Voters
Arc [3:1*[248]] contains constants of sort Voters
Arc [3:1*[249]] contains constants of sort Voters
Arc [3:1*[250]] contains constants of sort Voters
Arc [3:1*[251]] contains constants of sort Voters
Arc [3:1*[252]] contains constants of sort Voters
Arc [3:1*[253]] contains constants of sort Voters
Arc [3:1*[254]] contains constants of sort Voters
Arc [3:1*[255]] contains constants of sort Voters
Arc [3:1*[256]] contains constants of sort Voters
Arc [3:1*[257]] contains constants of sort Voters
Arc [3:1*[258]] contains constants of sort Voters
Arc [3:1*[259]] contains constants of sort Voters
Arc [3:1*[260]] contains constants of sort Voters
Arc [3:1*[261]] contains constants of sort Voters
Arc [3:1*[262]] contains constants of sort Voters
Arc [3:1*[263]] contains constants of sort Voters
Arc [3:1*[264]] contains constants of sort Voters
Arc [3:1*[265]] contains constants of sort Voters
Arc [3:1*[266]] contains constants of sort Voters
Arc [3:1*[267]] contains constants of sort Voters
Arc [3:1*[268]] contains constants of sort Voters
Arc [3:1*[269]] contains constants of sort Voters
Arc [3:1*[270]] contains constants of sort Voters
Arc [3:1*[271]] contains constants of sort Voters
Arc [3:1*[272]] contains constants of sort Voters
Arc [3:1*[273]] contains constants of sort Voters
Arc [3:1*[274]] contains constants of sort Voters
Arc [3:1*[275]] contains constants of sort Voters
Arc [3:1*[276]] contains constants of sort Voters
Arc [3:1*[277]] contains constants of sort Voters
Arc [3:1*[278]] contains constants of sort Voters
Arc [3:1*[279]] contains constants of sort Voters
Arc [3:1*[280]] contains constants of sort Voters
Arc [3:1*[281]] contains constants of sort Voters
Arc [3:1*[282]] contains constants of sort Voters
Arc [3:1*[283]] contains constants of sort Voters
Arc [3:1*[284]] contains constants of sort Voters
Arc [3:1*[285]] contains constants of sort Voters
Arc [3:1*[286]] contains constants of sort Voters
Arc [3:1*[287]] contains constants of sort Voters
Arc [3:1*[288]] contains constants of sort Voters
Arc [3:1*[289]] contains constants of sort Voters
Arc [3:1*[290]] contains constants of sort Voters
Arc [3:1*[291]] contains constants of sort Voters
Arc [3:1*[292]] contains constants of sort Voters
Arc [3:1*[293]] contains constants of sort Voters
Arc [3:1*[294]] contains constants of sort Voters
Arc [3:1*[295]] contains constants of sort Voters
Arc [3:1*[296]] contains constants of sort Voters
Arc [3:1*[297]] contains constants of sort Voters
Arc [3:1*[298]] contains constants of sort Voters
Arc [3:1*[299]] contains constants of sort Voters
Arc [3:1*[300]] contains constants of sort Voters
Arc [3:1*[301]] contains constants of sort Voters
Arc [3:1*[302]] contains constants of sort Voters
Arc [3:1*[303]] contains constants of sort Voters
Arc [3:1*[304]] contains constants of sort Voters
Arc [3:1*[305]] contains constants of sort Voters
Arc [3:1*[306]] contains constants of sort Voters
Arc [3:1*[307]] contains constants of sort Voters
Arc [3:1*[308]] contains constants of sort Voters
Arc [3:1*[309]] contains constants of sort Voters
Arc [3:1*[310]] contains constants of sort Voters
Arc [3:1*[311]] contains constants of sort Voters
Arc [3:1*[312]] contains constants of sort Voters
Arc [3:1*[313]] contains constants of sort Voters
Arc [3:1*[314]] contains constants of sort Voters
Arc [3:1*[315]] contains constants of sort Voters
Arc [3:1*[316]] contains constants of sort Voters
Arc [3:1*[317]] contains constants of sort Voters
Arc [3:1*[318]] contains constants of sort Voters
Arc [3:1*[319]] contains constants of sort Voters
Arc [3:1*[320]] contains constants of sort Voters
Arc [3:1*[321]] contains constants of sort Voters
Arc [3:1*[322]] contains constants of sort Voters
Arc [3:1*[323]] contains constants of sort Voters
Arc [3:1*[324]] contains constants of sort Voters
Arc [3:1*[325]] contains constants of sort Voters
Arc [3:1*[326]] contains constants of sort Voters
Arc [3:1*[327]] contains constants of sort Voters
Arc [3:1*[328]] contains constants of sort Voters
Arc [3:1*[329]] contains constants of sort Voters
Arc [3:1*[330]] contains constants of sort Voters
Arc [3:1*[331]] contains constants of sort Voters
Arc [3:1*[332]] contains constants of sort Voters
Arc [3:1*[333]] contains constants of sort Voters
Arc [3:1*[334]] contains constants of sort Voters
Arc [3:1*[335]] contains constants of sort Voters
Arc [3:1*[336]] contains constants of sort Voters
Arc [3:1*[337]] contains constants of sort Voters
Arc [3:1*[338]] contains constants of sort Voters
Arc [3:1*[339]] contains constants of sort Voters
Arc [3:1*[340]] contains constants of sort Voters
Arc [3:1*[341]] contains constants of sort Voters
Arc [3:1*[342]] contains constants of sort Voters
Arc [3:1*[343]] contains constants of sort Voters
Arc [3:1*[344]] contains constants of sort Voters
Arc [3:1*[345]] contains constants of sort Voters
Arc [3:1*[346]] contains constants of sort Voters
Arc [3:1*[347]] contains constants of sort Voters
Arc [3:1*[348]] contains constants of sort Voters
Arc [3:1*[349]] contains constants of sort Voters
Arc [3:1*[350]] contains constants of sort Voters
Arc [3:1*[351]] contains constants of sort Voters
Arc [3:1*[352]] contains constants of sort Voters
Arc [3:1*[353]] contains constants of sort Voters
Arc [3:1*[354]] contains constants of sort Voters
Arc [3:1*[355]] contains constants of sort Voters
Arc [3:1*[356]] contains constants of sort Voters
Arc [3:1*[357]] contains constants of sort Voters
Arc [3:1*[358]] contains constants of sort Voters
Arc [3:1*[359]] contains constants of sort Voters
Arc [3:1*[360]] contains constants of sort Voters
Arc [3:1*[361]] contains constants of sort Voters
Arc [3:1*[362]] contains constants of sort Voters
Arc [3:1*[363]] contains constants of sort Voters
Arc [3:1*[364]] contains constants of sort Voters
Arc [3:1*[365]] contains constants of sort Voters
Arc [3:1*[366]] contains constants of sort Voters
Arc [3:1*[367]] contains constants of sort Voters
Arc [3:1*[368]] contains constants of sort Voters
Arc [3:1*[369]] contains constants of sort Voters
Arc [3:1*[370]] contains constants of sort Voters
Arc [3:1*[371]] contains constants of sort Voters
Arc [3:1*[372]] contains constants of sort Voters
Arc [3:1*[373]] contains constants of sort Voters
Arc [3:1*[374]] contains constants of sort Voters
Arc [3:1*[375]] contains constants of sort Voters
Arc [3:1*[376]] contains constants of sort Voters
Arc [3:1*[377]] contains constants of sort Voters
Arc [3:1*[378]] contains constants of sort Voters
Arc [3:1*[379]] contains constants of sort Voters
Arc [3:1*[380]] contains constants of sort Voters
Arc [3:1*[381]] contains constants of sort Voters
Arc [3:1*[382]] contains constants of sort Voters
Arc [3:1*[383]] contains constants of sort Voters
Arc [3:1*[384]] contains constants of sort Voters
Arc [3:1*[385]] contains constants of sort Voters
Arc [3:1*[386]] contains constants of sort Voters
Arc [3:1*[387]] contains constants of sort Voters
Arc [3:1*[388]] contains constants of sort Voters
Arc [3:1*[389]] contains constants of sort Voters
Arc [3:1*[390]] contains constants of sort Voters
Arc [3:1*[391]] contains constants of sort Voters
Arc [3:1*[392]] contains constants of sort Voters
Arc [3:1*[393]] contains constants of sort Voters
Arc [3:1*[394]] contains constants of sort Voters
Arc [3:1*[395]] contains constants of sort Voters
Arc [3:1*[396]] contains constants of sort Voters
Arc [3:1*[397]] contains constants of sort Voters
Arc [3:1*[398]] contains constants of sort Voters
Arc [3:1*[399]] contains constants of sort Voters
Arc [3:1*[400]] contains constants of sort Voters
Arc [3:1*[401]] contains constants of sort Voters
Arc [3:1*[402]] contains constants of sort Voters
Arc [3:1*[403]] contains constants of sort Voters
Arc [3:1*[404]] contains constants of sort Voters
Arc [3:1*[405]] contains constants of sort Voters
Arc [3:1*[406]] contains constants of sort Voters
Arc [3:1*[407]] contains constants of sort Voters
Arc [3:1*[408]] contains constants of sort Voters
Arc [3:1*[409]] contains constants of sort Voters
Arc [3:1*[410]] contains constants of sort Voters
Arc [3:1*[411]] contains constants of sort Voters
Arc [3:1*[412]] contains constants of sort Voters
Arc [3:1*[413]] contains constants of sort Voters
Arc [3:1*[414]] contains constants of sort Voters
Arc [3:1*[415]] contains constants of sort Voters
Arc [3:1*[416]] contains constants of sort Voters
Arc [3:1*[417]] contains constants of sort Voters
Arc [3:1*[418]] contains constants of sort Voters
Arc [3:1*[419]] contains constants of sort Voters
Arc [3:1*[420]] contains constants of sort Voters
Arc [3:1*[421]] contains constants of sort Voters
Arc [3:1*[422]] contains constants of sort Voters
Arc [3:1*[423]] contains constants of sort Voters
Arc [3:1*[424]] contains constants of sort Voters
Arc [3:1*[425]] contains constants of sort Voters
Arc [3:1*[426]] contains constants of sort Voters
Arc [3:1*[427]] contains constants of sort Voters
Arc [3:1*[428]] contains constants of sort Voters
Arc [3:1*[429]] contains constants of sort Voters
Arc [3:1*[430]] contains constants of sort Voters
Arc [3:1*[431]] contains constants of sort Voters
Arc [3:1*[432]] contains constants of sort Voters
Arc [3:1*[433]] contains constants of sort Voters
Arc [3:1*[434]] contains constants of sort Voters
Arc [3:1*[435]] contains constants of sort Voters
Arc [3:1*[436]] contains constants of sort Voters
Arc [3:1*[437]] contains constants of sort Voters
Arc [3:1*[438]] contains constants of sort Voters
Arc [3:1*[439]] contains constants of sort Voters
Arc [3:1*[440]] contains constants of sort Voters
Arc [3:1*[441]] contains constants of sort Voters
Arc [3:1*[442]] contains constants of sort Voters
Arc [3:1*[443]] contains constants of sort Voters
Arc [3:1*[444]] contains constants of sort Voters
Arc [3:1*[445]] contains constants of sort Voters
Arc [3:1*[446]] contains constants of sort Voters
Arc [3:1*[447]] contains constants of sort Voters
Arc [3:1*[448]] contains constants of sort Voters
Arc [3:1*[449]] contains constants of sort Voters
Arc [3:1*[450]] contains constants of sort Voters
Arc [3:1*[451]] contains constants of sort Voters
Arc [3:1*[452]] contains constants of sort Voters
Arc [3:1*[453]] contains constants of sort Voters
Arc [3:1*[454]] contains constants of sort Voters
Arc [3:1*[455]] contains constants of sort Voters
Arc [3:1*[456]] contains constants of sort Voters
Arc [3:1*[457]] contains constants of sort Voters
Arc [3:1*[458]] contains constants of sort Voters
Arc [3:1*[459]] contains constants of sort Voters
Arc [3:1*[460]] contains constants of sort Voters
Arc [3:1*[461]] contains constants of sort Voters
Arc [3:1*[462]] contains constants of sort Voters
Arc [3:1*[463]] contains constants of sort Voters
Arc [3:1*[464]] contains constants of sort Voters
Arc [3:1*[465]] contains constants of sort Voters
Arc [3:1*[466]] contains constants of sort Voters
Arc [3:1*[467]] contains constants of sort Voters
Arc [3:1*[468]] contains constants of sort Voters
Arc [3:1*[469]] contains constants of sort Voters
Arc [3:1*[470]] contains constants of sort Voters
Arc [3:1*[471]] contains constants of sort Voters
Arc [3:1*[472]] contains constants of sort Voters
Arc [3:1*[473]] contains constants of sort Voters
Arc [3:1*[474]] contains constants of sort Voters
Arc [3:1*[475]] contains constants of sort Voters
Arc [3:1*[476]] contains constants of sort Voters
Arc [3:1*[477]] contains constants of sort Voters
Arc [3:1*[478]] contains constants of sort Voters
Arc [3:1*[479]] contains constants of sort Voters
Arc [3:1*[480]] contains constants of sort Voters
Arc [3:1*[481]] contains constants of sort Voters
Arc [3:1*[482]] contains constants of sort Voters
Arc [3:1*[483]] contains constants of sort Voters
Arc [3:1*[484]] contains constants of sort Voters
Arc [3:1*[485]] contains constants of sort Voters
Arc [3:1*[486]] contains constants of sort Voters
Arc [3:1*[487]] contains constants of sort Voters
Arc [3:1*[488]] contains constants of sort Voters
Arc [3:1*[489]] contains constants of sort Voters
Arc [3:1*[490]] contains constants of sort Voters
Arc [3:1*[491]] contains constants of sort Voters
Arc [3:1*[492]] contains constants of sort Voters
Arc [3:1*[493]] contains constants of sort Voters
Arc [3:1*[494]] contains constants of sort Voters
Arc [3:1*[495]] contains constants of sort Voters
Arc [3:1*[496]] contains constants of sort Voters
Arc [3:1*[497]] contains constants of sort Voters
Arc [3:1*[498]] contains constants of sort Voters
Arc [3:1*[499]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]], [3:1*[20]], [3:1*[21]], [3:1*[22]], [3:1*[23]], [3:1*[24]], [3:1*[25]], [3:1*[26]], [3:1*[27]], [3:1*[28]], [3:1*[29]], [3:1*[30]], [3:1*[31]], [3:1*[32]], [3:1*[33]], [3:1*[34]], [3:1*[35]], [3:1*[36]], [3:1*[37]], [3:1*[38]], [3:1*[39]], [3:1*[40]], [3:1*[41]], [3:1*[42]], [3:1*[43]], [3:1*[44]], [3:1*[45]], [3:1*[46]], [3:1*[47]], [3:1*[48]], [3:1*[49]], [3:1*[50]], [3:1*[51]], [3:1*[52]], [3:1*[53]], [3:1*[54]], [3:1*[55]], [3:1*[56]], [3:1*[57]], [3:1*[58]], [3:1*[59]], [3:1*[60]], [3:1*[61]], [3:1*[62]], [3:1*[63]], [3:1*[64]], [3:1*[65]], [3:1*[66]], [3:1*[67]], [3:1*[68]], [3:1*[69]], [3:1*[70]], [3:1*[71]], [3:1*[72]], [3:1*[73]], [3:1*[74]], [3:1*[75]], [3:1*[76]], [3:1*[77]], [3:1*[78]], [3:1*[79]], [3:1*[80]], [3:1*[81]], [3:1*[82]], [3:1*[83]], [3:1*[84]], [3:1*[85]], [3:1*[86]], [3:1*[87]], [3:1*[88]], [3:1*[89]], [3:1*[90]], [3:1*[91]], [3:1*[92]], [3:1*[93]], [3:1*[94]], [3:1*[95]], [3:1*[96]], [3:1*[97]], [3:1*[98]], [3:1*[99]], [3:1*[100]], [3:1*[101]], [3:1*[102]], [3:1*[103]], [3:1*[104]], [3:1*[105]], [3:1*[106]], [3:1*[107]], [3:1*[108]], [3:1*[109]], [3:1*[110]], [3:1*[111]], [3:1*[112]], [3:1*[113]], [3:1*[114]], [3:1*[115]], [3:1*[116]], [3:1*[117]], [3:1*[118]], [3:1*[119]], [3:1*[120]], [3:1*[121]], [3:1*[122]], [3:1*[123]], [3:1*[124]], [3:1*[125]], [3:1*[126]], [3:1*[127]], [3:1*[128]], [3:1*[129]], [3:1*[130]], [3:1*[131]], [3:1*[132]], [3:1*[133]], [3:1*[134]], [3:1*[135]], [3:1*[136]], [3:1*[137]], [3:1*[138]], [3:1*[139]], [3:1*[140]], [3:1*[141]], [3:1*[142]], [3:1*[143]], [3:1*[144]], [3:1*[145]], [3:1*[146]], [3:1*[147]], [3:1*[148]], [3:1*[149]], [3:1*[150]], [3:1*[151]], [3:1*[152]], [3:1*[153]], [3:1*[154]], [3:1*[155]], [3:1*[156]], [3:1*[157]], [3:1*[158]], [3:1*[159]], [3:1*[160]], [3:1*[161]], [3:1*[162]], [3:1*[163]], [3:1*[164]], [3:1*[165]], [3:1*[166]], [3:1*[167]], [3:1*[168]], [3:1*[169]], [3:1*[170]], [3:1*[171]], [3:1*[172]], [3:1*[173]], [3:1*[174]], [3:1*[175]], [3:1*[176]], [3:1*[177]], [3:1*[178]], [3:1*[179]], [3:1*[180]], [3:1*[181]], [3:1*[182]], [3:1*[183]], [3:1*[184]], [3:1*[185]], [3:1*[186]], [3:1*[187]], [3:1*[188]], [3:1*[189]], [3:1*[190]], [3:1*[191]], [3:1*[192]], [3:1*[193]], [3:1*[194]], [3:1*[195]], [3:1*[196]], [3:1*[197]], [3:1*[198]], [3:1*[199]], [3:1*[200]], [3:1*[201]], [3:1*[202]], [3:1*[203]], [3:1*[204]], [3:1*[205]], [3:1*[206]], [3:1*[207]], [3:1*[208]], [3:1*[209]], [3:1*[210]], [3:1*[211]], [3:1*[212]], [3:1*[213]], [3:1*[214]], [3:1*[215]], [3:1*[216]], [3:1*[217]], [3:1*[218]], [3:1*[219]], [3:1*[220]], [3:1*[221]], [3:1*[222]], [3:1*[223]], [3:1*[224]], [3:1*[225]], [3:1*[226]], [3:1*[227]], [3:1*[228]], [3:1*[229]], [3:1*[230]], [3:1*[231]], [3:1*[232]], [3:1*[233]], [3:1*[234]], [3:1*[235]], [3:1*[236]], [3:1*[237]], [3:1*[238]], [3:1*[239]], [3:1*[240]], [3:1*[241]], [3:1*[242]], [3:1*[243]], [3:1*[244]], [3:1*[245]], [3:1*[246]], [3:1*[247]], [3:1*[248]], [3:1*[249]], [3:1*[250]], [3:1*[251]], [3:1*[252]], [3:1*[253]], [3:1*[254]], [3:1*[255]], [3:1*[256]], [3:1*[257]], [3:1*[258]], [3:1*[259]], [3:1*[260]], [3:1*[261]], [3:1*[262]], [3:1*[263]], [3:1*[264]], [3:1*[265]], [3:1*[266]], [3:1*[267]], [3:1*[268]], [3:1*[269]], [3:1*[270]], [3:1*[271]], [3:1*[272]], [3:1*[273]], [3:1*[274]], [3:1*[275]], [3:1*[276]], [3:1*[277]], [3:1*[278]], [3:1*[279]], [3:1*[280]], [3:1*[281]], [3:1*[282]], [3:1*[283]], [3:1*[284]], [3:1*[285]], [3:1*[286]], [3:1*[287]], [3:1*[288]], [3:1*[289]], [3:1*[290]], [3:1*[291]], [3:1*[292]], [3:1*[293]], [3:1*[294]], [3:1*[295]], [3:1*[296]], [3:1*[297]], [3:1*[298]], [3:1*[299]], [3:1*[300]], [3:1*[301]], [3:1*[302]], [3:1*[303]], [3:1*[304]], [3:1*[305]], [3:1*[306]], [3:1*[307]], [3:1*[308]], [3:1*[309]], [3:1*[310]], [3:1*[311]], [3:1*[312]], [3:1*[313]], [3:1*[314]], [3:1*[315]], [3:1*[316]], [3:1*[317]], [3:1*[318]], [3:1*[319]], [3:1*[320]], [3:1*[321]], [3:1*[322]], [3:1*[323]], [3:1*[324]], [3:1*[325]], [3:1*[326]], [3:1*[327]], [3:1*[328]], [3:1*[329]], [3:1*[330]], [3:1*[331]], [3:1*[332]], [3:1*[333]], [3:1*[334]], [3:1*[335]], [3:1*[336]], [3:1*[337]], [3:1*[338]], [3:1*[339]], [3:1*[340]], [3:1*[341]], [3:1*[342]], [3:1*[343]], [3:1*[344]], [3:1*[345]], [3:1*[346]], [3:1*[347]], [3:1*[348]], [3:1*[349]], [3:1*[350]], [3:1*[351]], [3:1*[352]], [3:1*[353]], [3:1*[354]], [3:1*[355]], [3:1*[356]], [3:1*[357]], [3:1*[358]], [3:1*[359]], [3:1*[360]], [3:1*[361]], [3:1*[362]], [3:1*[363]], [3:1*[364]], [3:1*[365]], [3:1*[366]], [3:1*[367]], [3:1*[368]], [3:1*[369]], [3:1*[370]], [3:1*[371]], [3:1*[372]], [3:1*[373]], [3:1*[374]], [3:1*[375]], [3:1*[376]], [3:1*[377]], [3:1*[378]], [3:1*[379]], [3:1*[380]], [3:1*[381]], [3:1*[382]], [3:1*[383]], [3:1*[384]], [3:1*[385]], [3:1*[386]], [3:1*[387]], [3:1*[388]], [3:1*[389]], [3:1*[390]], [3:1*[391]], [3:1*[392]], [3:1*[393]], [3:1*[394]], [3:1*[395]], [3:1*[396]], [3:1*[397]], [3:1*[398]], [3:1*[399]], [3:1*[400]], [3:1*[401]], [3:1*[402]], [3:1*[403]], [3:1*[404]], [3:1*[405]], [3:1*[406]], [3:1*[407]], [3:1*[408]], [3:1*[409]], [3:1*[410]], [3:1*[411]], [3:1*[412]], [3:1*[413]], [3:1*[414]], [3:1*[415]], [3:1*[416]], [3:1*[417]], [3:1*[418]], [3:1*[419]], [3:1*[420]], [3:1*[421]], [3:1*[422]], [3:1*[423]], [3:1*[424]], [3:1*[425]], [3:1*[426]], [3:1*[427]], [3:1*[428]], [3:1*[429]], [3:1*[430]], [3:1*[431]], [3:1*[432]], [3:1*[433]], [3:1*[434]], [3:1*[435]], [3:1*[436]], [3:1*[437]], [3:1*[438]], [3:1*[439]], [3:1*[440]], [3:1*[441]], [3:1*[442]], [3:1*[443]], [3:1*[444]], [3:1*[445]], [3:1*[446]], [3:1*[447]], [3:1*[448]], [3:1*[449]], [3:1*[450]], [3:1*[451]], [3:1*[452]], [3:1*[453]], [3:1*[454]], [3:1*[455]], [3:1*[456]], [3:1*[457]], [3:1*[458]], [3:1*[459]], [3:1*[460]], [3:1*[461]], [3:1*[462]], [3:1*[463]], [3:1*[464]], [3:1*[465]], [3:1*[466]], [3:1*[467]], [3:1*[468]], [3:1*[469]], [3:1*[470]], [3:1*[471]], [3:1*[472]], [3:1*[473]], [3:1*[474]], [3:1*[475]], [3:1*[476]], [3:1*[477]], [3:1*[478]], [3:1*[479]], [3:1*[480]], [3:1*[481]], [3:1*[482]], [3:1*[483]], [3:1*[484]], [3:1*[485]], [3:1*[486]], [3:1*[487]], [3:1*[488]], [3:1*[489]], [3:1*[490]], [3:1*[491]], [3:1*[492]], [3:1*[493]], [3:1*[494]], [3:1*[495]], [3:1*[496]], [3:1*[497]], [3:1*[498]], [3:1*[499]]] introduces in Voters(500) 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 500
[2022-05-20 21:47:03] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 43 ms.
[2022-05-20 21:47:03] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 5 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:47:03] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:03] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-20 21:47:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-20 21:47:03] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:47:03] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:47:03] [INFO ] Input system was already deterministic with 3 transitions.
Incomplete random walk after 10059 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=1676 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:47:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-20 21:47:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!(p0 U p1))&&!p1))||G(p2)))'
Support contains 3 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-20 21:47:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:04] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-20 21:47:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(GT s0 s1), p1:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0500-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-01 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(X(p0)))))'
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 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:04] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0500-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-02 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((G(p0)||p1)))&&F(!p0))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:05] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-20 21:47:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GT s2 s1), p1:(GT s2 s0)], nbAcceptance=2, 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 501 steps with 0 reset in 3 ms.
FORMULA Referendum-COL-0500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-03 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F(X((p0 U F(p1))))||p1)))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:05] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-20 21:47:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:05] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 524 reset in 132 ms.
Product exploration explored 100000 steps with 584 reset in 96 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 : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 503 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=503 )
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:06] [INFO ] Computed 0 place invariants in 1 ms
Proved EG (NOT p1)
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-COL-0500-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-04 finished in 1212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0)))&&G(X(p1))))'
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 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:47:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:06] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 1 s0), p0:(LEQ s1 s0)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-05 finished in 236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&p1))||F(X(p2))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:07] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(GT 3 s1), p0:(GT 2 s2), p1:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
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).
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 p2 p0 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X p2), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0500-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-06 finished in 766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((!(!p0 U G(!p0))||p1)))&&p2)))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:07] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:47:07] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-20 21:47:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:07] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-20 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s3 s1), p1:(AND (GT s1 s2) (GT s3 s0)), p2:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 507 steps with 3 reset in 1 ms.
FORMULA Referendum-COL-0500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-08 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(F(p0))||G(p1)))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:08] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:08] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:08] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 2 s1), p0:(GT s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 199 reset in 75 ms.
Product exploration explored 100000 steps with 199 reset in 106 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), false]
Finished random walk after 502 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), false]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:09] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 21:47:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 397 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), false]
Finished random walk after 502 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=502 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), false]
Product exploration explored 100000 steps with 436 reset in 85 ms.
Product exploration explored 100000 steps with 410 reset in 72 ms.
Built C files in :
/tmp/ltsmin5524345834505907693
[2022-05-20 21:47:10] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-20 21:47:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:47:10] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-20 21:47:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:47:10] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-20 21:47:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:47:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5524345834505907693
Running compilation step : cd /tmp/ltsmin5524345834505907693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin5524345834505907693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5524345834505907693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17305510742343469675.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA Referendum-COL-0500-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-COL-0500-LTLCardinality-09 finished in 3187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((X(!p0)||F(X(G(!p0))))))))'
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 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:11] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:11] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, true, (NOT p0), p0, p0, p0]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 199 reset in 167 ms.
Product exploration explored 100000 steps with 199 reset in 215 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 6 states, 8 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0500-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-10 finished in 894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:12] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:47:12] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:47:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:47:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-12 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(!(F(p0) U false))&&p1))&&X(p0))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:12] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:47:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:47:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:47:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), true]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s0 s3), p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-13 finished in 216 ms.
All properties solved by simple procedures.
Total runtime 10007 ms.

BK_STOP 1653083232871

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572200379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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