fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281572200361
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Referendum-COL-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
229.348 11012.00 18736.00 53.70 TFTFFTFFTTFTTTTT normal

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-165281572200361.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-0100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 14:38 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 3.6K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K 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 6.7K 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-0100-CTLCardinality-00
FORMULA_NAME Referendum-COL-0100-CTLCardinality-01
FORMULA_NAME Referendum-COL-0100-CTLCardinality-02
FORMULA_NAME Referendum-COL-0100-CTLCardinality-03
FORMULA_NAME Referendum-COL-0100-CTLCardinality-04
FORMULA_NAME Referendum-COL-0100-CTLCardinality-05
FORMULA_NAME Referendum-COL-0100-CTLCardinality-06
FORMULA_NAME Referendum-COL-0100-CTLCardinality-07
FORMULA_NAME Referendum-COL-0100-CTLCardinality-08
FORMULA_NAME Referendum-COL-0100-CTLCardinality-09
FORMULA_NAME Referendum-COL-0100-CTLCardinality-10
FORMULA_NAME Referendum-COL-0100-CTLCardinality-11
FORMULA_NAME Referendum-COL-0100-CTLCardinality-12
FORMULA_NAME Referendum-COL-0100-CTLCardinality-13
FORMULA_NAME Referendum-COL-0100-CTLCardinality-14
FORMULA_NAME Referendum-COL-0100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083083769

