Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127600309.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-6A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 297K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-6A-00
FORMULA_NAME NoC3x3-PT-6A-01
FORMULA_NAME NoC3x3-PT-6A-02
FORMULA_NAME NoC3x3-PT-6A-03
FORMULA_NAME NoC3x3-PT-6A-04
FORMULA_NAME NoC3x3-PT-6A-05
FORMULA_NAME NoC3x3-PT-6A-06
FORMULA_NAME NoC3x3-PT-6A-07
FORMULA_NAME NoC3x3-PT-6A-08
FORMULA_NAME NoC3x3-PT-6A-09
FORMULA_NAME NoC3x3-PT-6A-10
FORMULA_NAME NoC3x3-PT-6A-11
FORMULA_NAME NoC3x3-PT-6A-12
FORMULA_NAME NoC3x3-PT-6A-13
FORMULA_NAME NoC3x3-PT-6A-14
FORMULA_NAME NoC3x3-PT-6A-15

=== Now, execution of the tool begins

BK_START 1620965637166

Running Version 0
[2021-05-14 04:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 04:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 04:13:58] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2021-05-14 04:13:58] [INFO ] Transformed 512 places.
[2021-05-14 04:13:58] [INFO ] Transformed 1117 transitions.
[2021-05-14 04:13:58] [INFO ] Found NUPN structural information;
[2021-05-14 04:13:58] [INFO ] Parsed PT model containing 512 places and 1117 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 04:13:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA NoC3x3-PT-6A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 512 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 442 transition count 835
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 442 transition count 835
Applied a total of 140 rules in 73 ms. Remains 442 /512 variables (removed 70) and now considering 835/1117 (removed 282) transitions.
[2021-05-14 04:13:59] [INFO ] Flow matrix only has 827 transitions (discarded 8 similar events)
// Phase 1: matrix 827 rows 442 cols
[2021-05-14 04:13:59] [INFO ] Computed 66 place invariants in 24 ms
[2021-05-14 04:13:59] [INFO ] Implicit Places using invariants in 344 ms returned [12, 47, 97, 135, 194, 282, 334, 373]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 370 ms to find 8 implicit places.
[2021-05-14 04:13:59] [INFO ] Flow matrix only has 827 transitions (discarded 8 similar events)
// Phase 1: matrix 827 rows 434 cols
[2021-05-14 04:13:59] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-14 04:13:59] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 434/512 places, 835/1117 transitions.
Applied a total of 0 rules in 8 ms. Remains 434 /434 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2021-05-14 04:13:59] [INFO ] Flow matrix only has 827 transitions (discarded 8 similar events)
// Phase 1: matrix 827 rows 434 cols
[2021-05-14 04:13:59] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-14 04:14:00] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Finished structural reductions, in 2 iterations. Remains : 434/512 places, 835/1117 transitions.
[2021-05-14 04:14:00] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 04:14:00] [INFO ] Flatten gal took : 102 ms
FORMULA NoC3x3-PT-6A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 04:14:00] [INFO ] Flatten gal took : 64 ms
[2021-05-14 04:14:00] [INFO ] Input system was already deterministic with 835 transitions.
Incomplete random walk after 100000 steps, including 271 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 32) seen :29
Running SMT prover for 3 properties.
[2021-05-14 04:14:01] [INFO ] Flow matrix only has 827 transitions (discarded 8 similar events)
// Phase 1: matrix 827 rows 434 cols
[2021-05-14 04:14:01] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-14 04:14:01] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2021-05-14 04:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 04:14:01] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-14 04:14:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 04:14:01] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 04:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 04:14:01] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-14 04:14:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-14 04:14:01] [INFO ] [Nat]Added 19 Read/Feed constraints in 63 ms returned sat
[2021-05-14 04:14:01] [INFO ] Computed and/alt/rep : 607/3426/607 causal constraints (skipped 219 transitions) in 53 ms.
[2021-05-14 04:14:05] [INFO ] Added : 364 causal constraints over 73 iterations in 3797 ms. Result :sat
[2021-05-14 04:14:05] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2021-05-14 04:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 04:14:05] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-14 04:14:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 04:14:05] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-14 04:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 04:14:06] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-14 04:14:06] [INFO ] [Nat]Added 19 Read/Feed constraints in 71 ms returned sat
[2021-05-14 04:14:06] [INFO ] Computed and/alt/rep : 607/3426/607 causal constraints (skipped 219 transitions) in 70 ms.
[2021-05-14 04:14:11] [INFO ] Added : 468 causal constraints over 94 iterations in 5094 ms. Result :sat
[2021-05-14 04:14:11] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2021-05-14 04:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 04:14:11] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-14 04:14:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 04:14:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G((X((X(G(p3))&&p2))&&p1)) U (p4&&G((X((X(G(p3))&&p6))&&p5)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 787
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 787
Applied a total of 22 rules in 18 ms. Remains 423 /434 variables (removed 11) and now considering 787/835 (removed 48) transitions.
// Phase 1: matrix 787 rows 423 cols
[2021-05-14 04:14:11] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 04:14:12] [INFO ] Implicit Places using invariants in 202 ms returned [405]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
// Phase 1: matrix 787 rows 422 cols
[2021-05-14 04:14:12] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-14 04:14:12] [INFO ] Dead Transitions using invariants and state equation in 282 ms returned []
Starting structural reductions, iteration 1 : 422/434 places, 787/835 transitions.
Applied a total of 0 rules in 15 ms. Remains 422 /422 variables (removed 0) and now considering 787/787 (removed 0) transitions.
// Phase 1: matrix 787 rows 422 cols
[2021-05-14 04:14:12] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:14:12] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Finished structural reductions, in 2 iterations. Remains : 422/434 places, 787/835 transitions.
Stuttering acceptance computed with spot in 2063 ms :[(OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (NOT p4) (NOT p5) (NOT p3) (NOT p6)), true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p5) (NOT p6) (NOT p3)), (OR (NOT p3) (NOT p6)), (OR (AND (NOT p4) p5 (NOT p6)) (AND (NOT p3) p6) (AND (NOT p5) p6)), (OR (AND (NOT p1) p4 p5 (NOT p6)) (AND p1 (NOT p2) (NOT p6)) (AND p1 (NOT p2) (NOT p5)) (AND p2 (NOT p3) (NOT p6)) (AND (NOT p3) p4 p5) (AND p2 (NOT p3) p5) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p3) (NOT p4) p5) (AND (NOT p3) p6)), (OR (AND p2 (NOT p3) (NOT p6)) (AND p2 (NOT p3) p5) (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-6A-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p4) p1) (AND (NOT p5) p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p1)) (AND (NOT p5) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p4) p1) (AND (NOT p5) p1)), acceptance={} source=2 dest: 4}, { cond=(AND p4 p5 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p4 p5 p1), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p4 p5 p1), acceptance={1} source=2 dest: 7}, { cond=(AND p4 p5 p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 9}], [{ cond=(OR (NOT p5) (NOT p6)), acceptance={} source=5 dest: 3}, { cond=(AND p5 p6), acceptance={} source=5 dest: 5}, { cond=(AND p5 p6), acceptance={} source=5 dest: 9}], [{ cond=(OR (AND (NOT p4) p1 (NOT p6)) (AND (NOT p5) p1 (NOT p6))), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p1) (NOT p6)) (AND (NOT p5) (NOT p1) (NOT p6))), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p4) p1 (NOT p6)) (AND (NOT p5) p1 (NOT p6))), acceptance={} source=6 dest: 4}, { cond=(AND p4 p5 (NOT p1) (NOT p6)), acceptance={} source=6 dest: 5}, { cond=(AND p4 p5 p1 (NOT p6)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p4 p5 p1 (NOT p6)), acceptance={1} source=6 dest: 7}, { cond=(AND p4 p5 p1 (NOT p6)), acceptance={} source=6 dest: 8}, { cond=(OR (AND (NOT p4) (NOT p1) p6) (AND (NOT p5) (NOT p1) p6)), acceptance={} source=6 dest: 9}, { cond=(AND p4 p5 p1 p6), acceptance={0, 1} source=6 dest: 10}, { cond=(AND p4 p5 p1 p6), acceptance={1} source=6 dest: 11}, { cond=(AND p4 p5 p1 p6), acceptance={} source=6 dest: 12}, { cond=(OR (AND (NOT p4) p1 p6) (AND (NOT p5) p1 p6)), acceptance={0, 1} source=6 dest: 13}, { cond=(OR (AND (NOT p4) p1 p6) (AND (NOT p5) p1 p6)), acceptance={} source=6 dest: 14}, { cond=(AND p4 p5 (NOT p1) p6), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p5) p1 p6), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p5) (NOT p1) p6), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p5) p1 p6), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p4) p5 (NOT p1)) (AND p5 (NOT p1) p6)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p4) p5 p1) (AND p5 p1 p6)), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND (NOT p4) p5 p1) (AND p5 p1 p6)), acceptance={1} source=7 dest: 7}, { cond=(OR (AND (NOT p4) p5 p1) (AND p5 p1 p6)), acceptance={} source=7 dest: 8}], [{ cond=(OR (AND p4 p5 (NOT p1) (NOT p6)) (AND (NOT p5) p1 (NOT p2)) (AND p1 (NOT p6) (NOT p2))), acceptance={} source=8 dest: 3}, { cond=(AND p4 p5 p1 (NOT p6) p2), acceptance={} source=8 dest: 4}, { cond=(AND p5 p1 p6 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p4) (NOT p6) p2) (AND p4 p5 p6) (AND (NOT p5) (NOT p6) p2) (AND p5 p1 p6) (AND p1 p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p4) p5 (NOT p1) p6 p2), acceptance={} source=8 dest: 15}], [{ cond=(NOT p3), acceptance={} source=9 dest: 3}, { cond=p3, acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p4) p1 (NOT p6) (NOT p3)) (AND (NOT p5) p1 (NOT p6) (NOT p3))), acceptance={0, 1} source=10 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p1) (NOT p6) (NOT p3)) (AND (NOT p5) (NOT p1) (NOT p6) (NOT p3))), acceptance={} source=10 dest: 3}, { cond=(OR (AND (NOT p4) p1 (NOT p6) (NOT p3)) (AND (NOT p5) p1 (NOT p6) (NOT p3))), acceptance={} source=10 dest: 4}, { cond=(AND p4 p5 (NOT p1) (NOT p6) (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p4 p5 p1 (NOT p6) (NOT p3)), acceptance={0, 1} source=10 dest: 6}, { cond=(AND p4 p5 p1 (NOT p6) (NOT p3)), acceptance={1} source=10 dest: 7}, { cond=(AND p4 p5 p1 (NOT p6) (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(OR (AND (NOT p4) (NOT p1) p6) (AND (NOT p4) (NOT p1) p3) (AND (NOT p5) (NOT p1) p6) (AND (NOT p5) (NOT p1) p3)), acceptance={} source=10 dest: 9}, { cond=(AND p4 p5 p1 p6 (NOT p3)), acceptance={0, 1} source=10 dest: 10}, { cond=(AND p4 p5 p1 p3), acceptance={0} source=10 dest: 10}, { cond=(AND p4 p5 p1 p6 (NOT p3)), acceptance={1} source=10 dest: 11}, { cond=(AND p4 p5 p1 p3), acceptance={} source=10 dest: 11}, { cond=(OR (AND p4 p5 p1 p6) (AND p4 p5 p1 p3)), acceptance={} source=10 dest: 12}, { cond=(OR (AND (NOT p4) p1 p6 (NOT p3)) (AND (NOT p5) p1 p6 (NOT p3))), acceptance={0, 1} source=10 dest: 13}, { cond=(OR (AND (NOT p4) p1 p3) (AND (NOT p5) p1 p3)), acceptance={0} source=10 dest: 13}, { cond=(OR (AND (NOT p4) p1 p6) (AND (NOT p4) p1 p3) (AND (NOT p5) p1 p6) (AND (NOT p5) p1 p3)), acceptance={} source=10 dest: 14}, { cond=(OR (AND p4 p5 (NOT p1) p6) (AND p4 p5 (NOT p1) p3)), acceptance={} source=10 dest: 15}], [{ cond=(AND (NOT p5) p1 p6 (NOT p3)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p5) (NOT p1) p6 (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p5) p1 p6 (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(OR (AND (NOT p4) p5 (NOT p1) (NOT p3)) (AND p5 (NOT p1) p6 (NOT p3))), acceptance={} source=11 dest: 5}, { cond=(OR (AND (NOT p4) p5 p1 (NOT p3)) (AND p5 p1 p6 (NOT p3))), acceptance={0, 1} source=11 dest: 6}, { cond=(OR (AND (NOT p4) p5 p1 (NOT p3)) (AND p5 p1 p6 (NOT p3))), acceptance={1} source=11 dest: 7}, { cond=(OR (AND (NOT p4) p5 p1 (NOT p3)) (AND p5 p1 p6 (NOT p3))), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p4) p5 p1 p3), acceptance={0} source=11 dest: 10}, { cond=(AND (NOT p4) p5 p1 p3), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p4) p5 p1 p3), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p4) p5 (NOT p1) p3), acceptance={} source=11 dest: 15}], [{ cond=(OR (AND p4 p5 (NOT p1) (NOT p6) (NOT p3)) (AND (NOT p5) p1 (NOT p2) (NOT p3)) (AND p1 (NOT p6) (NOT p2) (NOT p3))), acceptance={} source=12 dest: 3}, { cond=(AND p4 p5 p1 (NOT p6) p2 (NOT p3)), acceptance={} source=12 dest: 4}, { cond=(AND p5 p1 p6 (NOT p2) (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(OR (AND (NOT p4) (NOT p6) p2 (NOT p3)) (AND p4 p5 p6) (AND p4 p5 p3) (AND (NOT p5) (NOT p6) p2 (NOT p3)) (AND p5 p1 p6) (AND p1 p2) (AND p1 p3)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p4) p5 (NOT p1) p6 p2 (NOT p3)), acceptance={} source=12 dest: 15}], [{ cond=(OR (AND (NOT p4) p1 (NOT p3)) (AND (NOT p5) p1 (NOT p3))), acceptance={0, 1} source=13 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p1) (NOT p3)) (AND (NOT p5) (NOT p1) (NOT p3))), acceptance={} source=13 dest: 3}, { cond=(OR (AND (NOT p4) p1 (NOT p3)) (AND (NOT p5) p1 (NOT p3))), acceptance={} source=13 dest: 4}, { cond=(AND p4 p5 (NOT p1) (NOT p3)), acceptance={} source=13 dest: 5}, { cond=(AND p4 p5 p1 (NOT p3)), acceptance={0, 1} source=13 dest: 6}, { cond=(AND p4 p5 p1 (NOT p3)), acceptance={1} source=13 dest: 7}, { cond=(AND p4 p5 p1 (NOT p3)), acceptance={} source=13 dest: 8}, { cond=(OR (AND (NOT p4) (NOT p1) p3) (AND (NOT p5) (NOT p1) p3)), acceptance={} source=13 dest: 9}, { cond=(AND p4 p5 p1 p3), acceptance={0} source=13 dest: 10}, { cond=(AND p4 p5 p1 p3), acceptance={} source=13 dest: 11}, { cond=(AND p4 p5 p1 p3), acceptance={} source=13 dest: 12}, { cond=(OR (AND (NOT p4) p1 p3) (AND (NOT p5) p1 p3)), acceptance={0} source=13 dest: 13}, { cond=(OR (AND (NOT p4) p1 p3) (AND (NOT p5) p1 p3)), acceptance={} source=13 dest: 14}, { cond=(AND p4 p5 (NOT p1) p3), acceptance={} source=13 dest: 15}], [{ cond=(OR (AND p4 p5 (NOT p1) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=14 dest: 3}, { cond=(AND p4 p5 p1 p2 (NOT p3)), acceptance={} source=14 dest: 4}, { cond=(OR (AND p4 p5 p3) (AND p1 p2) (AND p1 p3)), acceptance={} source=14 dest: 9}], [{ cond=(OR (AND (NOT p5) (NOT p3)) (AND (NOT p6) (NOT p3))), acceptance={} source=15 dest: 3}, { cond=(AND p5 p6 (NOT p3)), acceptance={} source=15 dest: 5}, { cond=(OR (AND p5 p6) p3), acceptance={} source=15 dest: 9}]], initial=0, aps=[p0:(OR (EQ s400 0) (EQ s421 0)), p4:(OR (EQ s400 0) (EQ s421 0)), p1:(AND (EQ s310 1) (EQ s324 1)), p5:(AND (EQ s310 1) (EQ s324 1)), p2:(AND (EQ s31 1) (EQ s73 1)), p6:(AND (EQ s31 1) (EQ s73 1)), p3:(AND (EQ s31 1) (EQ s73 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1358 ms.
Product exploration explored 100000 steps with 50000 reset in 1125 ms.
Knowledge obtained : [p0, p4, (NOT p1), (NOT p5), (NOT p2), (NOT p6), (NOT p3)]
Stuttering acceptance computed with spot in 772 ms :[(OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (NOT p4) (NOT p5) (NOT p3) (NOT p6)), true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p5) (NOT p6) (NOT p3)), (OR (NOT p3) (NOT p6)), (OR (AND (NOT p4) p5 (NOT p6)) (AND (NOT p3) p6) (AND (NOT p5) p6)), (OR (AND (NOT p1) p4 p5 (NOT p6)) (AND p1 (NOT p2) (NOT p6)) (AND p1 (NOT p2) (NOT p5)) (AND p2 (NOT p3) (NOT p6)) (AND (NOT p3) p4 p5) (AND p2 (NOT p3) p5) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p3) (NOT p4) p5) (AND (NOT p3) p6)), (OR (AND p2 (NOT p3) (NOT p6)) (AND p2 (NOT p3) p5) (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 1079 ms.
Product exploration explored 100000 steps with 50000 reset in 1129 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, false, false, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1031 ms :[(OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p6)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (NOT p4) (NOT p5) (NOT p3) (NOT p6)), true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p5) (NOT p6) (NOT p3)), (OR (NOT p3) (NOT p6)), (OR (AND (NOT p4) p5 (NOT p6)) (AND (NOT p3) p6) (AND (NOT p5) p6)), (OR (AND (NOT p1) p4 p5 (NOT p6)) (AND p1 (NOT p2) (NOT p6)) (AND p1 (NOT p2) (NOT p5)) (AND p2 (NOT p3) (NOT p6)) (AND (NOT p3) p4 p5) (AND p2 (NOT p3) p5) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p3) (NOT p4) p5) (AND (NOT p3) p6)), (OR (AND p2 (NOT p3) (NOT p6)) (AND p2 (NOT p3) p5) (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p3) p4 p5) (AND p1 (NOT p3))), (NOT p3), (OR (NOT p3) (NOT p5) (NOT p4) (NOT p6)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p5) (NOT p6) (NOT p3)), (OR (NOT p3) (NOT p6)), (OR (AND (NOT p4) p5 (NOT p6)) (AND (NOT p3) p6) (AND (NOT p5) p6)), (OR (AND (NOT p1) p4 p5 (NOT p6)) (AND p1 (NOT p2) (NOT p6)) (AND p1 (NOT p2) (NOT p5)) (AND p2 (NOT p3) (NOT p6)) (AND (NOT p3) p4 p5) (AND p2 (NOT p3) p5) (AND p1 (NOT p3)))]
Support contains 6 out of 422 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 422/422 places, 787/787 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 422 transition count 787
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 422 transition count 818
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 27 rules in 62 ms. Remains 422 /422 variables (removed 0) and now considering 818/787 (removed -31) transitions.
[2021-05-14 04:14:22] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 818 rows 422 cols
[2021-05-14 04:14:22] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 04:14:22] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 818/787 transitions.
Product exploration explored 100000 steps with 50000 reset in 1125 ms.
Product exploration explored 100000 steps with 50000 reset in 1111 ms.
[2021-05-14 04:14:24] [INFO ] Flatten gal took : 49 ms
[2021-05-14 04:14:24] [INFO ] Flatten gal took : 44 ms
[2021-05-14 04:14:24] [INFO ] Time to serialize gal into /tmp/LTL1397529709302723611.gal : 17 ms
[2021-05-14 04:14:24] [INFO ] Time to serialize properties into /tmp/LTL5647104847956563204.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1397529709302723611.gal, -t, CGAL, -LTL, /tmp/LTL5647104847956563204.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1397529709302723611.gal -t CGAL -LTL /tmp/LTL5647104847956563204.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p487==0)||(p511==0))")||(X((G(("((p377==1)&&(p396==1))")&&(X(("((p38==1)&&(p86==1))")&&(X(G("((p38==1)&&(p86==1))")))))))U(("((p487==0)||(p511==0))")&&(G(("((p377==1)&&(p396==1))")&&(X(("((p38==1)&&(p86==1))")&&(X(G("((p38==1)&&(p86==1))")))))))))))))
Formula 0 simplified : !X("((p487==0)||(p511==0))" | X(G("((p377==1)&&(p396==1))" & X("((p38==1)&&(p86==1))" & XG"((p38==1)&&(p86==1))")) U ("((p487==0)||(p511==0))" & G("((p377==1)&&(p396==1))" & X("((p38==1)&&(p86==1))" & XG"((p38==1)&&(p86==1))")))))
Detected timeout of ITS tools.
[2021-05-14 04:14:39] [INFO ] Flatten gal took : 39 ms
[2021-05-14 04:14:39] [INFO ] Applying decomposition
[2021-05-14 04:14:39] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17650126139070560627.txt, -o, /tmp/graph17650126139070560627.bin, -w, /tmp/graph17650126139070560627.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17650126139070560627.bin, -l, -1, -v, -w, /tmp/graph17650126139070560627.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 04:14:40] [INFO ] Decomposing Gal with order
[2021-05-14 04:14:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:14:40] [INFO ] Removed a total of 616 redundant transitions.
[2021-05-14 04:14:40] [INFO ] Flatten gal took : 119 ms
[2021-05-14 04:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 581 labels/synchronizations in 20 ms.
[2021-05-14 04:14:40] [INFO ] Time to serialize gal into /tmp/LTL11487579699204991928.gal : 13 ms
[2021-05-14 04:14:40] [INFO ] Time to serialize properties into /tmp/LTL4827698913756680905.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11487579699204991928.gal, -t, CGAL, -LTL, /tmp/LTL4827698913756680905.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11487579699204991928.gal -t CGAL -LTL /tmp/LTL4827698913756680905.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i9.u49.p487==0)||(i9.u52.p511==0))")||(X((G(("((i7.u39.p377==1)&&(i7.u39.p396==1))")&&(X(("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")&&(X(G("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")))))))U(("((i9.u49.p487==0)||(i9.u52.p511==0))")&&(G(("((i7.u39.p377==1)&&(i7.u39.p396==1))")&&(X(("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")&&(X(G("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")))))))))))))
Formula 0 simplified : !X("((i9.u49.p487==0)||(i9.u52.p511==0))" | X(G("((i7.u39.p377==1)&&(i7.u39.p396==1))" & X("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))" & XG"((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")) U ("((i9.u49.p487==0)||(i9.u52.p511==0))" & G("((i7.u39.p377==1)&&(i7.u39.p396==1))" & X("((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))" & XG"((i1.i1.u5.p38==1)&&(i1.i1.u10.p86==1))")))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3309722636059233191
[2021-05-14 04:14:55] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3309722636059233191
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3309722636059233191]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3309722636059233191] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3309722636059233191] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6A-00 finished in 44627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((F((G(p2)&&p1))&&X(p3)))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 794
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 794
Applied a total of 18 rules in 11 ms. Remains 425 /434 variables (removed 9) and now considering 794/835 (removed 41) transitions.
[2021-05-14 04:14:56] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 425 cols
[2021-05-14 04:14:56] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 04:14:56] [INFO ] Implicit Places using invariants in 195 ms returned [407]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
[2021-05-14 04:14:56] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 424 cols
[2021-05-14 04:14:56] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:14:56] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Starting structural reductions, iteration 1 : 424/434 places, 794/835 transitions.
Applied a total of 0 rules in 6 ms. Remains 424 /424 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2021-05-14 04:14:56] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 424 cols
[2021-05-14 04:14:56] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:14:57] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 2 iterations. Remains : 424/434 places, 794/835 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s353 0) (EQ s382 0)), p1:(AND (EQ s353 1) (EQ s382 1)), p2:(AND (EQ s7 1) (EQ s127 1)), p3:(AND (EQ s353 1) (EQ s382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1402 steps with 4 reset in 11 ms.
FORMULA NoC3x3-PT-6A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-01 finished in 918 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 799
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 799
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 58 place count 405 transition count 779
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 402 transition count 804
Applied a total of 64 rules in 66 ms. Remains 402 /434 variables (removed 32) and now considering 804/835 (removed 31) transitions.
[2021-05-14 04:14:57] [INFO ] Flow matrix only has 802 transitions (discarded 2 similar events)
// Phase 1: matrix 802 rows 402 cols
[2021-05-14 04:14:57] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 04:14:57] [INFO ] Implicit Places using invariants in 172 ms returned [384]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
[2021-05-14 04:14:57] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-14 04:14:57] [INFO ] Flow matrix only has 802 transitions (discarded 2 similar events)
// Phase 1: matrix 802 rows 401 cols
[2021-05-14 04:14:57] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:14:57] [INFO ] Dead Transitions using invariants and state equation in 297 ms returned []
Starting structural reductions, iteration 1 : 401/434 places, 804/835 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 399 transition count 802
Applied a total of 4 rules in 36 ms. Remains 399 /401 variables (removed 2) and now considering 802/804 (removed 2) transitions.
[2021-05-14 04:14:57] [INFO ] Flow matrix only has 800 transitions (discarded 2 similar events)
// Phase 1: matrix 800 rows 399 cols
[2021-05-14 04:14:57] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 04:14:58] [INFO ] Implicit Places using invariants in 176 ms returned []
[2021-05-14 04:14:58] [INFO ] Flow matrix only has 800 transitions (discarded 2 similar events)
// Phase 1: matrix 800 rows 399 cols
[2021-05-14 04:14:58] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 04:14:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-14 04:14:58] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 399/434 places, 802/835 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s40 1) (EQ s208 1) (EQ s321 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 313 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-03 finished in 1649 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 790
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 790
Applied a total of 20 rules in 9 ms. Remains 424 /434 variables (removed 10) and now considering 790/835 (removed 45) transitions.
// Phase 1: matrix 790 rows 424 cols
[2021-05-14 04:14:58] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 04:14:59] [INFO ] Implicit Places using invariants in 168 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
// Phase 1: matrix 790 rows 423 cols
[2021-05-14 04:14:59] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Starting structural reductions, iteration 1 : 423/434 places, 790/835 transitions.
Applied a total of 0 rules in 4 ms. Remains 423 /423 variables (removed 0) and now considering 790/790 (removed 0) transitions.
// Phase 1: matrix 790 rows 423 cols
[2021-05-14 04:14:59] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned []
Finished structural reductions, in 2 iterations. Remains : 423/434 places, 790/835 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-6A-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (NEQ s379 1) (NEQ s175 1) (NEQ s204 1)), p1:(NEQ s379 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42737 steps with 113 reset in 178 ms.
FORMULA NoC3x3-PT-6A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-04 finished in 1094 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||(F(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 787
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 787
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 66 place count 401 transition count 765
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 398 transition count 790
Applied a total of 72 rules in 43 ms. Remains 398 /434 variables (removed 36) and now considering 790/835 (removed 45) transitions.
// Phase 1: matrix 790 rows 398 cols
[2021-05-14 04:15:00] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:15:00] [INFO ] Implicit Places using invariants in 188 ms returned [380]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
[2021-05-14 04:15:00] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 790 rows 397 cols
[2021-05-14 04:15:00] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Starting structural reductions, iteration 1 : 397/434 places, 790/835 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 395 transition count 788
Applied a total of 4 rules in 32 ms. Remains 395 /397 variables (removed 2) and now considering 788/790 (removed 2) transitions.
// Phase 1: matrix 788 rows 395 cols
[2021-05-14 04:15:00] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:00] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 788 rows 395 cols
[2021-05-14 04:15:00] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-14 04:15:01] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 395/434 places, 788/835 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s327 1) (EQ s364 1)), p2:(AND (EQ s323 1) (EQ s353 1) (EQ s33 1) (EQ s64 1)), p1:(OR (NEQ s323 1) (NEQ s353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-05 finished in 1698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 787
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 787
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 66 place count 401 transition count 765
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 398 transition count 790
Applied a total of 72 rules in 37 ms. Remains 398 /434 variables (removed 36) and now considering 790/835 (removed 45) transitions.
// Phase 1: matrix 790 rows 398 cols
[2021-05-14 04:15:01] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:15:01] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 790 rows 398 cols
[2021-05-14 04:15:01] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 04:15:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-14 04:15:02] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2021-05-14 04:15:02] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 790 rows 398 cols
[2021-05-14 04:15:02] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:15:03] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 398/434 places, 790/835 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s380 0) (NEQ s385 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-07 finished in 1387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(X((p1 U (p2||G(p1)))) U ((p3&&X((p1 U (p2||G(p1)))))||X(G(p4)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 791
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 791
Applied a total of 20 rules in 8 ms. Remains 424 /434 variables (removed 10) and now considering 791/835 (removed 44) transitions.
[2021-05-14 04:15:03] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 424 cols
[2021-05-14 04:15:03] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:15:03] [INFO ] Implicit Places using invariants in 199 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
[2021-05-14 04:15:03] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 423 cols
[2021-05-14 04:15:03] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:03] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Starting structural reductions, iteration 1 : 423/434 places, 791/835 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2021-05-14 04:15:03] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 423 cols
[2021-05-14 04:15:03] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:03] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Finished structural reductions, in 2 iterations. Remains : 423/434 places, 791/835 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), true, (AND (NOT p2) (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (NOT p4), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p4), acceptance={} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s83 0) (EQ s101 0)), p3:(OR (NEQ s255 1) (NEQ s292 1)), p4:(OR (NEQ s89 1) (NEQ s106 1) (AND (NEQ s104 1) (OR (NEQ s89 1) (NEQ s106 1)))), p2:(AND (NEQ s104 1) (OR (NEQ s89 1) (NEQ s106 1))), p1:(OR (NEQ s89 1) (NEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 135 steps with 12 reset in 2 ms.
FORMULA NoC3x3-PT-6A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-08 finished in 995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 796
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 796
Applied a total of 18 rules in 13 ms. Remains 425 /434 variables (removed 9) and now considering 796/835 (removed 39) transitions.
[2021-05-14 04:15:04] [INFO ] Flow matrix only has 793 transitions (discarded 3 similar events)
// Phase 1: matrix 793 rows 425 cols
[2021-05-14 04:15:04] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:15:04] [INFO ] Implicit Places using invariants in 172 ms returned [407]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
[2021-05-14 04:15:04] [INFO ] Flow matrix only has 793 transitions (discarded 3 similar events)
// Phase 1: matrix 793 rows 424 cols
[2021-05-14 04:15:04] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:04] [INFO ] Dead Transitions using invariants and state equation in 282 ms returned []
Starting structural reductions, iteration 1 : 424/434 places, 796/835 transitions.
Applied a total of 0 rules in 3 ms. Remains 424 /424 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2021-05-14 04:15:04] [INFO ] Flow matrix only has 793 transitions (discarded 3 similar events)
// Phase 1: matrix 793 rows 424 cols
[2021-05-14 04:15:04] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 04:15:04] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Finished structural reductions, in 2 iterations. Remains : 424/434 places, 796/835 transitions.
Stuttering acceptance computed with spot in 893 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s85 0) (AND (EQ s320 1) (EQ s365 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1110 ms.
Product exploration explored 100000 steps with 50000 reset in 1086 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1058 ms.
Product exploration explored 100000 steps with 50000 reset in 1077 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 424/424 places, 796/796 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 424 transition count 796
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 424 transition count 827
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 25 rules in 25 ms. Remains 424 /424 variables (removed 0) and now considering 827/796 (removed -31) transitions.
[2021-05-14 04:15:10] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 04:15:10] [INFO ] Flow matrix only has 824 transitions (discarded 3 similar events)
// Phase 1: matrix 824 rows 424 cols
[2021-05-14 04:15:10] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:10] [INFO ] Dead Transitions using invariants and state equation in 291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 424/424 places, 827/796 transitions.
Product exploration explored 100000 steps with 50000 reset in 2991 ms.
Product exploration explored 100000 steps with 50000 reset in 2962 ms.
[2021-05-14 04:15:16] [INFO ] Flatten gal took : 33 ms
[2021-05-14 04:15:16] [INFO ] Flatten gal took : 30 ms
[2021-05-14 04:15:16] [INFO ] Time to serialize gal into /tmp/LTL11442798840504170047.gal : 4 ms
[2021-05-14 04:15:16] [INFO ] Time to serialize properties into /tmp/LTL15420970859485293565.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11442798840504170047.gal, -t, CGAL, -LTL, /tmp/LTL15420970859485293565.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11442798840504170047.gal -t CGAL -LTL /tmp/LTL15420970859485293565.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p74==0)||(p101==0))||((p389==1)&&(p444==1)))"))))
Formula 0 simplified : !XF"(((p74==0)||(p101==0))||((p389==1)&&(p444==1)))"
Detected timeout of ITS tools.
[2021-05-14 04:15:31] [INFO ] Flatten gal took : 30 ms
[2021-05-14 04:15:31] [INFO ] Applying decomposition
[2021-05-14 04:15:31] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16690525553239273301.txt, -o, /tmp/graph16690525553239273301.bin, -w, /tmp/graph16690525553239273301.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16690525553239273301.bin, -l, -1, -v, -w, /tmp/graph16690525553239273301.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 04:15:31] [INFO ] Decomposing Gal with order
[2021-05-14 04:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:15:32] [INFO ] Removed a total of 579 redundant transitions.
[2021-05-14 04:15:32] [INFO ] Flatten gal took : 72 ms
[2021-05-14 04:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 569 labels/synchronizations in 16 ms.
[2021-05-14 04:15:32] [INFO ] Time to serialize gal into /tmp/LTL17915767418741936333.gal : 6 ms
[2021-05-14 04:15:32] [INFO ] Time to serialize properties into /tmp/LTL17400254227857981719.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17915767418741936333.gal, -t, CGAL, -LTL, /tmp/LTL17400254227857981719.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17915767418741936333.gal -t CGAL -LTL /tmp/LTL17400254227857981719.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(((i2.u8.p74==0)||(i2.u10.p101==0))||((i7.u37.p389==1)&&(i8.u42.p444==1)))"))))
Formula 0 simplified : !XF"(((i2.u8.p74==0)||(i2.u10.p101==0))||((i7.u37.p389==1)&&(i8.u42.p444==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1834564221509902210
[2021-05-14 04:15:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1834564221509902210
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1834564221509902210]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1834564221509902210] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1834564221509902210] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6A-09 finished in 44009 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 787
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 787
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 66 place count 401 transition count 765
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 398 transition count 790
Applied a total of 72 rules in 53 ms. Remains 398 /434 variables (removed 36) and now considering 790/835 (removed 45) transitions.
// Phase 1: matrix 790 rows 398 cols
[2021-05-14 04:15:48] [INFO ] Computed 58 place invariants in 11 ms
[2021-05-14 04:15:48] [INFO ] Implicit Places using invariants in 206 ms returned [380]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
[2021-05-14 04:15:48] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 790 rows 397 cols
[2021-05-14 04:15:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:48] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Starting structural reductions, iteration 1 : 397/434 places, 790/835 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 395 transition count 788
Applied a total of 4 rules in 33 ms. Remains 395 /397 variables (removed 2) and now considering 788/790 (removed 2) transitions.
// Phase 1: matrix 788 rows 395 cols
[2021-05-14 04:15:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:48] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 788 rows 395 cols
[2021-05-14 04:15:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:15:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-14 04:15:49] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 395/434 places, 788/835 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (NEQ s112 1) (NEQ s124 1)), p0:(AND (EQ s32 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 389 reset in 417 ms.
Product exploration explored 100000 steps with 384 reset in 587 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 373 reset in 401 ms.
Product exploration explored 100000 steps with 384 reset in 446 ms.
[2021-05-14 04:15:52] [INFO ] Flatten gal took : 31 ms
[2021-05-14 04:15:52] [INFO ] Flatten gal took : 31 ms
[2021-05-14 04:15:52] [INFO ] Time to serialize gal into /tmp/LTL9439321619435679971.gal : 3 ms
[2021-05-14 04:15:52] [INFO ] Time to serialize properties into /tmp/LTL7141005042882659952.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9439321619435679971.gal, -t, CGAL, -LTL, /tmp/LTL7141005042882659952.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9439321619435679971.gal -t CGAL -LTL /tmp/LTL7141005042882659952.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p145!=1)||(p162!=1))"))||("((p43==1)&&(p71==1))"))))
Formula 0 simplified : !F("((p43==1)&&(p71==1))" | G"((p145!=1)||(p162!=1))")
Detected timeout of ITS tools.
[2021-05-14 04:16:07] [INFO ] Flatten gal took : 32 ms
[2021-05-14 04:16:07] [INFO ] Applying decomposition
[2021-05-14 04:16:07] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3593102701433726643.txt, -o, /tmp/graph3593102701433726643.bin, -w, /tmp/graph3593102701433726643.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3593102701433726643.bin, -l, -1, -v, -w, /tmp/graph3593102701433726643.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 04:16:07] [INFO ] Decomposing Gal with order
[2021-05-14 04:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:16:07] [INFO ] Removed a total of 977 redundant transitions.
[2021-05-14 04:16:07] [INFO ] Flatten gal took : 63 ms
[2021-05-14 04:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 18 ms.
[2021-05-14 04:16:07] [INFO ] Time to serialize gal into /tmp/LTL382968358092908526.gal : 5 ms
[2021-05-14 04:16:07] [INFO ] Time to serialize properties into /tmp/LTL7450542169933062872.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL382968358092908526.gal, -t, CGAL, -LTL, /tmp/LTL7450542169933062872.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL382968358092908526.gal -t CGAL -LTL /tmp/LTL7450542169933062872.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.u17.p145!=1)||(i3.u19.p162!=1))"))||("((i1.u4.p43==1)&&(i1.u4.p71==1))"))))
Formula 0 simplified : !F("((i1.u4.p43==1)&&(i1.u4.p71==1))" | G"((i3.u17.p145!=1)||(i3.u19.p162!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2015715953667433842
[2021-05-14 04:16:22] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2015715953667433842
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2015715953667433842]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2015715953667433842] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2015715953667433842] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6A-10 finished in 35502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 793
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 793
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 64 place count 402 transition count 771
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 399 transition count 796
Applied a total of 70 rules in 28 ms. Remains 399 /434 variables (removed 35) and now considering 796/835 (removed 39) transitions.
[2021-05-14 04:16:23] [INFO ] Flow matrix only has 793 transitions (discarded 3 similar events)
// Phase 1: matrix 793 rows 399 cols
[2021-05-14 04:16:23] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:16:23] [INFO ] Implicit Places using invariants in 166 ms returned [381]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
[2021-05-14 04:16:23] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-14 04:16:23] [INFO ] Flow matrix only has 793 transitions (discarded 3 similar events)
// Phase 1: matrix 793 rows 398 cols
[2021-05-14 04:16:23] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:16:24] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Starting structural reductions, iteration 1 : 398/434 places, 796/835 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 396 transition count 794
Applied a total of 4 rules in 14 ms. Remains 396 /398 variables (removed 2) and now considering 794/796 (removed 2) transitions.
[2021-05-14 04:16:24] [INFO ] Flow matrix only has 791 transitions (discarded 3 similar events)
// Phase 1: matrix 791 rows 396 cols
[2021-05-14 04:16:24] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:16:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2021-05-14 04:16:24] [INFO ] Flow matrix only has 791 transitions (discarded 3 similar events)
// Phase 1: matrix 791 rows 396 cols
[2021-05-14 04:16:24] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:16:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-14 04:16:25] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 396/434 places, 794/835 transitions.
Stuttering acceptance computed with spot in 5371 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-13 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (NEQ s1 1) (NEQ s12 1)), p1:(OR (EQ s300 0) (EQ s313 0)), p0:(AND (EQ s247 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16111 steps with 43 reset in 65 ms.
FORMULA NoC3x3-PT-6A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-13 finished in 7000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 789
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 789
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 62 place count 403 transition count 768
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 400 transition count 793
Applied a total of 68 rules in 24 ms. Remains 400 /434 variables (removed 34) and now considering 793/835 (removed 42) transitions.
// Phase 1: matrix 793 rows 400 cols
[2021-05-14 04:16:30] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 04:16:30] [INFO ] Implicit Places using invariants in 165 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
[2021-05-14 04:16:30] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 793 rows 399 cols
[2021-05-14 04:16:30] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 04:16:31] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []
Starting structural reductions, iteration 1 : 399/434 places, 793/835 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 397 transition count 791
Applied a total of 4 rules in 14 ms. Remains 397 /399 variables (removed 2) and now considering 791/793 (removed 2) transitions.
// Phase 1: matrix 791 rows 397 cols
[2021-05-14 04:16:31] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 04:16:31] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 791 rows 397 cols
[2021-05-14 04:16:31] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:16:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-14 04:16:32] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 397/434 places, 791/835 transitions.
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-14 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s51 1)), p1:(OR (NEQ s10 1) (NEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 337 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-14 finished in 1567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 835/835 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 834
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 421 transition count 786
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 421 transition count 786
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 71 place count 397 transition count 762
Applied a total of 71 rules in 22 ms. Remains 397 /434 variables (removed 37) and now considering 762/835 (removed 73) transitions.
// Phase 1: matrix 762 rows 397 cols
[2021-05-14 04:16:32] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 04:16:32] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 762 rows 397 cols
[2021-05-14 04:16:32] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 04:16:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-14 04:16:32] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2021-05-14 04:16:32] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 762 rows 397 cols
[2021-05-14 04:16:32] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 04:16:33] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 397/434 places, 762/835 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 302 reset in 355 ms.
Product exploration explored 100000 steps with 303 reset in 396 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 307 reset in 370 ms.
Product exploration explored 100000 steps with 308 reset in 414 ms.
[2021-05-14 04:16:34] [INFO ] Flatten gal took : 25 ms
[2021-05-14 04:16:34] [INFO ] Flatten gal took : 24 ms
[2021-05-14 04:16:34] [INFO ] Time to serialize gal into /tmp/LTL13370364396791680464.gal : 3 ms
[2021-05-14 04:16:34] [INFO ] Time to serialize properties into /tmp/LTL156574108969552913.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13370364396791680464.gal, -t, CGAL, -LTL, /tmp/LTL156574108969552913.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13370364396791680464.gal -t CGAL -LTL /tmp/LTL156574108969552913.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p252!=1)"))))
Formula 0 simplified : !GF"(p252!=1)"
Detected timeout of ITS tools.
[2021-05-14 04:16:50] [INFO ] Flatten gal took : 25 ms
[2021-05-14 04:16:50] [INFO ] Applying decomposition
[2021-05-14 04:16:50] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13564791046291575249.txt, -o, /tmp/graph13564791046291575249.bin, -w, /tmp/graph13564791046291575249.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13564791046291575249.bin, -l, -1, -v, -w, /tmp/graph13564791046291575249.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 04:16:50] [INFO ] Decomposing Gal with order
[2021-05-14 04:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:16:50] [INFO ] Removed a total of 592 redundant transitions.
[2021-05-14 04:16:50] [INFO ] Flatten gal took : 65 ms
[2021-05-14 04:16:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 7 ms.
[2021-05-14 04:16:50] [INFO ] Time to serialize gal into /tmp/LTL16640002223805133033.gal : 4 ms
[2021-05-14 04:16:50] [INFO ] Time to serialize properties into /tmp/LTL10786797625578852396.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16640002223805133033.gal, -t, CGAL, -LTL, /tmp/LTL10786797625578852396.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16640002223805133033.gal -t CGAL -LTL /tmp/LTL10786797625578852396.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(i5.u25.p252!=1)"))))
Formula 0 simplified : !GF"(i5.u25.p252!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11918154267504759944
[2021-05-14 04:17:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11918154267504759944
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11918154267504759944]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11918154267504759944] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11918154267504759944] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6A-15 finished in 34060 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7845473169510007344
[2021-05-14 04:17:06] [INFO ] Computing symmetric may disable matrix : 835 transitions.
[2021-05-14 04:17:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 04:17:06] [INFO ] Applying decomposition
[2021-05-14 04:17:06] [INFO ] Computing symmetric may enable matrix : 835 transitions.
[2021-05-14 04:17:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 04:17:06] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11380272943837911581.txt, -o, /tmp/graph11380272943837911581.bin, -w, /tmp/graph11380272943837911581.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11380272943837911581.bin, -l, -1, -v, -w, /tmp/graph11380272943837911581.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 04:17:06] [INFO ] Decomposing Gal with order
[2021-05-14 04:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:17:06] [INFO ] Computing Do-Not-Accords matrix : 835 transitions.
[2021-05-14 04:17:06] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 04:17:06] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7845473169510007344
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7845473169510007344]
[2021-05-14 04:17:06] [INFO ] Removed a total of 598 redundant transitions.
[2021-05-14 04:17:06] [INFO ] Flatten gal took : 106 ms
[2021-05-14 04:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 13 ms.
[2021-05-14 04:17:06] [INFO ] Time to serialize gal into /tmp/LTLFireability3342065637511767850.gal : 4 ms
[2021-05-14 04:17:06] [INFO ] Time to serialize properties into /tmp/LTLFireability2499843652429086787.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3342065637511767850.gal, -t, CGAL, -LTL, /tmp/LTLFireability2499843652429086787.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3342065637511767850.gal -t CGAL -LTL /tmp/LTLFireability2499843652429086787.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(("((i8.u46.p487==0)||(i8.u49.p511==0))")||(X((G(("((i6.u35.p377==1)&&(i6.u36.p396==1))")&&(X(("((i1.u8.p38==1)&&(i1.u8.p86==1))")&&(X(G("((i1.u8.p38==1)&&(i1.u8.p86==1))")))))))U(("((i8.u46.p487==0)||(i8.u49.p511==0))")&&(G(("((i6.u35.p377==1)&&(i6.u36.p396==1))")&&(X(("((i1.u8.p38==1)&&(i1.u8.p86==1))")&&(X(G("((i1.u8.p38==1)&&(i1.u8.p86==1))")))))))))))))
Formula 0 simplified : !X("((i8.u46.p487==0)||(i8.u49.p511==0))" | X(G("((i6.u35.p377==1)&&(i6.u36.p396==1))" & X("((i1.u8.p38==1)&&(i1.u8.p86==1))" & XG"((i1.u8.p38==1)&&(i1.u8.p86==1))")) U ("((i8.u46.p487==0)||(i8.u49.p511==0))" & G("((i6.u35.p377==1)&&(i6.u36.p396==1))" & X("((i1.u8.p38==1)&&(i1.u8.p86==1))" & XG"((i1.u8.p38==1)&&(i1.u8.p86==1))")))))
Compilation finished in 16104 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7845473169510007344]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(([]((X((X([]((LTLAPp3==true)))&&(LTLAPp2==true)))&&(LTLAPp1==true))) U ((LTLAPp4==true)&&[]((X((X([]((LTLAPp3==true)))&&(LTLAPp6==true)))&&(LTLAPp5==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
LTSmin run took 550 ms.
FORMULA NoC3x3-PT-6A-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp7==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
LTSmin run took 409 ms.
FORMULA NoC3x3-PT-6A-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp8==true)||[]((LTLAPp9==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
LTSmin run took 3773 ms.
FORMULA NoC3x3-PT-6A-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp10==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp10==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp10==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]
Detected timeout of ITS tools.
[2021-05-14 04:38:09] [INFO ] Applying decomposition
[2021-05-14 04:38:09] [INFO ] Flatten gal took : 80 ms
[2021-05-14 04:38:09] [INFO ] Decomposing Gal with order
[2021-05-14 04:38:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 04:38:09] [INFO ] Removed a total of 812 redundant transitions.
[2021-05-14 04:38:09] [INFO ] Flatten gal took : 157 ms
[2021-05-14 04:38:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 409 labels/synchronizations in 11 ms.
[2021-05-14 04:38:09] [INFO ] Time to serialize gal into /tmp/LTLFireability1473133932563765898.gal : 3 ms
[2021-05-14 04:38:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17821566955649530876.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1473133932563765898.gal, -t, CGAL, -LTL, /tmp/LTLFireability17821566955649530876.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1473133932563765898.gal -t CGAL -LTL /tmp/LTLFireability17821566955649530876.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(u35.p252!=1)"))))
Formula 0 simplified : !GF"(u35.p252!=1)"
Detected timeout of ITS tools.
[2021-05-14 04:59:12] [INFO ] Flatten gal took : 76 ms
[2021-05-14 04:59:12] [INFO ] Input system was already deterministic with 835 transitions.
[2021-05-14 04:59:12] [INFO ] Transformed 434 places.
[2021-05-14 04:59:12] [INFO ] Transformed 835 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 04:59:12] [INFO ] Time to serialize gal into /tmp/LTLFireability7773926985816807172.gal : 3 ms
[2021-05-14 04:59:12] [INFO ] Time to serialize properties into /tmp/LTLFireability15925741652376257534.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7773926985816807172.gal, -t, CGAL, -LTL, /tmp/LTLFireability15925741652376257534.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7773926985816807172.gal -t CGAL -LTL /tmp/LTLFireability15925741652376257534.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p252!=1)"))))
Formula 0 simplified : !GF"(p252!=1)"
WARNING : LTSmin timed out (>2400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp10==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7845473169510007344]

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-6A"
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 NoC3x3-PT-6A, 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 r140-tall-162089127600309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6A.tgz
mv NoC3x3-PT-6A 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 ;