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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 12K Apr 29 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:47 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 9.4K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 12K 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-PT-0010-LTLFireability-00
FORMULA_NAME Referendum-PT-0010-LTLFireability-01
FORMULA_NAME Referendum-PT-0010-LTLFireability-02
FORMULA_NAME Referendum-PT-0010-LTLFireability-03
FORMULA_NAME Referendum-PT-0010-LTLFireability-04
FORMULA_NAME Referendum-PT-0010-LTLFireability-05
FORMULA_NAME Referendum-PT-0010-LTLFireability-06
FORMULA_NAME Referendum-PT-0010-LTLFireability-07
FORMULA_NAME Referendum-PT-0010-LTLFireability-08
FORMULA_NAME Referendum-PT-0010-LTLFireability-09
FORMULA_NAME Referendum-PT-0010-LTLFireability-10
FORMULA_NAME Referendum-PT-0010-LTLFireability-11
FORMULA_NAME Referendum-PT-0010-LTLFireability-12
FORMULA_NAME Referendum-PT-0010-LTLFireability-13
FORMULA_NAME Referendum-PT-0010-LTLFireability-14
FORMULA_NAME Referendum-PT-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083421814

Running Version 202205111006
[2022-05-20 21:50:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:50:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:50:23] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-20 21:50:23] [INFO ] Transformed 31 places.
[2022-05-20 21:50:23] [INFO ] Transformed 21 transitions.
[2022-05-20 21:50:23] [INFO ] Found NUPN structural information;
[2022-05-20 21:50:23] [INFO ] Parsed PT model containing 31 places and 21 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-PT-0010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 18 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:23] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:50:23] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:23] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:23] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/31 places, 11/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/31 places, 11/21 transitions.
Support contains 11 out of 11 places after structural reductions.
[2022-05-20 21:50:23] [INFO ] Flatten gal took : 20 ms
[2022-05-20 21:50:23] [INFO ] Flatten gal took : 5 ms
[2022-05-20 21:50:23] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 10 properties in 35 ms. (steps per millisecond=0 )
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(F(p0) U ((!G(F(p2))&&p0)||p1)))))'
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:24] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 21:50:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:24] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:50:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=5 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s0 1), p1:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1)), p2:(OR (EQ s1 1) (EQ s2 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10566 reset in 263 ms.
Product exploration explored 100000 steps with 10502 reset in 161 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1806 ms. Reduced automaton from 7 states, 27 edges and 3 AP to 7 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 441 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 833 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:28] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:50:28] [INFO ] After 75ms 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.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 27 factoid took 1867 ms. Reduced automaton from 7 states, 27 edges and 3 AP to 5 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 232 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), false]
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:50:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 21:50:30] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 21:50:30] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 21:50:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 16 factoid took 500 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0010-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-00 finished in 7113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:31] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s0 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-01 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:31] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:50:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 21:50:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 1) (NEQ s2 1) (NEQ s3 1) (NEQ s4 1) (NEQ s5 1) (NEQ s6 1) (NEQ s7 1) (NEQ s8 1) (NEQ s9 1) (NEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8333 reset in 225 ms.
Product exploration explored 100000 steps with 8333 reset in 228 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0010-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-03 finished in 760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 10 edges and 11 vertex of which 1 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-20 21:50:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/11 places, 1/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-04 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:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-04 finished in 197 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((p0 U X(G((X(F(p0)) U X(p1)))))))))'
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 535 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 5}, { cond=(NOT p0), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1)), p1:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8333 reset in 145 ms.
Product exploration explored 100000 steps with 8333 reset in 120 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0) (NOT p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 11 states, 21 edges and 2 AP to 10 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 514 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 833 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 596 ms. Reduced automaton from 10 states, 19 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 298 ms :[false, false, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 264 ms :[false, false, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:35] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:35] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:35] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:50:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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) (NOT p0)), (X p1), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:50:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 21:50:37] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 21:50:37] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8333 reset in 97 ms.
Product exploration explored 100000 steps with 8333 reset in 142 ms.
Applying partial POR strategy [false, false, true, true, false, false]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-20 21:50:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 8333 reset in 122 ms.
Product exploration explored 100000 steps with 8333 reset in 142 ms.
Built C files in :
/tmp/ltsmin12112869193651075908
[2022-05-20 21:50:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12112869193651075908
Running compilation step : cd /tmp/ltsmin12112869193651075908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin12112869193651075908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12112869193651075908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11901540037184381909.hoa' '--buchi-type=spotba'
LTSmin run took 246 ms.
FORMULA Referendum-PT-0010-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0010-LTLFireability-05 finished in 6732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X(p0)&&p0))||X(X(G(p0)))) U p0))'
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-06 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 2 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-08 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(p1)&&(G(X(p1))||p2))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s2 1), p1:(EQ s3 1), p0:(EQ s0 1)], nbAcceptance=1, 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 11 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-09 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(((p0 U X(G(p0))) U G((X(p1)||p0)))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s3 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-11 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||G(p1)||X(p2)))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s2 1), p2:(EQ s0 0), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 13 factoid took 310 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-12 finished in 835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U (!X(p1)&&p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:41] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:50:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p0), (OR (NOT p2) p1), p1, (AND (NOT p0) p1), p1]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=6 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s3 1), p0:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 p2) (NOT p0) p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p1) p0)), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) p1)
Knowledge based reduction with 23 factoid took 1632 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0010-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-13 finished in 2366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:43] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-14 finished in 324 ms.
All properties solved by simple procedures.
Total runtime 20574 ms.

BK_STOP 1653083444130

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-PT-0010"
export BK_EXAMINATION="LTLFireability"
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-PT-0010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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