About the Execution of ITS-Tools for NQueens-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2828.752 | 251314.00 | 722380.00 | 509.30 | FTFFFTTFFTTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821500908.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821500908
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 00:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 00:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 00:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 96K 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 NQueens-PT-10-LTLFireability-00
FORMULA_NAME NQueens-PT-10-LTLFireability-01
FORMULA_NAME NQueens-PT-10-LTLFireability-02
FORMULA_NAME NQueens-PT-10-LTLFireability-03
FORMULA_NAME NQueens-PT-10-LTLFireability-04
FORMULA_NAME NQueens-PT-10-LTLFireability-05
FORMULA_NAME NQueens-PT-10-LTLFireability-06
FORMULA_NAME NQueens-PT-10-LTLFireability-07
FORMULA_NAME NQueens-PT-10-LTLFireability-08
FORMULA_NAME NQueens-PT-10-LTLFireability-09
FORMULA_NAME NQueens-PT-10-LTLFireability-10
FORMULA_NAME NQueens-PT-10-LTLFireability-11
FORMULA_NAME NQueens-PT-10-LTLFireability-12
FORMULA_NAME NQueens-PT-10-LTLFireability-13
FORMULA_NAME NQueens-PT-10-LTLFireability-14
FORMULA_NAME NQueens-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652898244713
Running Version 202205111006
[2022-05-18 18:24:05] [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-18 18:24:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:24:06] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-18 18:24:06] [INFO ] Transformed 160 places.
[2022-05-18 18:24:06] [INFO ] Transformed 100 transitions.
[2022-05-18 18:24:06] [INFO ] Parsed PT model containing 160 places and 100 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 58 transition count 100
Applied a total of 100 rules in 13 ms. Remains 58 /158 variables (removed 100) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 58 cols
[2022-05-18 18:24:06] [INFO ] Computed 7 place invariants in 31 ms
[2022-05-18 18:24:06] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 100 rows 58 cols
[2022-05-18 18:24:06] [INFO ] Computed 7 place invariants in 10 ms
[2022-05-18 18:24:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [20, 38, 39, 57]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 367 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/158 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/158 places, 100/100 transitions.
Support contains 44 out of 54 places after structural reductions.
[2022-05-18 18:24:06] [INFO ] Flatten gal took : 66 ms
[2022-05-18 18:24:06] [INFO ] Flatten gal took : 15 ms
[2022-05-18 18:24:06] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 19 properties in 20 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-10-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 22 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-18 18:24:07] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-18 18:24:07] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2022-05-18 18:24:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-18 18:24:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-00 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:(AND (GEQ s5 1) (GEQ s17 1) (GEQ s26 1) (GEQ s48 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 8 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-00 finished in 562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-18 18:24:07] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-18 18:24:07] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:07] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-18 18:24:07] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1) (GEQ s28 1) (GEQ s52 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][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-03 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(F(X(p1)) U X(p2))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-18 18:24:08] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-18 18:24:08] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-18 18:24:08] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s27 1) (GEQ s41 1)), p2:(AND (GEQ s1 1) (GEQ s10 1) (GEQ s29 1) (GEQ s37 1)), p1:(AND (GEQ s1 1) (GEQ s19 1) (GEQ s20 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 14 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-04 finished in 494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((F(p0)&&G(p1))))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:08] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:08] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-05-18 18:24:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:08] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s10 1) (LT s31 1) (LT s39 1) (LT s4 1) (LT s12 1) (LT s30 1) (LT s42 1)), p1:(OR (LT s9 1) (LT s11 1) (LT s36 1) (LT s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14715 reset in 853 ms.
Product exploration explored 100000 steps with 14782 reset in 803 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-06 finished in 2325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(G(F(p1))&&G(F(G(F(p2))))))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:10] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:10] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:10] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-18 18:24:11] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-05-18 18:24:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-18 18:24:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s15 1) (GEQ s28 1) (GEQ s46 1)), p1:(AND (GEQ s7 1) (GEQ s18 1) (GEQ s27 1) (GEQ s51 1)), p2:(AND (GEQ s7 1) (GEQ s19 1) (GEQ s26 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-07 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(X(p1)||G(p2))))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:11] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:11] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:11] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s30 1) (GEQ s38 1)), p2:(OR (LT s0 1) (LT s13 1) (LT s25 1) (LT s39 1)), p1:(OR (LT s0 1) (LT s14 1) (LT s24 1) (LT s4...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-08 finished in 591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(!(p0 U X(X(p1)))))))'
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-18 18:24:11] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:11] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:12] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:12] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:12] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 199 ms :[p1, false, p1, p1, p1]
Running random walk in product with property : NQueens-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s27 1) (GEQ s45 1)), p1:(AND (GEQ s7 1) (GEQ s17 1) (GEQ s28 1) (GEQ s50 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]]
Product exploration explored 100000 steps with 21231 reset in 1047 ms.
Product exploration explored 100000 steps with 21087 reset in 993 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-14 finished in 2774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X(((p0 U G(p1))||!X(p0))))))'
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:14] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:14] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:14] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-18 18:24:14] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 370 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Running random walk in product with property : NQueens-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s16 1) (GEQ s27 1) (GEQ s47 1)), p1:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s34 1) (GEQ s48 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][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17340 reset in 941 ms.
Product exploration explored 100000 steps with 17371 reset in 962 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 651 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 368 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Finished random walk after 29 steps, including 3 resets, run visited all 6 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 816 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 353 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 318 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:19] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-18 18:24:19] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:20] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 683 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 348 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Finished random walk after 12 steps, including 1 resets, run visited all 6 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 870 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 345 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 360 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 363 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 17327 reset in 950 ms.
Product exploration explored 100000 steps with 17392 reset in 972 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 374 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2022-05-18 18:24:25] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:25] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Product exploration explored 100000 steps with 17357 reset in 1111 ms.
Product exploration explored 100000 steps with 17291 reset in 1105 ms.
Built C files in :
/tmp/ltsmin10901444025272880100
[2022-05-18 18:24:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10901444025272880100
Running compilation step : cd /tmp/ltsmin10901444025272880100;'/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 293 ms.
Running link step : cd /tmp/ltsmin10901444025272880100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10901444025272880100;'/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/stateBased13283142583914216943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:43] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-18 18:24:43] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:43] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-18 18:24:43] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:24:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:24:43] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin17171355192520811956
[2022-05-18 18:24:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17171355192520811956
Running compilation step : cd /tmp/ltsmin17171355192520811956;'/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 200 ms.
Running link step : cd /tmp/ltsmin17171355192520811956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17171355192520811956;'/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/stateBased12062390223692197194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 18:24:58] [INFO ] Flatten gal took : 11 ms
[2022-05-18 18:24:58] [INFO ] Flatten gal took : 10 ms
[2022-05-18 18:24:58] [INFO ] Time to serialize gal into /tmp/LTL11117655889538756325.gal : 3 ms
[2022-05-18 18:24:58] [INFO ] Time to serialize properties into /tmp/LTL10178580338475253384.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11117655889538756325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10178580338475253384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1111765...268
Read 1 LTL properties
Checking formula 0 : !((("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))")U(G(X((("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))")U(G("(((cX_9>=1)&&(cY_...254
Formula 0 simplified : !("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))" U GX(("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))" U G"(((cX_9>=1)&&(cY_3>=...241
Detected timeout of ITS tools.
[2022-05-18 18:25:13] [INFO ] Flatten gal took : 10 ms
[2022-05-18 18:25:13] [INFO ] Applying decomposition
[2022-05-18 18:25:13] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5122319863543409208.txt' '-o' '/tmp/graph5122319863543409208.bin' '-w' '/tmp/graph5122319863543409208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5122319863543409208.bin' '-l' '-1' '-v' '-w' '/tmp/graph5122319863543409208.weights' '-q' '0' '-e' '0.001'
[2022-05-18 18:25:13] [INFO ] Decomposing Gal with order
[2022-05-18 18:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 18:25:13] [INFO ] Removed a total of 342 redundant transitions.
[2022-05-18 18:25:13] [INFO ] Flatten gal took : 56 ms
[2022-05-18 18:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-18 18:25:13] [INFO ] Time to serialize gal into /tmp/LTL3207260535916687238.gal : 5 ms
[2022-05-18 18:25:13] [INFO ] Time to serialize properties into /tmp/LTL16229931756861381259.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3207260535916687238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16229931756861381259.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3207260...246
Read 1 LTL properties
Checking formula 0 : !((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))")U(G(X((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12...314
Formula 0 simplified : !("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))" U GX(("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=...301
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17921789289935164394
[2022-05-18 18:25:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17921789289935164394
Running compilation step : cd /tmp/ltsmin17921789289935164394;'/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 213 ms.
Running link step : cd /tmp/ltsmin17921789289935164394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17921789289935164394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X((((LTLAPp0==true) U []((LTLAPp1==true)))||!X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-10-LTLFireability-15 finished in 89243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X(((p0 U G(p1))||!X(p0))))))'
Found a SL insensitive property : NQueens-PT-10-LTLFireability-15
Stuttering acceptance computed with spot in 323 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:25:44] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:25:44] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-18 18:25:44] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Running random walk in product with property : NQueens-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s16 1) (GEQ s27 1) (GEQ s47 1)), p1:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s34 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17307 reset in 931 ms.
Product exploration explored 100000 steps with 17357 reset in 946 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 601 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 302 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Finished random walk after 11 steps, including 1 resets, run visited all 6 properties in 5 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 693 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 304 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 321 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:48] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:25:48] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:48] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-18 18:25:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:48] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-18 18:25:49] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 598 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 325 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Finished random walk after 30 steps, including 3 resets, run visited all 6 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 707 ms. Reduced automaton from 10 states, 22 edges and 2 AP to 10 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 436 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 319 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 322 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 17403 reset in 965 ms.
Product exploration explored 100000 steps with 17409 reset in 989 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 302 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2022-05-18 18:25:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:25:54] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-18 18:25:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Product exploration explored 100000 steps with 17374 reset in 1078 ms.
Product exploration explored 100000 steps with 17314 reset in 1116 ms.
Built C files in :
/tmp/ltsmin17404928311661689193
[2022-05-18 18:25:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17404928311661689193
Running compilation step : cd /tmp/ltsmin17404928311661689193;'/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 198 ms.
Running link step : cd /tmp/ltsmin17404928311661689193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17404928311661689193;'/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/stateBased13644531046626813892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:26:11] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-18 18:26:11] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:26:11] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-18 18:26:11] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2022-05-18 18:26:11] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-18 18:26:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin8362574000242312595
[2022-05-18 18:26:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8362574000242312595
Running compilation step : cd /tmp/ltsmin8362574000242312595;'/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 204 ms.
Running link step : cd /tmp/ltsmin8362574000242312595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8362574000242312595;'/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/stateBased10519807321295504580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 18:26:26] [INFO ] Flatten gal took : 9 ms
[2022-05-18 18:26:26] [INFO ] Flatten gal took : 8 ms
[2022-05-18 18:26:26] [INFO ] Time to serialize gal into /tmp/LTL4086745049563685949.gal : 2 ms
[2022-05-18 18:26:26] [INFO ] Time to serialize properties into /tmp/LTL17945751503257712425.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4086745049563685949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17945751503257712425.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4086745...267
Read 1 LTL properties
Checking formula 0 : !((("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))")U(G(X((("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))")U(G("(((cX_9>=1)&&(cY_...254
Formula 0 simplified : !("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))" U GX(("(((cX_5>=1)&&(cY_6>=1))&&((L_8>=1)&&(R_12>=1)))" U G"(((cX_9>=1)&&(cY_3>=...241
Detected timeout of ITS tools.
[2022-05-18 18:26:41] [INFO ] Flatten gal took : 12 ms
[2022-05-18 18:26:41] [INFO ] Applying decomposition
[2022-05-18 18:26:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8760309851046881610.txt' '-o' '/tmp/graph8760309851046881610.bin' '-w' '/tmp/graph8760309851046881610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8760309851046881610.bin' '-l' '-1' '-v' '-w' '/tmp/graph8760309851046881610.weights' '-q' '0' '-e' '0.001'
[2022-05-18 18:26:42] [INFO ] Decomposing Gal with order
[2022-05-18 18:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 18:26:42] [INFO ] Removed a total of 342 redundant transitions.
[2022-05-18 18:26:42] [INFO ] Flatten gal took : 13 ms
[2022-05-18 18:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-18 18:26:42] [INFO ] Time to serialize gal into /tmp/LTL8489764010366123289.gal : 3 ms
[2022-05-18 18:26:42] [INFO ] Time to serialize properties into /tmp/LTL244286590867549099.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8489764010366123289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL244286590867549099.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8489764...244
Read 1 LTL properties
Checking formula 0 : !((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))")U(G(X((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12...314
Formula 0 simplified : !("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))" U GX(("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=...301
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14838845090681355568
[2022-05-18 18:26:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14838845090681355568
Running compilation step : cd /tmp/ltsmin14838845090681355568;'/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 215 ms.
Running link step : cd /tmp/ltsmin14838845090681355568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14838845090681355568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X((((LTLAPp0==true) U []((LTLAPp1==true)))||!X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-10-LTLFireability-15 finished in 88260 ms.
[2022-05-18 18:27:12] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2022-05-18 18:27:12] [INFO ] Applying decomposition
[2022-05-18 18:27:12] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin22725592622410816
[2022-05-18 18:27:12] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-18 18:27:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 18:27:12] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-18 18:27:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 18:27:12] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-18 18:27:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 18:27:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin22725592622410816
Running compilation step : cd /tmp/ltsmin22725592622410816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3692737144121985708.txt' '-o' '/tmp/graph3692737144121985708.bin' '-w' '/tmp/graph3692737144121985708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3692737144121985708.bin' '-l' '-1' '-v' '-w' '/tmp/graph3692737144121985708.weights' '-q' '0' '-e' '0.001'
[2022-05-18 18:27:12] [INFO ] Decomposing Gal with order
[2022-05-18 18:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 18:27:12] [INFO ] Removed a total of 342 redundant transitions.
[2022-05-18 18:27:12] [INFO ] Flatten gal took : 12 ms
[2022-05-18 18:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-18 18:27:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12273374001822865675.gal : 2 ms
[2022-05-18 18:27:12] [INFO ] Time to serialize properties into /tmp/LTLFireability5063098279048195702.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12273374001822865675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5063098279048195702.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))")U(G(X((("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12...314
Formula 0 simplified : !("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=1)))" U GX(("(((u5.cX_5>=1)&&(u16.cY_6>=1))&&((u27.L_8>=1)&&(u47.R_12>=...301
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin22725592622410816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin22725592622410816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X((((LTLAPp0==true) U []((LTLAPp1==true)))||!X((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 63363 ms.
FORMULA NQueens-PT-10-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 250071 ms.
BK_STOP 1652898496027
--------------------
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="NQueens-PT-10"
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 NQueens-PT-10, 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 r132-tall-165271821500908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-10.tgz
mv NQueens-PT-10 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 ;