About the Execution of ITS-Tools for Referendum-PT-0015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 391.695 | 10780.00 | 21984.00 | 72.90 | TFTFTTFTTTFTFTTT | 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-162089415900525.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-PT-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900525
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 267K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K 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 8.2K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K 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-PT-0015-00
FORMULA_NAME Referendum-PT-0015-01
FORMULA_NAME Referendum-PT-0015-02
FORMULA_NAME Referendum-PT-0015-03
FORMULA_NAME Referendum-PT-0015-04
FORMULA_NAME Referendum-PT-0015-05
FORMULA_NAME Referendum-PT-0015-06
FORMULA_NAME Referendum-PT-0015-07
FORMULA_NAME Referendum-PT-0015-08
FORMULA_NAME Referendum-PT-0015-09
FORMULA_NAME Referendum-PT-0015-10
FORMULA_NAME Referendum-PT-0015-11
FORMULA_NAME Referendum-PT-0015-12
FORMULA_NAME Referendum-PT-0015-13
FORMULA_NAME Referendum-PT-0015-14
FORMULA_NAME Referendum-PT-0015-15
=== Now, execution of the tool begins
BK_START 1621260547701
Running Version 0
[2021-05-17 14:09:09] [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]
[2021-05-17 14:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:09:09] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-17 14:09:09] [INFO ] Transformed 46 places.
[2021-05-17 14:09:09] [INFO ] Transformed 31 transitions.
[2021-05-17 14:09:09] [INFO ] Found NUPN structural information;
[2021-05-17 14:09:09] [INFO ] Parsed PT model containing 46 places and 31 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:09:09] [INFO ] Initial state test concluded for 3 properties.
FORMULA Referendum-PT-0015-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 9 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 14:09:09] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 14:09:09] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:09] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:09] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 14:09:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
[2021-05-17 14:09:09] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 14:09:09] [INFO ] Flatten gal took : 18 ms
FORMULA Referendum-PT-0015-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:09:09] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:09:09] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 218 ms. (steps per millisecond=458 ) properties (out of 17) seen :15
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:09:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 14:09:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:09:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Referendum-PT-0015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 14:09:10] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:10] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-17 14:09:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-00 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:(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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 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]]
Product exploration explored 100000 steps with 5882 reset in 189 ms.
Product exploration explored 100000 steps with 5882 reset in 126 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-PT-0015-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0015-00 finished in 642 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(((p1 U (p2||G(p1)))&&p0)))))], workingDir=/home/mcc/execution]
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:10] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-17 14:09:10] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0015-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s0 0) (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 s11 0) (EQ s12 0) (EQ s13 0) (EQ s14 0) (EQ s15 0)), p2:(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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 1) (NEQ s0 1)), p1:(NEQ s0 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-01 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(!p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0015-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=1, 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) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s15 1)), p1:(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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-03 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 14:09:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:11] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-04 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:(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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 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]]
Product exploration explored 100000 steps with 5882 reset in 140 ms.
Product exploration explored 100000 steps with 5882 reset in 139 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-PT-0015-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0015-04 finished in 484 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2 transition count 2
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 3 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:11] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/16 places, 2/16 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-PT-0015-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0015-05 finished in 262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0) U !p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:12] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:12] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:12] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:12] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:12] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 95 ms :[p1, p1, true, p0]
Running random walk in product with property : Referendum-PT-0015-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 1)), 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) (NEQ s11 1) (NEQ s12 1) (NEQ s13 1) (NEQ s14 1) (NEQ s15 1) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 : [(F (G p1)), (F (G p0)), p1, (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[p1, p1, true, p0]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 117 ms :[p1, p1, true, p0]
Support contains 16 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-17 14:09:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:13] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
[2021-05-17 14:09:13] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:13] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:13] [INFO ] Time to serialize gal into /tmp/LTL17933385623237083599.gal : 10 ms
[2021-05-17 14:09:13] [INFO ] Time to serialize properties into /tmp/LTL9307043989998861888.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17933385623237083599.gal, -t, CGAL, -LTL, /tmp/LTL9307043989998861888.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17933385623237083599.gal -t CGAL -LTL /tmp/LTL9307043989998861888.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((((((((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))||(voting_11==1))||(voting_12==1))||(voting_13==1))||(voting_14==1))||(voting_15==1))||(ready==1))"))U("(((((((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))||(voting_11==1))||(voting_12==1))||(voting_13==1))||(voting_14==1))||(voting_15==1))"))))
Formula 0 simplified : !X(G"((((((((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))||(voting_11==1))||(voting_12==1))||(voting_13==1))||(voting_14==1))||(voting_15==1))||(ready==1))" U "(((((((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))||(voting_11==1))||(voting_12==1))||(voting_13==1))||(voting_14==1))||(voting_15==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/15/16
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.035423,16880,1,0,57,823,57,21,455,573,44
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-PT-0015-07 finished in 1639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F((p0||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4 transition count 4
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4 transition count 4
Applied a total of 24 rules in 1 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:13] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:13] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:13] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/16 places, 4/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0015-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} 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=[p1:(NEQ s2 1), p0:(AND (NEQ s3 1) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18400 reset in 123 ms.
Product exploration explored 100000 steps with 18383 reset in 54 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), p1, (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Referendum-PT-0015-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0015-08 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U !p1)&&F(G(!p1))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3 transition count 3
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 2 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:14] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:14] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:09:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:14] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/16 places, 2/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) p1), true, p1, p1, (NOT p2)]
Running random walk in product with property : Referendum-PT-0015-10 automaton TGBA [mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s0 1), p0:(EQ s1 0), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-10 finished in 206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0)||G(!p0)||X(F(p1))) U (p2&&(G(p0)||G(!p0)||X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4 transition count 4
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4 transition count 4
Applied a total of 24 rules in 1 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:09:14] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:14] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:14] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/16 places, 4/16 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s3 1), p0:(NEQ s0 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13042 reset in 49 ms.
Product exploration explored 100000 steps with 13164 reset in 53 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p2))), (F (G p0)), (F (G (NOT p1))), (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 13028 reset in 46 ms.
Product exploration explored 100000 steps with 13052 reset in 51 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0), (NOT p1)]
Support contains 3 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4/4 places, 4/4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-17 14:09:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:15] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 4/4 transitions.
Product exploration explored 100000 steps with 13042 reset in 144 ms.
Product exploration explored 100000 steps with 12941 reset in 109 ms.
[2021-05-17 14:09:15] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:09:15] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:09:15] [INFO ] Time to serialize gal into /tmp/LTL5833718935996863633.gal : 15 ms
[2021-05-17 14:09:15] [INFO ] Time to serialize properties into /tmp/LTL17058319817750122040.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5833718935996863633.gal, -t, CGAL, -LTL, /tmp/LTL17058319817750122040.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5833718935996863633.gal -t CGAL -LTL /tmp/LTL17058319817750122040.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((((G("(ready!=1)"))||(G("(ready==1)")))||(X(F("(voting_6==1)"))))U(("(voting_9==1)")&&(((G("(ready!=1)"))||(G("(ready==1)")))||(X(F("(voting_6==1)"))))))))
Formula 0 simplified : !X((G"(ready!=1)" | G"(ready==1)" | XF"(voting_6==1)") U ("(voting_9==1)" & (G"(ready!=1)" | G"(ready==1)" | XF"(voting_6==1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/3/4
Computing Next relation with stutter on 1 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.03062,18324,1,0,76,469,51,78,129,1010,219
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0015-13 finished in 1500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(p1||X(F((p1&&F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5 transition count 5
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5 transition count 5
Applied a total of 22 rules in 1 ms. Remains 5 /16 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:15] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:15] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:15] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/16 places, 5/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0015-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s2 1), p2:(AND (EQ s4 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 : [(F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-17 14:09:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:17] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/5 transitions.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
[2021-05-17 14:09:17] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:09:17] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:09:17] [INFO ] Time to serialize gal into /tmp/LTL11419180756493829670.gal : 1 ms
[2021-05-17 14:09:17] [INFO ] Time to serialize properties into /tmp/LTL8812049486517946791.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11419180756493829670.gal, -t, CGAL, -LTL, /tmp/LTL8812049486517946791.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11419180756493829670.gal -t CGAL -LTL /tmp/LTL8812049486517946791.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(voting_7==1)")&&(("(voting_6==1)")||(X(F(("(voting_6==1)")&&(F("((voting_14==1)&&(voting_7==1))")))))))))
Formula 0 simplified : !F("(voting_7==1)" & ("(voting_6==1)" | XF("(voting_6==1)" & F"((voting_14==1)&&(voting_7==1))")))
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t6, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/4/5
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.018913,16592,1,0,24,157,35,10,142,136,27
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0015-14 finished in 1695 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621260558481
--------------------
content from stderr:
+ 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
+ [[ -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 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=/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-PT-0015"
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-0015, 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 r178-tajo-162089415900525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 '
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 ;