Running Version 202205111006
[2022-05-20 21:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:44:45] [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:44:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:44:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 472 ms
[2022-05-20 21:44:45] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 301 PT places and 201.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
FORMULA Referendum-COL-0100-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:44:45] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2022-05-20 21:44:45] [INFO ] Skeletonized 15 HLPN properties in 1 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).
AF dead knowledge conclusive for 2 formulas.
FORMULA Referendum-COL-0100-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 10093 steps, including 97 resets, run finished after 73 ms. (steps per millisecond=138 ) properties (out of 58) seen :41
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:46] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-20 21:44:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 21:44:46] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
FORMULA Referendum-COL-0100-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:44:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-20 21:44:46] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-COL-0100-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:44:46] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]]] introduces in Voters(100) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 100
[2022-05-20 21:44:46] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 15 ms.
[2022-05-20 21:44:46] [INFO ] Unfolded 10 HLPN properties in 6 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 4 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:44:46] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-20 21:44:46] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:46] [INFO ] Dead Transitions using invariants and state equation in 24 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:44:46] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:46] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:46] [INFO ] Input system was already deterministic with 3 transitions.
Incomplete random walk after 10093 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=420 ) properties (out of 45) seen :35
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-20 21:44:47] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:47] [INFO ] Input system was already deterministic with 3 transitions.
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).
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:44:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:47] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:47] [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.
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:47] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:47] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4614181517801043627.gal : 1 ms
[2022-05-20 21:44:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7970496230380429450.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4614181517801043627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7970496230380429450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.038908,5708,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: EG(!(A(EX(((voted_yes_0>ready_0) + AX((voted_yes_0<=20)))) U !(E(((ready_0>=15)||(voted_no_0>=23)) U AF((voting_0>=49)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(!(E(((ready_0>=15)||(voted_no_0>=23)) U !(EG(!((voting_0>=49))))))) U (!(EX(((voted_yes_0>re...358
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 1/0/2
Hit Full ! (commute/partial/dont) 0/0/2
dead was empty
(forward)formula 0,0,0.741399,18232,1,0,114,39031,32,7,691,44067,115
FORMULA Referendum-COL-0100-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in 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:44:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:48] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:48] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-20 21:44:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:48] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:44:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
[2022-05-20 21:44:48] [INFO ] Flatten gal took : 3 ms
[2022-05-20 21:44:48] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:48] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:48] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:48] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5123972826990009001.gal : 1 ms
[2022-05-20 21:44:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality7948259651520932615.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5123972826990009001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7948259651520932615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.050078,5888,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: AX(AF(E(EF((voted_yes_0<=19)) U AX((voted_no_0>=14)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(E(TRUE U (voted_yes_0<=19)) U !(EX(!((voted_no_0>=14)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
dead was empty
(forward)formula 0,1,0.589077,14344,1,0,158,29110,21,36,467,35445,144
FORMULA Referendum-COL-0100-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL 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 10 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:44:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:49] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:49] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:44:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-20 21:44:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:49] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
FORMULA Referendum-COL-0100-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL 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:44:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:49] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 21:44:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:49] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:49] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13260095378664648911.gal : 0 ms
[2022-05-20 21:44:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4186935941794834526.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13260095378664648911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4186935941794834526.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.033301,5788,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: AF((((voted_no_0<9)&&(voted_no_0>ready_0)) * ((voting_0<12) + AG(((voted_yes_0>36)&&(voted_no_0>voting_0))))))
=> equivalent forward existential formula: [FwdG(Init,!((((voted_no_0<9)&&(voted_no_0>ready_0)) * ((voting_0<12) + !(E(TRUE U !(((voted_yes_0>36)&&(voted_n...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.821751,21688,1,0,328,42930,22,212,878,72261,315
FORMULA Referendum-COL-0100-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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:44:50] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:44:50] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:50] [INFO ] Dead Transitions using invariants and state equation in 27 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.
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality669157867516841708.gal : 0 ms
[2022-05-20 21:44:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality4647158875265709596.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality669157867516841708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4647158875265709596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.034511,5056,2,105,5,1305,6,0,13,1001,0


Converting to forward existential form...Done !
original formula: AX(((EG(AX((voted_no_0<=36))) * A((voted_no_0<=32) U (voted_no_0<=38))) * ((voting_0>22) * EG(((voting_0>ready_0)||(ready_0>voted_no_0)))...158
=> equivalent forward existential formula: (([(EY(Init) * !(EG(!(EX(!((voted_no_0<=36)))))))] = FALSE * ([(FwdU(EY(Init),!((voted_no_0<=38))) * (!((voted_n...366
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.092505,6228,1,0,114,6684,25,7,765,6990,113
FORMULA Referendum-COL-0100-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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:44:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:50] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:50] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality5727643011666938047.gal : 0 ms
[2022-05-20 21:44:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16835261508957445141.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5727643011666938047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16835261508957445141.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.057483,5640,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: A(AX(((voted_no_0<=22) + ((AF((voted_no_0>=23)) * (voted_yes_0<=21)) * ((ready_0<=1)||(ready_0<=39))))) U A(EX(((AF((voted_yes_0<=ready_0...287
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG(E(TRUE U (voting_0<=voted_yes_0))) + E(TRUE U (voted_yes_0>=47)))) U (!(EX(((!(EG(!(...1255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.1186,19812,1,0,110,38126,25,5,672,42417,113
FORMULA Referendum-COL-0100-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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:44:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:51] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:51] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
[2022-05-20 21:44:51] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:44:51] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:44:51] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:51] [INFO ] Flatten gal took : 10 ms
[2022-05-20 21:44:51] [INFO ] Flatten gal took : 4 ms
[2022-05-20 21:44:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8143859341586983022.gal : 0 ms
[2022-05-20 21:44:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality18255092520762826570.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8143859341586983022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18255092520762826570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.049456,5764,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: AG(((AX(FALSE) * AF((voted_no_0<=voting_0))) + (AF((voted_no_0<=32)) * (((voted_yes_0>=2) + AF(((voting_0<=34) + A((voting_0<=voted_yes_0...256
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((!(EX(!(FALSE))) * !(EG(!((voted_no_0<=voting_0))))))),!((voted_no_0<=32)))] = FALSE...731
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/3
dead was empty
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 2/0/1
(forward)formula 0,0,0.592323,17032,1,0,124,36315,48,18,1275,42590,120
FORMULA Referendum-COL-0100-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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:44:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:52] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:52] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:52] [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.
[2022-05-20 21:44:52] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:52] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:52] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:52] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:52] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality16033301475352355693.gal : 0 ms
[2022-05-20 21:44:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14699086340856556353.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16033301475352355693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14699086340856556353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.030977,5848,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: AF((AX(EG(AX((voting_0<=41)))) + !(E(AX((voted_no_0<=9)) U (((voting_0>=42)&&(voted_yes_0<=10))&&(voted_no_0<=48))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG(!(EX(!((voting_0<=41)))))))) + !(E(!(EX(!((voted_no_0<=9)))) U (((voting_0>=42)&&(voted_...199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
dead was empty
(forward)formula 0,1,0.646538,18372,1,0,163,38659,22,100,469,59259,203
FORMULA Referendum-COL-0100-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
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:44:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:53] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:53] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:44:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
[2022-05-20 21:44:53] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:53] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:53] [INFO ] Input system was already deterministic with 3 transitions.
[2022-05-20 21:44:53] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:53] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9641061924148590568.gal : 0 ms
[2022-05-20 21:44:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality6634794796612698171.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9641061924148590568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6634794796612698171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5152,0.069295,5820,2,206,5,6855,6,0,15,6252,0


Converting to forward existential form...Done !
original formula: (EF(AG((((ready_0>=9)||(voted_yes_0<=voted_no_0))&&(voting_0<26)))) + AX((((AF((voted_no_0>50)) + AX(FALSE)) * EX(AF((voting_0>voted_yes_...254
=> equivalent forward existential formula: (([((EY((Init * !(E(TRUE U !(E(TRUE U !((((ready_0>=9)||(voted_yes_0<=voted_no_0))&&(voting_0<26))))))))) * !(((...1043
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 2/0/1
dead was empty
(forward)formula 0,1,1.23861,21836,1,0,130,42163,46,16,1107,47593,123
FORMULA Referendum-COL-0100-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL 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 4 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:44:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:54] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-20 21:44:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
[2022-05-20 21:44:54] [INFO ] Flatten gal took : 0 ms
[2022-05-20 21:44:54] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:54] [INFO ] Input system was already deterministic with 2 transitions.
Finished random walk after 305 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=152 )
FORMULA Referendum-COL-0100-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2022-05-20 21:44:54] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:54] [INFO ] Flatten gal took : 1 ms
Total runtime 9697 ms.

BK_STOP 1653083094781

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-0100"
export BK_EXAMINATION="CTLCardinality"
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-0100, examination is CTLCardinality"
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-165281572200361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0100.tgz
mv Referendum-COL-0100 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;