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-162089128100557.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 Peterson-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-00
FORMULA_NAME Peterson-COL-2-01
FORMULA_NAME Peterson-COL-2-02
FORMULA_NAME Peterson-COL-2-03
FORMULA_NAME Peterson-COL-2-04
FORMULA_NAME Peterson-COL-2-05
FORMULA_NAME Peterson-COL-2-06
FORMULA_NAME Peterson-COL-2-07
FORMULA_NAME Peterson-COL-2-08
FORMULA_NAME Peterson-COL-2-09
FORMULA_NAME Peterson-COL-2-10
FORMULA_NAME Peterson-COL-2-11
FORMULA_NAME Peterson-COL-2-12
FORMULA_NAME Peterson-COL-2-13
FORMULA_NAME Peterson-COL-2-14
FORMULA_NAME Peterson-COL-2-15

=== Now, execution of the tool begins

BK_START 1621007356154

Running Version 0
[2021-05-14 15:49:18] [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 15:49:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:49:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 15:49:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:49:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 553 ms
[2021-05-14 15:49:18] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 15:49:18] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 15:49:18] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6449439748453754132.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-14 15:49:18] [INFO ] Flatten gal took : 25 ms
[2021-05-14 15:49:18] [INFO ] Flatten gal took : 2 ms
[2021-05-14 15:49:18] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 10 ms.
[2021-05-14 15:49:18] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10380765130478281907.dot
[2021-05-14 15:49:18] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:18] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:18] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-14 15:49:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2021-05-14 15:49:18] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:18] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 15:49:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:49:19] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2021-05-14 15:49:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:19] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 15:49:19] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
[2021-05-14 15:49:19] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-14 15:49:19] [INFO ] Flatten gal took : 19 ms
FORMULA Peterson-COL-2-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:49:19] [INFO ] Flatten gal took : 16 ms
[2021-05-14 15:49:19] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=264 ) properties (out of 16) seen :15
Running SMT prover for 1 properties.
[2021-05-14 15:49:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:19] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 15:49:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:49:19] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 15:49:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:49:19] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:49:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:19] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:19] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 15:49:19] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:49:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
[2021-05-14 15:49:19] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2021-05-14 15:49:19] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2021-05-14 15:49:19] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:49:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 150 ms
[2021-05-14 15:49:19] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 10 ms.
[2021-05-14 15:49:20] [INFO ] Added : 61 causal constraints over 13 iterations in 154 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:20] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 15:49:20] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:20] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s45 1) (GEQ s47 1) (GEQ s43 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, null][false, false, false]]
Product exploration explored 100000 steps with 2672 reset in 227 ms.
Stack based approach found an accepted trace after 289 steps with 7 reset with depth 28 and stack size 28 in 1 ms.
FORMULA Peterson-COL-2-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-00 finished in 624 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p1 U p2)))||X(X(X(G(p3))))))], workingDir=/home/mcc/execution]
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:20] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:20] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:20] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:20] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:20] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Peterson-COL-2-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=8 dest: 3}]], initial=6, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s80 1)) (AND (GEQ s4 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s78 1)) (AND (GEQ s4 1) (GEQ s70 1)) (AND (GEQ s2 1) (GEQ s71 1)) (AND (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s4 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s73 1)) (AND (GEQ s2 1) (GEQ s69 1)) (AND (GEQ s0 1) (GEQ s75 1)) (AND (GEQ s0 1) (GEQ s77 1)) (AND (GEQ s0 1) (GEQ s79 1))), p1:(OR (AND (GEQ s3 1) (GEQ s69 1)) (AND (GEQ s3 1) (GEQ s78 1)) (AND (GEQ s5 1) (GEQ s72 1)) (AND (GEQ s5 1) (GEQ s70 1)) (AND (GEQ s1 1) (GEQ s79 1)) (AND (GEQ s3 1) (GEQ s80 1)) (AND (GEQ s1 1) (GEQ s77 1)) (AND (GEQ s3 1) (GEQ s71 1)) (AND (GEQ s1 1) (GEQ s75 1)) (AND (GEQ s1 1) (GEQ s73 1)) (AND (GEQ s5 1) (GEQ s76 1)) (AND (GEQ s5 1) (GEQ s74 1))), p0:(OR (GEQ s61 1) (GEQ s65 1) (GEQ s68 1) (GEQ s51 1) (GEQ s54 1) (GEQ s58 1)), p3:(OR (GEQ s62 1) (GEQ s64 1) (GEQ s63 1) (GEQ s66 1) (GEQ s52 1) (GEQ s67 1) (GEQ s53 1) (GEQ s56 1) (GEQ s55 1) (GEQ s57 1) (GEQ s60 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 237 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA Peterson-COL-2-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-01 finished in 692 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0||G(p1)) U (G(F(p3))||p2)))], workingDir=/home/mcc/execution]
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 70 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 56 transition count 80
Applied a total of 92 rules in 20 ms. Remains 56 /102 variables (removed 46) and now considering 80/126 (removed 46) transitions.
[2021-05-14 15:49:21] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 56 cols
[2021-05-14 15:49:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:21] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
[2021-05-14 15:49:21] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 15:49:21] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 53 cols
[2021-05-14 15:49:21] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 53/102 places, 80/126 transitions.
Applied a total of 0 rules in 8 ms. Remains 53 /53 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2021-05-14 15:49:21] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 15:49:21] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 53 cols
[2021-05-14 15:49:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/102 places, 80/126 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Peterson-COL-2-04 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s9 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s12 1)) (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s6 1) (GEQ s12 1)) (AND (GEQ s8 1) (GEQ s14 1)) (AND (GEQ s6 1) (GEQ s13 1)) (AND (GEQ s6 1) (GEQ s14 1)) (AND (GEQ s10 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s13 1)) (AND (GEQ s10 1) (GEQ s14 1)) (AND (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s16 1)) (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s15 1)) (AND (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s16 1))), p0:(OR (GEQ s33 1) (GEQ s35 1) (GEQ s31 1)), p1:(AND (OR (LT s9 1) (LT s15 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s8 1) (LT s12 1)) (OR (LT s8 1) (LT s13 1)) (OR (LT s6 1) (LT s12 1)) (OR (LT s8 1) (LT s14 1)) (OR (LT s6 1) (LT s13 1)) (OR (LT s6 1) (LT s14 1)) (OR (LT s10 1) (LT s12 1)) (OR (LT s10 1) (LT s13 1)) (OR (LT s10 1) (LT s14 1)) (OR (LT s11 1) (LT s17 1)) (OR (LT s11 1) (LT s15 1)) (OR (LT s11 1) (LT s16 1)) (OR (LT s7 1) (LT s17 1)) (OR (LT s7 1) (LT s15 1)) (OR (LT s9 1) (LT s17 1)) (OR (LT s7 1) (LT s16 1))), p3:(OR (GEQ s44 1) (GEQ s46 1) (GEQ s49 1) (GEQ s52 1) (GEQ s40 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Product exploration explored 100000 steps with 50000 reset in 398 ms.
Knowledge obtained : [(NOT p2), (NOT p0), p1, (NOT p3)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Product exploration explored 100000 steps with 50000 reset in 393 ms.
[2021-05-14 15:49:23] [INFO ] Flatten gal took : 6 ms
[2021-05-14 15:49:23] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:49:23] [INFO ] Time to serialize gal into /tmp/LTL1501655388519129859.gal : 2 ms
[2021-05-14 15:49:23] [INFO ] Time to serialize properties into /tmp/LTL7178633804400757295.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/LTL1501655388519129859.gal, -t, CGAL, -LTL, /tmp/LTL7178633804400757295.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/LTL1501655388519129859.gal -t CGAL -LTL /tmp/LTL7178633804400757295.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((((((AskForSection_3<1)||(Turn_3<1))&&((AskForSection_3<1)||(Turn_4<1)))&&((AskForSection_2<1)||(Turn_0<1)))&&((AskForSection_2<1)||(Turn_1<1)))&&((AskForSection_0<1)||(Turn_0<1)))&&((AskForSection_2<1)||(Turn_2<1)))&&((AskForSection_0<1)||(Turn_1<1)))&&((AskForSection_0<1)||(Turn_2<1)))&&((AskForSection_4<1)||(Turn_0<1)))&&((AskForSection_4<1)||(Turn_1<1)))&&((AskForSection_4<1)||(Turn_2<1)))&&((AskForSection_5<1)||(Turn_5<1)))&&((AskForSection_5<1)||(Turn_3<1)))&&((AskForSection_5<1)||(Turn_4<1)))&&((AskForSection_1<1)||(Turn_5<1)))&&((AskForSection_1<1)||(Turn_3<1)))&&((AskForSection_3<1)||(Turn_5<1)))&&((AskForSection_1<1)||(Turn_4<1)))"))||("(((EndTurn_3<1)&&(EndTurn_5<1))&&(EndTurn_1<1))"))U(((((((((((((((((((G(F("((((((IsEndLoop_8>=1)||(IsEndLoop_11>=1))||(IsEndLoop_14>=1))||(IsEndLoop_17>=1))||(IsEndLoop_2>=1))||(IsEndLoop_5>=1))")))||("((AskForSection_3>=1)&&(Turn_3>=1))"))||("((AskForSection_3>=1)&&(Turn_4>=1))"))||("((AskForSection_2>=1)&&(Turn_0>=1))"))||("((AskForSection_2>=1)&&(Turn_1>=1))"))||("((AskForSection_0>=1)&&(Turn_0>=1))"))||("((AskForSection_2>=1)&&(Turn_2>=1))"))||("((AskForSection_0>=1)&&(Turn_1>=1))"))||("((AskForSection_0>=1)&&(Turn_2>=1))"))||("((AskForSection_4>=1)&&(Turn_0>=1))"))||("((AskForSection_4>=1)&&(Turn_1>=1))"))||("((AskForSection_4>=1)&&(Turn_2>=1))"))||("((AskForSection_5>=1)&&(Turn_5>=1))"))||("((AskForSection_5>=1)&&(Turn_3>=1))"))||("((AskForSection_5>=1)&&(Turn_4>=1))"))||("((AskForSection_1>=1)&&(Turn_5>=1))"))||("((AskForSection_1>=1)&&(Turn_3>=1))"))||("((AskForSection_3>=1)&&(Turn_5>=1))"))||("((AskForSection_1>=1)&&(Turn_4>=1))"))))
Formula 0 simplified : !(("(((EndTurn_3<1)&&(EndTurn_5<1))&&(EndTurn_1<1))" | G"(((((((((((((((((((AskForSection_3<1)||(Turn_3<1))&&((AskForSection_3<1)||(Turn_4<1)))&&((AskForSection_2<1)||(Turn_0<1)))&&((AskForSection_2<1)||(Turn_1<1)))&&((AskForSection_0<1)||(Turn_0<1)))&&((AskForSection_2<1)||(Turn_2<1)))&&((AskForSection_0<1)||(Turn_1<1)))&&((AskForSection_0<1)||(Turn_2<1)))&&((AskForSection_4<1)||(Turn_0<1)))&&((AskForSection_4<1)||(Turn_1<1)))&&((AskForSection_4<1)||(Turn_2<1)))&&((AskForSection_5<1)||(Turn_5<1)))&&((AskForSection_5<1)||(Turn_3<1)))&&((AskForSection_5<1)||(Turn_4<1)))&&((AskForSection_1<1)||(Turn_5<1)))&&((AskForSection_1<1)||(Turn_3<1)))&&((AskForSection_3<1)||(Turn_5<1)))&&((AskForSection_1<1)||(Turn_4<1)))") U ("((AskForSection_0>=1)&&(Turn_0>=1))" | "((AskForSection_0>=1)&&(Turn_1>=1))" | "((AskForSection_0>=1)&&(Turn_2>=1))" | "((AskForSection_1>=1)&&(Turn_3>=1))" | "((AskForSection_1>=1)&&(Turn_4>=1))" | "((AskForSection_1>=1)&&(Turn_5>=1))" | "((AskForSection_2>=1)&&(Turn_0>=1))" | "((AskForSection_2>=1)&&(Turn_1>=1))" | "((AskForSection_2>=1)&&(Turn_2>=1))" | "((AskForSection_3>=1)&&(Turn_3>=1))" | "((AskForSection_3>=1)&&(Turn_4>=1))" | "((AskForSection_3>=1)&&(Turn_5>=1))" | "((AskForSection_4>=1)&&(Turn_0>=1))" | "((AskForSection_4>=1)&&(Turn_1>=1))" | "((AskForSection_4>=1)&&(Turn_2>=1))" | "((AskForSection_5>=1)&&(Turn_3>=1))" | "((AskForSection_5>=1)&&(Turn_4>=1))" | "((AskForSection_5>=1)&&(Turn_5>=1))" | GF"((((((IsEndLoop_8>=1)||(IsEndLoop_11>=1))||(IsEndLoop_14>=1))||(IsEndLoop_17>=1))||(IsEndLoop_2>=1))||(IsEndLoop_5>=1))"))
Detected timeout of ITS tools.
[2021-05-14 15:49:38] [INFO ] Flatten gal took : 10 ms
[2021-05-14 15:49:38] [INFO ] Applying decomposition
[2021-05-14 15:49:38] [INFO ] Flatten gal took : 5 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/graph1465468303610124333.txt, -o, /tmp/graph1465468303610124333.bin, -w, /tmp/graph1465468303610124333.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/graph1465468303610124333.bin, -l, -1, -v, -w, /tmp/graph1465468303610124333.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:49:38] [INFO ] Decomposing Gal with order
[2021-05-14 15:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:49:38] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-14 15:49:38] [INFO ] Flatten gal took : 35 ms
[2021-05-14 15:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 15:49:38] [INFO ] Time to serialize gal into /tmp/LTL1817576395600080206.gal : 8 ms
[2021-05-14 15:49:38] [INFO ] Time to serialize properties into /tmp/LTL1675860241212850328.ltl : 3 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/LTL1817576395600080206.gal, -t, CGAL, -LTL, /tmp/LTL1675860241212850328.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/LTL1817576395600080206.gal -t CGAL -LTL /tmp/LTL1675860241212850328.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((((((i3.u8.AskForSection_3<1)||(i2.u7.Turn_3<1))&&((i3.u8.AskForSection_3<1)||(i3.u8.Turn_4<1)))&&((i1.u4.AskForSection_2<1)||(i0.u3.Turn_0<1)))&&((i1.u4.AskForSection_2<1)||(i1.u4.Turn_1<1)))&&((i0.u3.AskForSection_0<1)||(i0.u3.Turn_0<1)))&&((i1.u4.AskForSection_2<1)||(i4.u5.Turn_2<1)))&&((i0.u3.AskForSection_0<1)||(i1.u4.Turn_1<1)))&&((i0.u3.AskForSection_0<1)||(i4.u5.Turn_2<1)))&&((i4.u5.AskForSection_4<1)||(i0.u3.Turn_0<1)))&&((i4.u5.AskForSection_4<1)||(i1.u4.Turn_1<1)))&&((i4.u5.AskForSection_4<1)||(i4.u5.Turn_2<1)))&&((i5.u6.AskForSection_5<1)||(i5.u6.Turn_5<1)))&&((i5.u6.AskForSection_5<1)||(i2.u7.Turn_3<1)))&&((i5.u6.AskForSection_5<1)||(i3.u8.Turn_4<1)))&&((i2.u7.AskForSection_1<1)||(i5.u6.Turn_5<1)))&&((i2.u7.AskForSection_1<1)||(i2.u7.Turn_3<1)))&&((i3.u8.AskForSection_3<1)||(i5.u6.Turn_5<1)))&&((i2.u7.AskForSection_1<1)||(i3.u8.Turn_4<1)))"))||("(((i3.u11.EndTurn_3<1)&&(i5.u12.EndTurn_5<1))&&(i2.u10.EndTurn_1<1))"))U(((((((((((((((((((G(F("((((((i1.u13.IsEndLoop_8>=1)||(i3.u11.IsEndLoop_11>=1))||(i4.u14.IsEndLoop_14>=1))||(i5.u15.IsEndLoop_17>=1))||(i0.u9.IsEndLoop_2>=1))||(i2.u10.IsEndLoop_5>=1))")))||("((i3.u8.AskForSection_3>=1)&&(i2.u7.Turn_3>=1))"))||("((i3.u8.AskForSection_3>=1)&&(i3.u8.Turn_4>=1))"))||("((i1.u4.AskForSection_2>=1)&&(i0.u3.Turn_0>=1))"))||("((i1.u4.AskForSection_2>=1)&&(i1.u4.Turn_1>=1))"))||("((i0.u3.AskForSection_0>=1)&&(i0.u3.Turn_0>=1))"))||("((i1.u4.AskForSection_2>=1)&&(i4.u5.Turn_2>=1))"))||("((i0.u3.AskForSection_0>=1)&&(i1.u4.Turn_1>=1))"))||("((i0.u3.AskForSection_0>=1)&&(i4.u5.Turn_2>=1))"))||("((i4.u5.AskForSection_4>=1)&&(i0.u3.Turn_0>=1))"))||("((i4.u5.AskForSection_4>=1)&&(i1.u4.Turn_1>=1))"))||("((i4.u5.AskForSection_4>=1)&&(i4.u5.Turn_2>=1))"))||("((i5.u6.AskForSection_5>=1)&&(i5.u6.Turn_5>=1))"))||("((i5.u6.AskForSection_5>=1)&&(i2.u7.Turn_3>=1))"))||("((i5.u6.AskForSection_5>=1)&&(i3.u8.Turn_4>=1))"))||("((i2.u7.AskForSection_1>=1)&&(i5.u6.Turn_5>=1))"))||("((i2.u7.AskForSection_1>=1)&&(i2.u7.Turn_3>=1))"))||("((i3.u8.AskForSection_3>=1)&&(i5.u6.Turn_5>=1))"))||("((i2.u7.AskForSection_1>=1)&&(i3.u8.Turn_4>=1))"))))
Formula 0 simplified : !(("(((i3.u11.EndTurn_3<1)&&(i5.u12.EndTurn_5<1))&&(i2.u10.EndTurn_1<1))" | G"(((((((((((((((((((i3.u8.AskForSection_3<1)||(i2.u7.Turn_3<1))&&((i3.u8.AskForSection_3<1)||(i3.u8.Turn_4<1)))&&((i1.u4.AskForSection_2<1)||(i0.u3.Turn_0<1)))&&((i1.u4.AskForSection_2<1)||(i1.u4.Turn_1<1)))&&((i0.u3.AskForSection_0<1)||(i0.u3.Turn_0<1)))&&((i1.u4.AskForSection_2<1)||(i4.u5.Turn_2<1)))&&((i0.u3.AskForSection_0<1)||(i1.u4.Turn_1<1)))&&((i0.u3.AskForSection_0<1)||(i4.u5.Turn_2<1)))&&((i4.u5.AskForSection_4<1)||(i0.u3.Turn_0<1)))&&((i4.u5.AskForSection_4<1)||(i1.u4.Turn_1<1)))&&((i4.u5.AskForSection_4<1)||(i4.u5.Turn_2<1)))&&((i5.u6.AskForSection_5<1)||(i5.u6.Turn_5<1)))&&((i5.u6.AskForSection_5<1)||(i2.u7.Turn_3<1)))&&((i5.u6.AskForSection_5<1)||(i3.u8.Turn_4<1)))&&((i2.u7.AskForSection_1<1)||(i5.u6.Turn_5<1)))&&((i2.u7.AskForSection_1<1)||(i2.u7.Turn_3<1)))&&((i3.u8.AskForSection_3<1)||(i5.u6.Turn_5<1)))&&((i2.u7.AskForSection_1<1)||(i3.u8.Turn_4<1)))") U ("((i0.u3.AskForSection_0>=1)&&(i0.u3.Turn_0>=1))" | "((i0.u3.AskForSection_0>=1)&&(i1.u4.Turn_1>=1))" | "((i0.u3.AskForSection_0>=1)&&(i4.u5.Turn_2>=1))" | "((i1.u4.AskForSection_2>=1)&&(i0.u3.Turn_0>=1))" | "((i1.u4.AskForSection_2>=1)&&(i1.u4.Turn_1>=1))" | "((i1.u4.AskForSection_2>=1)&&(i4.u5.Turn_2>=1))" | "((i2.u7.AskForSection_1>=1)&&(i2.u7.Turn_3>=1))" | "((i2.u7.AskForSection_1>=1)&&(i3.u8.Turn_4>=1))" | "((i2.u7.AskForSection_1>=1)&&(i5.u6.Turn_5>=1))" | "((i3.u8.AskForSection_3>=1)&&(i2.u7.Turn_3>=1))" | "((i3.u8.AskForSection_3>=1)&&(i3.u8.Turn_4>=1))" | "((i3.u8.AskForSection_3>=1)&&(i5.u6.Turn_5>=1))" | "((i4.u5.AskForSection_4>=1)&&(i0.u3.Turn_0>=1))" | "((i4.u5.AskForSection_4>=1)&&(i1.u4.Turn_1>=1))" | "((i4.u5.AskForSection_4>=1)&&(i4.u5.Turn_2>=1))" | "((i5.u6.AskForSection_5>=1)&&(i2.u7.Turn_3>=1))" | "((i5.u6.AskForSection_5>=1)&&(i3.u8.Turn_4>=1))" | "((i5.u6.AskForSection_5>=1)&&(i5.u6.Turn_5>=1))" | GF"((((((i1.u13.IsEndLoop_8>=1)||(i3.u11.IsEndLoop_11>=1))||(i4.u14.IsEndLoop_14>=1))||(i5.u15.IsEndLoop_17>=1))||(i0.u9.IsEndLoop_2>=1))||(i2.u10.IsEndLoop_5>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15119573299500152727
[2021-05-14 15:49:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15119573299500152727
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/ltsmin15119573299500152727]
Compilation finished in 424 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15119573299500152727]
Link finished in 42 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, (([]((LTLAPp0==true))||(LTLAPp1==true)) U ([](<>((LTLAPp3==true)))||(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15119573299500152727]
LTSmin run took 528 ms.
FORMULA Peterson-COL-2-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-2-04 finished in 33558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:55] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:49:55] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Starting structural reductions, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s46 1) (GEQ s42 1) (GEQ s44 1) (AND (GEQ s12 1) (GEQ s22 1)) (AND (GEQ s13 1) (GEQ s18 1)) (AND (GEQ s14 1) (GEQ s18 1)) (AND (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s22 1)) (AND (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s15 1) (GEQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-05 finished in 355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 96 transition count 120
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 96 transition count 106
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 78 transition count 102
Applied a total of 48 rules in 10 ms. Remains 78 /102 variables (removed 24) and now considering 102/126 (removed 24) transitions.
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 78 cols
[2021-05-14 15:49:55] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:55] [INFO ] Implicit Places using invariants in 39 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
[2021-05-14 15:49:55] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 75 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 75/102 places, 102/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-14 15:49:55] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 75 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/102 places, 102/126 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-2-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s48 1) (GEQ s50 1) (GEQ s49 1) (GEQ s52 1) (GEQ s38 1) (GEQ s53 1) (GEQ s39 1) (GEQ s42 1) (GEQ s41 1) (GEQ s43 1) (GEQ s46 1) (GEQ s45 1)), p1:(OR (GEQ s47 1) (GEQ s51 1) (GEQ s54 1) (GEQ s37 1) (GEQ s40 1) (GEQ s44 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 121 steps with 0 reset with depth 122 and stack size 122 in 1 ms.
FORMULA Peterson-COL-2-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-06 finished in 492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 100 transition count 106
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 82 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 76 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 72 transition count 96
Applied a total of 60 rules in 8 ms. Remains 72 /102 variables (removed 30) and now considering 96/126 (removed 30) transitions.
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 72 cols
[2021-05-14 15:49:55] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:55] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
[2021-05-14 15:49:55] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 69 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 69/102 places, 96/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2021-05-14 15:49:55] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 15:49:55] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 69 cols
[2021-05-14 15:49:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/102 places, 96/126 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-2-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s18 1)) (AND (GEQ s12 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s19 1))), p1:(OR (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s18 1)) (AND (GEQ s12 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s19 1)) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GEQ s37 1) (GEQ s36 1) (GEQ s38 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7 reset in 172 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 64 in 0 ms.
FORMULA Peterson-COL-2-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-07 finished in 386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0))) U (X(F(!p2))&&p1)))], workingDir=/home/mcc/execution]
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:49:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:56] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:49:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:49:56] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0), true]
Running random walk in product with property : Peterson-COL-2-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s1 1) (LT s5 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s2 1) (LT s7 1))), p2:(OR (GEQ s48 1) (GEQ s50 1) (GEQ s46 1)), p0:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-08 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:49:56] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:56] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:56] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 15:49:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 15:49:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:49:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s46 1) (LT s42 1) (LT s44 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 129 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 99/99 places, 126/126 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 99 transition count 126
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 21 place count 99 transition count 126
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 99 transition count 126
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 61 place count 77 transition count 104
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 83 place count 77 transition count 104
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 98 place count 77 transition count 104
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 111 place count 64 transition count 91
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 124 place count 64 transition count 91
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 124 rules in 11 ms. Remains 64 /99 variables (removed 35) and now considering 91/126 (removed 35) transitions.
[2021-05-14 15:49:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 15:49:57] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
// Phase 1: matrix 85 rows 64 cols
[2021-05-14 15:49:57] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/99 places, 91/126 transitions.
Product exploration explored 100000 steps with 50000 reset in 532 ms.
Product exploration explored 100000 steps with 50000 reset in 428 ms.
[2021-05-14 15:49:58] [INFO ] Flatten gal took : 8 ms
[2021-05-14 15:49:58] [INFO ] Flatten gal took : 8 ms
[2021-05-14 15:49:58] [INFO ] Time to serialize gal into /tmp/LTL6146753529379489280.gal : 4 ms
[2021-05-14 15:49:58] [INFO ] Time to serialize properties into /tmp/LTL6261047691313040947.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/LTL6146753529379489280.gal, -t, CGAL, -LTL, /tmp/LTL6261047691313040947.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/LTL6146753529379489280.gal -t CGAL -LTL /tmp/LTL6261047691313040947.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((EndTurn_4<1)&&(EndTurn_0<1))&&(EndTurn_2<1))"))))
Formula 0 simplified : !XF"(((EndTurn_4<1)&&(EndTurn_0<1))&&(EndTurn_2<1))"
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, t47, t99, t100, t101, t105, t106, t107, t120, t121, t122, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/30/126
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
88 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.90274,47112,1,0,255,130406,278,129,3045,122729,265
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Peterson-COL-2-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Peterson-COL-2-10 finished in 3051 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 102 transition count 106
Reduce places removed 20 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 82 transition count 101
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 77 transition count 101
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 50 place count 77 transition count 86
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 80 place count 62 transition count 86
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 3 with 4 rules applied. Total rules applied 84 place count 60 transition count 84
Applied a total of 84 rules in 9 ms. Remains 60 /102 variables (removed 42) and now considering 84/126 (removed 42) transitions.
[2021-05-14 15:49:59] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 60 cols
[2021-05-14 15:49:59] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-14 15:49:59] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 60 cols
[2021-05-14 15:49:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:49:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:49:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-14 15:49:59] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 15:49:59] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 60 cols
[2021-05-14 15:49:59] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:49:59] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/102 places, 84/126 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-2-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (GEQ s33 1) (GEQ s35 1) (GEQ s31 1)) (OR (GEQ s42 1) (GEQ s43 1) (GEQ s44 1) (GEQ s39 1) (GEQ s40 1) (GEQ s41 1))), p0:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3157 reset in 144 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Peterson-COL-2-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-11 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 72 place count 66 transition count 75
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 7 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
[2021-05-14 15:49:59] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2021-05-14 15:50:00] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:50:00] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 42 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 42/102 places, 69/126 transitions.
Applied a total of 0 rules in 10 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 42 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/102 places, 69/126 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-2-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s15 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s8 1) (LT s12 1)) (OR (LT s8 1) (LT s13 1)) (OR (LT s6 1) (LT s12 1)) (OR (LT s8 1) (LT s14 1)) (OR (LT s6 1) (LT s13 1)) (OR (LT s6 1) (LT s14 1)) (OR (LT s10 1) (LT s12 1)) (OR (LT s10 1) (LT s13 1)) (OR (LT s10 1) (LT s14 1)) (OR (LT s11 1) (LT s17 1)) (OR (LT s11 1) (LT s15 1)) (OR (LT s11 1) (LT s16 1)) (OR (LT s7 1) (LT s17 1)) (OR (LT s7 1) (LT s15 1)) (OR (LT s9 1) (LT s17 1)) (OR (LT s7 1) (LT s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 65 in 0 ms.
FORMULA Peterson-COL-2-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-13 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 102 transition count 106
Reduce places removed 20 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 82 transition count 101
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 77 transition count 101
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 50 place count 77 transition count 86
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 80 place count 62 transition count 86
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 3 with 4 rules applied. Total rules applied 84 place count 60 transition count 84
Applied a total of 84 rules in 7 ms. Remains 60 /102 variables (removed 42) and now considering 84/126 (removed 42) transitions.
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 60 cols
[2021-05-14 15:50:00] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 15:50:00] [INFO ] Implicit Places using invariants in 36 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 57 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 57/102 places, 84/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 57 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/102 places, 84/126 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-COL-2-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 (LT s39 1) (LT s40 1) (LT s41 1) (LT s36 1) (LT s37 1) (LT s38 1)), p1:(OR (GEQ s30 1) (GEQ s32 1) (GEQ s28 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]]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-COL-2-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-14 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 102 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 86 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 32 place count 86 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 6 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 66 cols
[2021-05-14 15:50:00] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 15:50:00] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 63 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 63/102 places, 90/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-14 15:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 15:50:00] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 63 cols
[2021-05-14 15:50:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 15:50:00] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/102 places, 90/126 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, p0]
Running random walk in product with property : Peterson-COL-2-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s40 1) (GEQ s42 1) (GEQ s41 1) (GEQ s43 1) (GEQ s33 1) (GEQ s44 1) (GEQ s34 1) (GEQ s36 1) (GEQ s35 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 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][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-15 finished in 187 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621007403664

--------------------
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="Peterson-COL-2"
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 Peterson-COL-2, 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-162089128100557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 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 ;