fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303546100692
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for TriangularGrid-PT-4022

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
681.100 49264.00 72637.00 361.70 FTFFFFFTFFTFTFFF 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.r258-tall-165303546100692.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 TriangularGrid-PT-4022, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546100692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 8.6K Apr 29 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 11:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 09:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 121K 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 TriangularGrid-PT-4022-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653172796514

Running Version 202205111006
[2022-05-21 22:39:57] [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-21 22:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 22:39:57] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-05-21 22:39:57] [INFO ] Transformed 184 places.
[2022-05-21 22:39:57] [INFO ] Transformed 156 transitions.
[2022-05-21 22:39:57] [INFO ] Parsed PT model containing 184 places and 156 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TriangularGrid-PT-4022-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 16 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:58] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-21 22:39:58] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:58] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-21 22:39:58] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:58] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-21 22:39:58] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Support contains 47 out of 184 places after structural reductions.
[2022-05-21 22:39:58] [INFO ] Flatten gal took : 40 ms
[2022-05-21 22:39:58] [INFO ] Flatten gal took : 17 ms
[2022-05-21 22:39:58] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 46 out of 184 places (down from 47) after GAL structural reductions.
Finished random walk after 1081 steps, including 0 resets, run visited all 26 properties in 65 ms. (steps per millisecond=16 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(p0))&&G(F(p1))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 17 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:59] [INFO ] Computed 77 place invariants in 3 ms
[2022-05-21 22:39:59] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:59] [INFO ] Computed 77 place invariants in 3 ms
[2022-05-21 22:39:59] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2022-05-21 22:39:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:39:59] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-21 22:39:59] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s105 1)) (LT s51 1) (LT s66 1)), p1:(AND (GEQ s57 1) (GEQ s70 1))], 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]]
Product exploration explored 100000 steps with 893 reset in 991 ms.
Product exploration explored 100000 steps with 898 reset in 876 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:02] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-21 22:40:02] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2022-05-21 22:40:02] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 22:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:02] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-21 22:40:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:03] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:03] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-21 22:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:03] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-21 22:40:03] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-21 22:40:03] [INFO ] Added : 59 causal constraints over 12 iterations in 250 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:03] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:03] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:03] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:03] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-05-21 22:40:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:03] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:03] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:04] [INFO ] Computed 77 place invariants in 4 ms
[2022-05-21 22:40:04] [INFO ] [Real]Absence check using 76 positive place invariants in 27 ms returned sat
[2022-05-21 22:40:04] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-21 22:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:04] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-21 22:40:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:04] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-21 22:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:04] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-21 22:40:04] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-21 22:40:05] [INFO ] Added : 59 causal constraints over 12 iterations in 184 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 866 reset in 804 ms.
Product exploration explored 100000 steps with 872 reset in 832 ms.
Built C files in :
/tmp/ltsmin8268452789878910108
[2022-05-21 22:40:06] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-05-21 22:40:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:06] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-05-21 22:40:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:06] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-05-21 22:40:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:06] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8268452789878910108
Running compilation step : cd /tmp/ltsmin8268452789878910108;'/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 415 ms.
Running link step : cd /tmp/ltsmin8268452789878910108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8268452789878910108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13554750138451003351.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-02 finished in 8183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(F(p0)))))||F((F(p2)&&p1))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:07] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:07] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:07] [INFO ] Computed 77 place invariants in 3 ms
[2022-05-21 22:40:07] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2022-05-21 22:40:07] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:07] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:07] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s49 1) (GEQ s85 1)), p0:(OR (LT s40 1) (LT s179 1)), p2:(AND (GEQ s0 1) (GEQ s154 1))], 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]]
Product exploration explored 100000 steps with 2944 reset in 789 ms.
Product exploration explored 100000 steps with 3072 reset in 826 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 550 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 62 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT p2)), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 764 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:11] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:11] [INFO ] [Real]Absence check using 76 positive place invariants in 26 ms returned sat
[2022-05-21 22:40:11] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 26 ms returned sat
[2022-05-21 22:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:11] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-21 22:40:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:11] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2022-05-21 22:40:11] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-21 22:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:11] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-21 22:40:11] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-21 22:40:12] [INFO ] Added : 59 causal constraints over 12 iterations in 170 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:12] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:12] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:12] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-21 22:40:12] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-05-21 22:40:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:12] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:12] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 499 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 62 steps, including 0 resets, run visited all 6 properties in 10 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT p2)), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 627 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:14] [INFO ] Computed 77 place invariants in 4 ms
[2022-05-21 22:40:14] [INFO ] [Real]Absence check using 76 positive place invariants in 24 ms returned sat
[2022-05-21 22:40:14] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 28 ms returned sat
[2022-05-21 22:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:14] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-21 22:40:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:14] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2022-05-21 22:40:14] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-21 22:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:14] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-21 22:40:14] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-21 22:40:14] [INFO ] Added : 59 causal constraints over 12 iterations in 172 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3064 reset in 781 ms.
Product exploration explored 100000 steps with 2935 reset in 843 ms.
Built C files in :
/tmp/ltsmin1349481874060164445
[2022-05-21 22:40:16] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-05-21 22:40:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:16] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-05-21 22:40:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:16] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-05-21 22:40:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1349481874060164445
Running compilation step : cd /tmp/ltsmin1349481874060164445;'/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 327 ms.
Running link step : cd /tmp/ltsmin1349481874060164445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1349481874060164445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11789356609966576859.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-03 finished in 9843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:17] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:17] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:17] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:17] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-05-21 22:40:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:17] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:17] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s59 1) (LT s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 651 ms.
Stack based approach found an accepted trace after 69571 steps with 26 reset with depth 2699 and stack size 2699 in 499 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-04 finished in 1635 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:18] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:19] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:19] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:19] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2022-05-21 22:40:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:19] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-21 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s54 1) (LT s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 38 reset in 617 ms.
Product exploration explored 100000 steps with 35 reset in 690 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 177 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=35 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:21] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:21] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:21] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:21] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-05-21 22:40:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:21] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-21 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40 reset in 623 ms.
Product exploration explored 100000 steps with 38 reset in 666 ms.
Built C files in :
/tmp/ltsmin2664137352926629327
[2022-05-21 22:40:23] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-05-21 22:40:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:23] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-05-21 22:40:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:23] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-05-21 22:40:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2664137352926629327
Running compilation step : cd /tmp/ltsmin2664137352926629327;'/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 301 ms.
Running link step : cd /tmp/ltsmin2664137352926629327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2664137352926629327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15095588627627596749.hoa' '--buchi-type=spotba'
LTSmin run took 1298 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-05 finished in 5853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U p1)&&X(F((X(p1)&&p2)))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:24] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:24] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:24] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:24] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:25] [INFO ] Computed 77 place invariants in 0 ms
[2022-05-21 22:40:25] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s156 1)), p2:(AND (GEQ s51 1) (GEQ s66 1) (GEQ s49 1) (GEQ s75 1)), p0:(AND (GEQ s57 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15274 steps with 64 reset in 120 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-06 finished in 699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U !p1))) U (G(!p3)&&p2)))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:25] [INFO ] Computed 77 place invariants in 0 ms
[2022-05-21 22:40:25] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:25] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:25] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:25] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) p3), p1, p3, p1, true, (AND p3 p1 (NOT p0)), (OR (AND (NOT p1) p3) (AND p0 p3))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p3), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p3, acceptance={0} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND p3 (NOT p1)) (AND p3 p0)), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s54 1) (GEQ s68 1)), p3:(AND (GEQ s61 1) (GEQ s82 1)), p1:(AND (GEQ s37 1) (GEQ s115 1)), p0:(AND (NOT (AND (GEQ s61 1) (GEQ s82 1))) (GEQ s3...], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-08 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(p0)))))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:26] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:26] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 0 ms
[2022-05-21 22:40:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s35 1) (GEQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-09 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(!p0 U p1)||p0||((p0 U p1)&&X(p2)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:26] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:26] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:26] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:26] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) p1 (NOT p2)), p1, (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s63 1) (GEQ s83 1)), p1:(AND (GEQ s54 1) (GEQ s78 1)), p2:(AND (GEQ s57 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-11 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(F(p1))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:27] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:27] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:27] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:27] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:27] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s36 1) (GEQ s177 1)), p0:(OR (LT s55 1) (LT s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TriangularGrid-PT-4022-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-4022-LTLFireability-12 finished in 1417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:28] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:28] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:28] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:28] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2022-05-21 22:40:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:28] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:28] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s63 1) (GEQ s83 1)), p0:(AND (GEQ s51 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 775 reset in 818 ms.
Product exploration explored 100000 steps with 782 reset in 861 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 493 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 240 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 3 factoid took 472 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:31] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-21 22:40:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:32] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-21 22:40:32] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-21 22:40:32] [INFO ] Added : 58 causal constraints over 12 iterations in 202 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:32] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 20 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:32] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-21 22:40:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-21 22:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:33] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-21 22:40:33] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-21 22:40:33] [INFO ] Added : 56 causal constraints over 12 iterations in 172 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:33] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:33] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:33] [INFO ] Computed 77 place invariants in 0 ms
[2022-05-21 22:40:33] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2022-05-21 22:40:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:33] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:33] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 323 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 211 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 3 factoid took 401 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:34] [INFO ] Computed 77 place invariants in 3 ms
[2022-05-21 22:40:34] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2022-05-21 22:40:34] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-21 22:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:34] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-21 22:40:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-05-21 22:40:35] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-21 22:40:35] [INFO ] Added : 58 causal constraints over 12 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:35] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:35] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 21 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:35] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-21 22:40:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-21 22:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 22:40:35] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-21 22:40:35] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-21 22:40:35] [INFO ] Added : 56 causal constraints over 12 iterations in 164 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 764 reset in 775 ms.
Product exploration explored 100000 steps with 781 reset in 828 ms.
Built C files in :
/tmp/ltsmin6482092300313837935
[2022-05-21 22:40:37] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-05-21 22:40:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:37] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-05-21 22:40:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:37] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-05-21 22:40:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:40:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6482092300313837935
Running compilation step : cd /tmp/ltsmin6482092300313837935;'/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 322 ms.
Running link step : cd /tmp/ltsmin6482092300313837935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6482092300313837935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2370015504005154048.hoa' '--buchi-type=spotba'
LTSmin run took 345 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-13 finished in 9907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((X(X((p1 U G(p2))))&&p0))||X(!p1)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:38] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:38] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:38] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:38] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-05-21 22:40:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:38] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:38] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s173 1)), p1:(AND (GEQ s60 1) (GEQ s148 1)), p2:(AND (GEQ s97 1) (GEQ s127 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 35 reset in 701 ms.
Stack based approach found an accepted trace after 53015 steps with 18 reset with depth 2582 and stack size 2582 in 399 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-14 finished in 1716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0))) U X(!X(F(X(p1))))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:40] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:40] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:40] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:40] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:40] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:40] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 321 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s48 1) (GEQ s74 1) (GEQ s32 1) (GEQ s174 1) (GEQ s55 1) (GEQ s138 1)), p0:(AND (GEQ s95 1) (GEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 163 reset in 716 ms.
Product exploration explored 100000 steps with 157 reset in 763 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1838 steps, including 1 resets, run visited all 4 properties in 22 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:43] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-21 22:40:43] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:43] [INFO ] Computed 77 place invariants in 0 ms
[2022-05-21 22:40:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 184 cols
[2022-05-21 22:40:43] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-21 22:40:43] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 222 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[p1, p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 719 ms.
Stuttering criterion allowed to conclude after 30890 steps with 57 reset in 246 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-15 finished in 5521 ms.
All properties solved by simple procedures.
Total runtime 47974 ms.

BK_STOP 1653172845778

--------------------
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="TriangularGrid-PT-4022"
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 TriangularGrid-PT-4022, 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 r258-tall-165303546100692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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