fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415800460
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
301.155 9523.00 18540.00 346.70 FFFFFTFTFTFTFFFF 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/mcc2021-input.r178-tajo-162089415800460.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.7K May 5 16:51 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-0015-00
FORMULA_NAME Referendum-COL-0015-01
FORMULA_NAME Referendum-COL-0015-02
FORMULA_NAME Referendum-COL-0015-03
FORMULA_NAME Referendum-COL-0015-04
FORMULA_NAME Referendum-COL-0015-05
FORMULA_NAME Referendum-COL-0015-06
FORMULA_NAME Referendum-COL-0015-07
FORMULA_NAME Referendum-COL-0015-08
FORMULA_NAME Referendum-COL-0015-09
FORMULA_NAME Referendum-COL-0015-10
FORMULA_NAME Referendum-COL-0015-11
FORMULA_NAME Referendum-COL-0015-12
FORMULA_NAME Referendum-COL-0015-13
FORMULA_NAME Referendum-COL-0015-14
FORMULA_NAME Referendum-COL-0015-15

=== Now, execution of the tool begins

BK_START 1621258829941

Running Version 0
[2021-05-17 13:40:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:40:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:40:32] [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.
[2021-05-17 13:40:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:40:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2021-05-17 13:40:32] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:40:32] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:40:32] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_13838862872164086831.dot
[2021-05-17 13:40:33] [INFO ] Initial state test concluded for 4 properties.
FORMULA Referendum-COL-0015-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100007 steps, including 5555 resets, run finished after 99 ms. (steps per millisecond=1010 ) properties (out of 17) seen :15
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:40:33] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-17 13:40:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned unsat
[2021-05-17 13:40:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA Referendum-COL-0015-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:40:33] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 13:40:33] [INFO ] Flatten gal took : 54 ms
[2021-05-17 13:40:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Referendum-COL-0015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:40:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:40:33] [INFO ] Unfolded HLPN to a Petri net with 46 places and 31 transitions in 1 ms.
[2021-05-17 13:40:33] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9975596948226564180.dot
[2021-05-17 13:40:33] [INFO ] Initial state test concluded for 1 properties.
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 37 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:33] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:40:33] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:33] [INFO ] Computed 15 place invariants in 11 ms
[2021-05-17 13:40:34] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:34] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:40:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
[2021-05-17 13:40:34] [INFO ] Flatten gal took : 5 ms
[2021-05-17 13:40:34] [INFO ] Flatten gal took : 15 ms
[2021-05-17 13:40:34] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 17 steps, including 1 resets, run visited all 13 properties in 1 ms. (steps per millisecond=17 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 16 transition count 16
Applied a total of 16 rules in 6 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:34] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:34] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-17 13:40:34] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-17 13:40:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:34] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0015-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 24 ms.
FORMULA Referendum-COL-0015-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-00 finished in 836 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 31
Applied a total of 2 rules in 9 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2021-05-17 13:40:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0015-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)), p1:(LEQ s30 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20223 steps with 3395 reset in 202 ms.
FORMULA Referendum-COL-0015-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-01 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Applied a total of 45 rules in 1 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:35] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0015-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0015-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-02 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 4 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : Referendum-COL-0015-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0015-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-03 finished in 523 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (p1&&X(!p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 45 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:36] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:40:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:36] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-17 13:40:36] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 13:40:36] [INFO ] Computed 15 place invariants in 14 ms
[2021-05-17 13:40:37] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, true, (AND p1 p2), (NOT p2), true, p1, (NOT p2)]
Running random walk in product with property : Referendum-COL-0015-04 automaton TGBA [mat=[[{ cond=(OR (AND p1 p2) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14)), p2:(LEQ 1 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0015-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-04 finished in 882 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 16 transition count 16
Applied a total of 16 rules in 2 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-17 13:40:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0015-10 automaton TGBA [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:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14) s15)], 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 16 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0015-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-10 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1)&&(p1 U p0)))))], workingDir=/home/mcc/execution]
Support contains 31 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 1 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:37] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0015-12 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 1}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14)), p1:(LEQ 1 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 14 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0015-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-12 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 16 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 31
Applied a total of 2 rules in 3 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:37] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-17 13:40:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0015-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25224 reset in 270 ms.
Stuttering criterion allowed to conclude after 91280 steps with 23030 reset in 264 ms.
FORMULA Referendum-COL-0015-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-13 finished in 679 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 31 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:38] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:40:38] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-17 13:40:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 13:40:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:40:38] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (NOT p2) p0), p0, (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-COL-0015-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s30), p1:(GT s30 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)), p2:(OR (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14) s30) (GT s30 (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 1 ms.
FORMULA Referendum-COL-0015-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-15 finished in 508 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621258839464

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0015, 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 r178-tajo-162089415800460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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