About the Execution of LTSMin+red for Referendum-COL-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 397.352 | 9828.00 | 16440.00 | 410.50 | TFFFTFFFFFTFFTTF | 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-167889202000443.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-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202000443
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 18:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 18:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 17:53 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 11K 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-0200-LTLCardinality-00
FORMULA_NAME Referendum-COL-0200-LTLCardinality-01
FORMULA_NAME Referendum-COL-0200-LTLCardinality-02
FORMULA_NAME Referendum-COL-0200-LTLCardinality-03
FORMULA_NAME Referendum-COL-0200-LTLCardinality-04
FORMULA_NAME Referendum-COL-0200-LTLCardinality-05
FORMULA_NAME Referendum-COL-0200-LTLCardinality-06
FORMULA_NAME Referendum-COL-0200-LTLCardinality-07
FORMULA_NAME Referendum-COL-0200-LTLCardinality-08
FORMULA_NAME Referendum-COL-0200-LTLCardinality-09
FORMULA_NAME Referendum-COL-0200-LTLCardinality-10
FORMULA_NAME Referendum-COL-0200-LTLCardinality-11
FORMULA_NAME Referendum-COL-0200-LTLCardinality-12
FORMULA_NAME Referendum-COL-0200-LTLCardinality-13
FORMULA_NAME Referendum-COL-0200-LTLCardinality-14
FORMULA_NAME Referendum-COL-0200-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679132438414
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:40:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 09:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:40:40] [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:40:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 09:40:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 430 ms
[2023-03-18 09:40:40] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 601 PT places and 401.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 09:40:40] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2023-03-18 09:40:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-COL-0200-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-10 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 13 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 10149 steps, including 49 resets, run finished after 62 ms. (steps per millisecond=163 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 09:40:41] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-18 09:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-18 09:40:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-18 09:40:41] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2023-03-18 09:40:41] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-COL-0200-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:40:41] [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
Arc [0:1*[100]] contains constants of sort Voters
Arc [0:1*[101]] contains constants of sort Voters
Arc [0:1*[102]] contains constants of sort Voters
Arc [0:1*[103]] contains constants of sort Voters
Arc [0:1*[104]] contains constants of sort Voters
Arc [0:1*[105]] contains constants of sort Voters
Arc [0:1*[106]] contains constants of sort Voters
Arc [0:1*[107]] contains constants of sort Voters
Arc [0:1*[108]] contains constants of sort Voters
Arc [0:1*[109]] contains constants of sort Voters
Arc [0:1*[110]] contains constants of sort Voters
Arc [0:1*[111]] contains constants of sort Voters
Arc [0:1*[112]] contains constants of sort Voters
Arc [0:1*[113]] contains constants of sort Voters
Arc [0:1*[114]] contains constants of sort Voters
Arc [0:1*[115]] contains constants of sort Voters
Arc [0:1*[116]] contains constants of sort Voters
Arc [0:1*[117]] contains constants of sort Voters
Arc [0:1*[118]] contains constants of sort Voters
Arc [0:1*[119]] contains constants of sort Voters
Arc [0:1*[120]] contains constants of sort Voters
Arc [0:1*[121]] contains constants of sort Voters
Arc [0:1*[122]] contains constants of sort Voters
Arc [0:1*[123]] contains constants of sort Voters
Arc [0:1*[124]] contains constants of sort Voters
Arc [0:1*[125]] contains constants of sort Voters
Arc [0:1*[126]] contains constants of sort Voters
Arc [0:1*[127]] contains constants of sort Voters
Arc [0:1*[128]] contains constants of sort Voters
Arc [0:1*[129]] contains constants of sort Voters
Arc [0:1*[130]] contains constants of sort Voters
Arc [0:1*[131]] contains constants of sort Voters
Arc [0:1*[132]] contains constants of sort Voters
Arc [0:1*[133]] contains constants of sort Voters
Arc [0:1*[134]] contains constants of sort Voters
Arc [0:1*[135]] contains constants of sort Voters
Arc [0:1*[136]] contains constants of sort Voters
Arc [0:1*[137]] contains constants of sort Voters
Arc [0:1*[138]] contains constants of sort Voters
Arc [0:1*[139]] contains constants of sort Voters
Arc [0:1*[140]] contains constants of sort Voters
Arc [0:1*[141]] contains constants of sort Voters
Arc [0:1*[142]] contains constants of sort Voters
Arc [0:1*[143]] contains constants of sort Voters
Arc [0:1*[144]] contains constants of sort Voters
Arc [0:1*[145]] contains constants of sort Voters
Arc [0:1*[146]] contains constants of sort Voters
Arc [0:1*[147]] contains constants of sort Voters
Arc [0:1*[148]] contains constants of sort Voters
Arc [0:1*[149]] contains constants of sort Voters
Arc [0:1*[150]] contains constants of sort Voters
Arc [0:1*[151]] contains constants of sort Voters
Arc [0:1*[152]] contains constants of sort Voters
Arc [0:1*[153]] contains constants of sort Voters
Arc [0:1*[154]] contains constants of sort Voters
Arc [0:1*[155]] contains constants of sort Voters
Arc [0:1*[156]] contains constants of sort Voters
Arc [0:1*[157]] contains constants of sort Voters
Arc [0:1*[158]] contains constants of sort Voters
Arc [0:1*[159]] contains constants of sort Voters
Arc [0:1*[160]] contains constants of sort Voters
Arc [0:1*[161]] contains constants of sort Voters
Arc [0:1*[162]] contains constants of sort Voters
Arc [0:1*[163]] contains constants of sort Voters
Arc [0:1*[164]] contains constants of sort Voters
Arc [0:1*[165]] contains constants of sort Voters
Arc [0:1*[166]] contains constants of sort Voters
Arc [0:1*[167]] contains constants of sort Voters
Arc [0:1*[168]] contains constants of sort Voters
Arc [0:1*[169]] contains constants of sort Voters
Arc [0:1*[170]] contains constants of sort Voters
Arc [0:1*[171]] contains constants of sort Voters
Arc [0:1*[172]] contains constants of sort Voters
Arc [0:1*[173]] contains constants of sort Voters
Arc [0:1*[174]] contains constants of sort Voters
Arc [0:1*[175]] contains constants of sort Voters
Arc [0:1*[176]] contains constants of sort Voters
Arc [0:1*[177]] contains constants of sort Voters
Arc [0:1*[178]] contains constants of sort Voters
Arc [0:1*[179]] contains constants of sort Voters
Arc [0:1*[180]] contains constants of sort Voters
Arc [0:1*[181]] contains constants of sort Voters
Arc [0:1*[182]] contains constants of sort Voters
Arc [0:1*[183]] contains constants of sort Voters
Arc [0:1*[184]] contains constants of sort Voters
Arc [0:1*[185]] contains constants of sort Voters
Arc [0:1*[186]] contains constants of sort Voters
Arc [0:1*[187]] contains constants of sort Voters
Arc [0:1*[188]] contains constants of sort Voters
Arc [0:1*[189]] contains constants of sort Voters
Arc [0:1*[190]] contains constants of sort Voters
Arc [0:1*[191]] contains constants of sort Voters
Arc [0:1*[192]] contains constants of sort Voters
Arc [0:1*[193]] contains constants of sort Voters
Arc [0:1*[194]] contains constants of sort Voters
Arc [0:1*[195]] contains constants of sort Voters
Arc [0:1*[196]] contains constants of sort Voters
Arc [0:1*[197]] contains constants of sort Voters
Arc [0:1*[198]] contains constants of sort Voters
Arc [0:1*[199]] 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]], [0:1*[100]], [0:1*[101]], [0:1*[102]], [0:1*[103]], [0:1*[104]], [0:1*[105]], [0:1*[106]], [0:1*[107]], [0:1*[108]], [0:1*[109]], [0:1*[110]], [0:1*[111]], [0:1*[112]], [0:1*[113]], [0:1*[114]], [0:1*[115]], [0:1*[116]], [0:1*[117]], [0:1*[118]], [0:1*[119]], [0:1*[120]], [0:1*[121]], [0:1*[122]], [0:1*[123]], [0:1*[124]], [0:1*[125]], [0:1*[126]], [0:1*[127]], [0:1*[128]], [0:1*[129]], [0:1*[130]], [0:1*[131]], [0:1*[132]], [0:1*[133]], [0:1*[134]], [0:1*[135]], [0:1*[136]], [0:1*[137]], [0:1*[138]], [0:1*[139]], [0:1*[140]], [0:1*[141]], [0:1*[142]], [0:1*[143]], [0:1*[144]], [0:1*[145]], [0:1*[146]], [0:1*[147]], [0:1*[148]], [0:1*[149]], [0:1*[150]], [0:1*[151]], [0:1*[152]], [0:1*[153]], [0:1*[154]], [0:1*[155]], [0:1*[156]], [0:1*[157]], [0:1*[158]], [0:1*[159]], [0:1*[160]], [0:1*[161]], [0:1*[162]], [0:1*[163]], [0:1*[164]], [0:1*[165]], [0:1*[166]], [0:1*[167]], [0:1*[168]], [0:1*[169]], [0:1*[170]], [0:1*[171]], [0:1*[172]], [0:1*[173]], [0:1*[174]], [0:1*[175]], [0:1*[176]], [0:1*[177]], [0:1*[178]], [0:1*[179]], [0:1*[180]], [0:1*[181]], [0:1*[182]], [0:1*[183]], [0:1*[184]], [0:1*[185]], [0:1*[186]], [0:1*[187]], [0:1*[188]], [0:1*[189]], [0:1*[190]], [0:1*[191]], [0:1*[192]], [0:1*[193]], [0:1*[194]], [0:1*[195]], [0:1*[196]], [0:1*[197]], [0:1*[198]], [0:1*[199]]] introduces in Voters(200) 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 200
[2023-03-18 09:40:41] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 13 ms.
[2023-03-18 09:40:41] [INFO ] Unfolded 10 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.
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40:41] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-18 09:40:41] [INFO ] Flatten gal took : 2 ms
[2023-03-18 09:40:41] [INFO ] Flatten gal took : 1 ms
[2023-03-18 09:40:41] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 608 steps, including 2 resets, run visited all 14 properties in 2 ms. (steps per millisecond=304 )
FORMULA Referendum-COL-0200-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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 : '/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 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 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 09:40:41] [INFO ] Invariant cache hit.
[2023-03-18 09:40: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 69 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 133 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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 103 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-0200-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-00 finished in 905 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((X(p0) U (p1||G(p2))))))'
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 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 09:40:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 09:40:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 09:40:42] [INFO ] Invariant cache hit.
[2023-03-18 09:40:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-18 09:40:42] [INFO ] Invariant cache hit.
[2023-03-18 09:40:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s0), p2:(LEQ 1 s0), p0:(LEQ s1 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 205 steps with 2 reset in 3 ms.
FORMULA Referendum-COL-0200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-01 finished in 303 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)))'
Support contains 2 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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:40:42] [INFO ] Invariant cache hit.
[2023-03-18 09:40:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 09:40:42] [INFO ] Invariant cache hit.
[2023-03-18 09:40:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-18 09:40:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:40:42] [INFO ] Invariant cache hit.
[2023-03-18 09:40:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-02 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:(LEQ s1 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]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-02 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' '!(F((X(G((p0||X(p1))))&&G(!p1))))'
Support contains 2 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 7 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 09:40:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 09:40:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 09:40:43] [INFO ] Invariant cache hit.
[2023-03-18 09:40:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 09:40:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:40:43] [INFO ] Invariant cache hit.
[2023-03-18 09:40:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), p1, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p1), acceptance={1} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 5}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 1}, { cond=(NOT p1), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(LEQ s2 s1), p0:(LEQ s1 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-03 finished in 330 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((G(p0) U p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-18 09:40:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 09:40:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 09:40:43] [INFO ] Invariant cache hit.
[2023-03-18 09:40:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 09:40:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:40:43] [INFO ] Invariant cache hit.
[2023-03-18 09:40:43] [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 79 ms. Remains : 3/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s2), p0:(LEQ s2 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 663 reset in 163 ms.
Product exploration explored 100000 steps with 690 reset in 103 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 8 factoid took 539 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10099 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 09:40:44] [INFO ] Invariant cache hit.
[2023-03-18 09:40:44] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 09:40:44] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 611 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-18 09:40:45] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 10 factoid took 348 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0200-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-07 finished in 2541 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&&X(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.
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
[2023-03-18 09:40:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 09:40:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 09:40:45] [INFO ] Invariant cache hit.
[2023-03-18 09:40:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 09:40:45] [INFO ] Invariant cache hit.
[2023-03-18 09:40:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(GT 1 s3), p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 204 steps with 1 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-08 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((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.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [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.
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(GT s0 s2), p0:(LEQ s2 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 138 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-12 finished in 296 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 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 2 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:40:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 09:40:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Dead Transitions using invariants and state equation in 14 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 54 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s0)], 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 70 ms.
Product exploration explored 100000 steps with 50000 reset in 79 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 p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 180 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-0200-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-13 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((p1&&X(p0))))))'
Support contains 3 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 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 09:40:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 09:40:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-18 09:40:46] [INFO ] Invariant cache hit.
[2023-03-18 09:40:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s1), p1:(LEQ s3 s2)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0200-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-15 finished in 178 ms.
All properties solved by simple procedures.
Total runtime 6964 ms.
ITS solved all properties within timeout
BK_STOP 1679132448242
--------------------
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 LTLCardinality -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-0200"
export BK_EXAMINATION="LTLCardinality"
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-0200, 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 r329-tall-167889202000443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0200.tgz
mv Referendum-COL-0200 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 '
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 ;