Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821100603.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MAPK-PT-01280, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821100603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.7K Apr 29 19:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 19:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 19:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 19:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 25K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652814991718

Running Version 202205111006
[2022-05-17 19:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 19:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 19:16:33] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2022-05-17 19:16:33] [INFO ] Transformed 22 places.
[2022-05-17 19:16:33] [INFO ] Transformed 30 transitions.
[2022-05-17 19:16:33] [INFO ] Parsed PT model containing 22 places and 30 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-01280-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 10 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:33] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-17 19:16:33] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:33] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 19:16:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:33] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 19:16:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Support contains 20 out of 22 places after structural reductions.
[2022-05-17 19:16:33] [INFO ] Flatten gal took : 18 ms
[2022-05-17 19:16:33] [INFO ] Flatten gal took : 6 ms
[2022-05-17 19:16:33] [INFO ] Input system was already deterministic with 30 transitions.
Support contains 19 out of 22 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10592 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=311 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 19:16:34] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 19:16:34] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-17 19:16:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 19:16:34] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-17 19:16:34] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-17 19:16:34] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Finished Parikh walk after 13124 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=874 )
Parikh walk visited 15 properties in 936 ms.
FORMULA MAPK-PT-01280-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (!G((p0 U p1))||p2))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 16 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 16 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 16 transition count 23
Applied a total of 14 rules in 13 ms. Remains 16 /22 variables (removed 6) and now considering 23/30 (removed 7) transitions.
[2022-05-17 19:16:35] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 16 cols
[2022-05-17 19:16:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:16:35] [INFO ] Implicit Places using invariants in 24 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 23/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 22
Applied a total of 1 rules in 3 ms. Remains 15 /15 variables (removed 0) and now considering 22/23 (removed 1) transitions.
[2022-05-17 19:16:35] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:16:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 19:16:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 19:16:35] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:16:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 19:16:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 19:16:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/22 places, 22/30 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s13 s12), p0:(LEQ s1 s9), p1:(LEQ 1 s0)], 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 5 steps with 0 reset in 3 ms.
FORMULA MAPK-PT-01280-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-00 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p1)&&p0) U (G(X(p2))&&p3)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 9 place count 17 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 17 transition count 25
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 17 transition count 25
Applied a total of 13 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 17 cols
[2022-05-17 19:16:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 35 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 25/30 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 15 transition count 22
Applied a total of 3 rules in 6 ms. Remains 15 /15 variables (removed 0) and now considering 22/25 (removed 3) transitions.
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2022-05-17 19:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2022-05-17 19:16:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 19:16:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/22 places, 22/30 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p3 (AND p0 p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1))), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND p3 p0 p1), acceptance={1, 2} source=0 dest: 4}, { cond=(AND p3 p0 p1), acceptance={0, 1, 2} source=0 dest: 5}], [{ cond=(AND p3 (NOT p1)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p3 p1), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND p3 p1), acceptance={1, 2} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1))), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p3 p0 p1), acceptance={1, 2} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={0, 1, 2} source=2 dest: 5}], [{ cond=(OR (AND p3 (NOT p2)) (AND p0 p1 (NOT p2))), acceptance={0, 2} source=3 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND p3 (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={1} source=3 dest: 4}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 5}], [{ cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p3 p1 (NOT p2)), acceptance={2} source=4 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=4 dest: 4}, { cond=(AND p3 p1 (NOT p2)), acceptance={1, 2} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND p3 (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND p0 p1 p2), acceptance={1} source=5 dest: 4}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 5}]], initial=0, aps=[p3:(GT s8 s6), p0:(AND (LEQ 2 s8) (LEQ 1 s2)), p1:(LEQ 2 s8), p2:(LEQ 1 s2)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-01 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(X(F(p0)))&&F((X(p1)||G(p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 15 transition count 26
Graph (trivial) has 8 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 14 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 14 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 14 transition count 20
Applied a total of 20 rules in 12 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 19:16:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 33 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 20/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s5 s1), p1:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-02 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U !(p1 U G(p2)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 19 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 19 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 19 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 17 transition count 26
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 26
Applied a total of 11 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 26/30 (removed 4) transitions.
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 17 cols
[2022-05-17 19:16:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 24 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 26/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 25
Applied a total of 1 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/26 (removed 1) transitions.
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 19:16:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-17 19:16:36] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 19:16:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/22 places, 25/30 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/22 places, 25/30 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (LEQ s8 s9) (LEQ 3 s12))], 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 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-03 finished in 149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&X(X(G(p0)))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:36] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 19:16:36] [INFO ] Implicit Places using invariants in 41 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-04 finished in 170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 19:16:37] [INFO ] Implicit Places using invariants in 29 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s14 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MAPK-PT-01280-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-01280-LTLCardinality-05 finished in 614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||G(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:16:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 19:16:37] [INFO ] Implicit Places using invariants in 56 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 2 s20) (LEQ 1 s8)), p0:(AND (LEQ 2 s2) (LEQ 1 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 252 ms.
Product exploration explored 100000 steps with 0 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 491 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10274 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=790 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 217666 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217666 steps, saw 143667 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:16:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:16:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:16:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 19:16:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:16:42] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 19:16:42] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 19:16:42] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 6403 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=640 )
Parikh walk visited 6 properties in 198 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 566 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:16:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-17 19:16:43] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:16:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-17 19:16:43] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:16:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:16:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 427 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10275 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=934 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 198307 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198307 steps, saw 131662 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:16:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:16:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-17 19:16:47] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 19:16:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:16:47] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 19:16:47] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 19:16:47] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 6403 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=156 )
Parikh walk visited 6 properties in 167 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 617 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 310 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 19 transition count 26
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 6 ms. Remains 19 /21 variables (removed 2) and now considering 26/30 (removed 4) transitions.
[2022-05-17 19:16:49] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 19:16:49] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-17 19:16:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:16:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 26/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 26/30 transitions.
Product exploration explored 100000 steps with 0 reset in 250 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Built C files in :
/tmp/ltsmin3069309426096872093
[2022-05-17 19:16:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3069309426096872093
Running compilation step : cd /tmp/ltsmin3069309426096872093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin3069309426096872093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3069309426096872093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18060593847618779846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:17:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:17:05] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:17:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:17:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 19:17:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:17:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin16908789124775816612
[2022-05-17 19:17:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16908789124775816612
Running compilation step : cd /tmp/ltsmin16908789124775816612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin16908789124775816612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16908789124775816612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8575351188592531645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 19:17:20] [INFO ] Flatten gal took : 3 ms
[2022-05-17 19:17:20] [INFO ] Flatten gal took : 3 ms
[2022-05-17 19:17:20] [INFO ] Time to serialize gal into /tmp/LTL3344041394334174679.gal : 1 ms
[2022-05-17 19:17:20] [INFO ] Time to serialize properties into /tmp/LTL1934771483034798063.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3344041394334174679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1934771483034798063.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3344041...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((Phase1>=2)&&(Phase2>=1))")))||(G("((Raf>=2)&&(Phase2>=1))")))))
Formula 0 simplified : !G(GX"((Phase1>=2)&&(Phase2>=1))" | G"((Raf>=2)&&(Phase2>=1))")
Detected timeout of ITS tools.
[2022-05-17 19:17:35] [INFO ] Flatten gal took : 3 ms
[2022-05-17 19:17:35] [INFO ] Applying decomposition
[2022-05-17 19:17:35] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17432246043103217286.txt' '-o' '/tmp/graph17432246043103217286.bin' '-w' '/tmp/graph17432246043103217286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17432246043103217286.bin' '-l' '-1' '-v' '-w' '/tmp/graph17432246043103217286.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:17:35] [INFO ] Decomposing Gal with order
[2022-05-17 19:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:17:35] [INFO ] Removed a total of 9 redundant transitions.
[2022-05-17 19:17:35] [INFO ] Flatten gal took : 39 ms
[2022-05-17 19:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-17 19:17:35] [INFO ] Time to serialize gal into /tmp/LTL13809032109777474381.gal : 1 ms
[2022-05-17 19:17:35] [INFO ] Time to serialize properties into /tmp/LTL4358700632772233076.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13809032109777474381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4358700632772233076.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1380903...246
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i2.u6.Phase1>=2)&&(u3.Phase2>=1))")))||(G("((u5.Raf>=2)&&(u3.Phase2>=1))")))))
Formula 0 simplified : !G(GX"((i2.u6.Phase1>=2)&&(u3.Phase2>=1))" | G"((u5.Raf>=2)&&(u3.Phase2>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10538064185542305720
[2022-05-17 19:17:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10538064185542305720
Running compilation step : cd /tmp/ltsmin10538064185542305720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin10538064185542305720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10538064185542305720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-01280-LTLCardinality-06 finished in 88381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !(F(p0)||p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:18:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 19:18:06] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, (OR p0 p1), (OR p1 p0), true]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 s2), p1:(OR (LEQ 3 s2) (LEQ s16 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-07 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(((F(p0) U p1)||G(F(X(p2))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:18:06] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 19:18:06] [INFO ] Implicit Places using invariants in 62 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(LEQ s3 s11), p2:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 166 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-08 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(((F(p0)&&G(p1)) U p0)&&p2) U !X(!p2)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:18:06] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-17 19:18:06] [INFO ] Implicit Places using invariants in 41 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0 (NOT p2)), true, p1, (AND p1 p0)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GT s4 s17), p0:(LEQ s4 s12), p1:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 354 reset in 152 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA MAPK-PT-01280-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-10 finished in 523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((G(X(F(p0)))&&p0) U X(p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:18:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 19:18:07] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 178 ms :[p1, p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s6 s3), p1:(OR (LEQ s6 s3) (LEQ s15 s16))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-13 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(p0)&&F(p1)))||F(G(!(p0 U p2))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 19:18:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 19:18:07] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(LEQ 3 s12), p0:(LEQ 3 s11), p1:(LEQ s19 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 107 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-14 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||G(p1))))'
Found a SL insensitive property : MAPK-PT-01280-LTLCardinality-06
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
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 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 15 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 15 transition count 23
Applied a total of 15 rules in 13 ms. Remains 15 /22 variables (removed 7) and now considering 23/30 (removed 7) transitions.
[2022-05-17 19:18:08] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:08] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-17 19:18:08] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:08] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:18:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 19:18:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-17 19:18:08] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:08] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 15/22 places, 23/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/22 places, 23/30 transitions.
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 2 s14) (LEQ 1 s4)), p0:(AND (LEQ 2 s0) (LEQ 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 424 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10253 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1139 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:18:09] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:18:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:09] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:18:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-17 19:18:09] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 19:18:09] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 19:18:09] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 23/23 transitions.
Graph (complete) has 31 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 14
Applied a total of 6 rules in 4 ms. Remains 12 /15 variables (removed 3) and now considering 14/23 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/15 places, 14/23 transitions.
Incomplete random walk after 10574 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3524 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2449600 steps, run timeout after 3001 ms. (steps per millisecond=816 ) properties seen :{}
Probabilistic random walk after 2449600 steps, saw 1510589 distinct states, run finished after 3001 ms. (steps per millisecond=816 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 12 cols
[2022-05-17 19:18:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 19:18:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:12] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:18:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:12] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 19:18:12] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:12] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 19:18:12] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3523 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=503 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 629 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2022-05-17 19:18:13] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:18:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-17 19:18:13] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:18:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 19:18:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-17 19:18:13] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 23/23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 473 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10253 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2050 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:18:14] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:14] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:18:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:14] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 19:18:14] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:14] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 19:18:14] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 23/23 transitions.
Graph (complete) has 31 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 14
Applied a total of 6 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 14/23 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/15 places, 14/23 transitions.
Incomplete random walk after 10899 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5449 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2961015 steps, run timeout after 3001 ms. (steps per millisecond=986 ) properties seen :{}
Probabilistic random walk after 2961015 steps, saw 1841515 distinct states, run finished after 3001 ms. (steps per millisecond=986 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 12 cols
[2022-05-17 19:18:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 19:18:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:18:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 19:18:17] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 19:18:17] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:18:17] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 19:18:17] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3523 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=503 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 513 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 23/23 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 22
Applied a total of 1 rules in 3 ms. Remains 15 /15 variables (removed 0) and now considering 22/23 (removed 1) transitions.
[2022-05-17 19:18:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 19:18:19] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/15 places, 22/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 22/23 transitions.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Built C files in :
/tmp/ltsmin17712118146618557796
[2022-05-17 19:18:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17712118146618557796
Running compilation step : cd /tmp/ltsmin17712118146618557796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin17712118146618557796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin17712118146618557796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7010860536883776052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2022-05-17 19:18:34] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 19:18:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-17 19:18:34] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 19:18:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-17 19:18:34] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-17 19:18:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 19:18:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 23/23 transitions.
Built C files in :
/tmp/ltsmin6229514220187303303
[2022-05-17 19:18:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6229514220187303303
Running compilation step : cd /tmp/ltsmin6229514220187303303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin6229514220187303303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6229514220187303303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8030248113208393836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 19:18:49] [INFO ] Flatten gal took : 12 ms
[2022-05-17 19:18:49] [INFO ] Flatten gal took : 2 ms
[2022-05-17 19:18:49] [INFO ] Time to serialize gal into /tmp/LTL8588793620633545597.gal : 1 ms
[2022-05-17 19:18:49] [INFO ] Time to serialize properties into /tmp/LTL9565176412741614217.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8588793620633545597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9565176412741614217.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8588793...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((Phase1>=2)&&(Phase2>=1))")))||(G("((Raf>=2)&&(Phase2>=1))")))))
Formula 0 simplified : !G(GX"((Phase1>=2)&&(Phase2>=1))" | G"((Raf>=2)&&(Phase2>=1))")
Detected timeout of ITS tools.
[2022-05-17 19:19:04] [INFO ] Flatten gal took : 4 ms
[2022-05-17 19:19:04] [INFO ] Applying decomposition
[2022-05-17 19:19:04] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12190824425428455291.txt' '-o' '/tmp/graph12190824425428455291.bin' '-w' '/tmp/graph12190824425428455291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12190824425428455291.bin' '-l' '-1' '-v' '-w' '/tmp/graph12190824425428455291.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:19:04] [INFO ] Decomposing Gal with order
[2022-05-17 19:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:19:04] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-17 19:19:04] [INFO ] Flatten gal took : 2 ms
[2022-05-17 19:19:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2022-05-17 19:19:04] [INFO ] Time to serialize gal into /tmp/LTL13647779786769678716.gal : 0 ms
[2022-05-17 19:19:04] [INFO ] Time to serialize properties into /tmp/LTL6377413147581394918.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13647779786769678716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6377413147581394918.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1364777...246
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i2.u0.Phase1>=2)&&(u1.Phase2>=1))")))||(G("((i2.u3.Raf>=2)&&(u1.Phase2>=1))")))))
Formula 0 simplified : !G(GX"((i2.u0.Phase1>=2)&&(u1.Phase2>=1))" | G"((i2.u3.Raf>=2)&&(u1.Phase2>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11785274661388201232
[2022-05-17 19:19:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11785274661388201232
Running compilation step : cd /tmp/ltsmin11785274661388201232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin11785274661388201232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11785274661388201232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-01280-LTLCardinality-06 finished in 86858 ms.
[2022-05-17 19:19:35] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15463579475119640669
[2022-05-17 19:19:35] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-05-17 19:19:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 19:19:35] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-05-17 19:19:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 19:19:35] [INFO ] Applying decomposition
[2022-05-17 19:19:35] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-05-17 19:19:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 19:19:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15463579475119640669
[2022-05-17 19:19:35] [INFO ] Flatten gal took : 2 ms
Running compilation step : cd /tmp/ltsmin15463579475119640669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9668148822283007823.txt' '-o' '/tmp/graph9668148822283007823.bin' '-w' '/tmp/graph9668148822283007823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9668148822283007823.bin' '-l' '-1' '-v' '-w' '/tmp/graph9668148822283007823.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:19:35] [INFO ] Decomposing Gal with order
[2022-05-17 19:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:19:35] [INFO ] Removed a total of 7 redundant transitions.
[2022-05-17 19:19:35] [INFO ] Flatten gal took : 3 ms
[2022-05-17 19:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 19:19:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality15381826394846509828.gal : 1 ms
[2022-05-17 19:19:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality16800102725016057072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15381826394846509828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16800102725016057072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i3.u4.Phase1>=2)&&(u1.Phase2>=1))")))||(G("((u5.Raf>=2)&&(u1.Phase2>=1))")))))
Formula 0 simplified : !G(GX"((i3.u4.Phase1>=2)&&(u1.Phase2>=1))" | G"((u5.Raf>=2)&&(u1.Phase2>=1))")
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin15463579475119640669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15463579475119640669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: [](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.002: "[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.072: DFS-FIFO for weak LTL, using special progress label 33
pins2lts-mc-linux64( 0/ 8), 0.072: There are 34 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.072: State length is 23, there are 41 groups
pins2lts-mc-linux64( 0/ 8), 0.072: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.072: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.072: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.072: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.084: ~1 levels ~960 states ~4920 transitions
pins2lts-mc-linux64( 0/ 8), 0.103: ~1 levels ~1920 states ~10824 transitions
pins2lts-mc-linux64( 0/ 8), 0.128: ~1 levels ~3840 states ~23648 transitions
pins2lts-mc-linux64( 0/ 8), 0.172: ~1 levels ~7680 states ~51280 transitions
pins2lts-mc-linux64( 0/ 8), 0.244: ~1 levels ~15360 states ~110224 transitions
pins2lts-mc-linux64( 0/ 8), 0.450: ~1 levels ~30720 states ~234800 transitions
pins2lts-mc-linux64( 0/ 8), 0.731: ~1 levels ~61440 states ~504264 transitions
pins2lts-mc-linux64( 1/ 8), 1.266: ~1 levels ~122880 states ~1200200 transitions
pins2lts-mc-linux64( 0/ 8), 2.011: ~1 levels ~245760 states ~2300544 transitions
pins2lts-mc-linux64( 0/ 8), 3.073: ~1 levels ~491520 states ~4851928 transitions
pins2lts-mc-linux64( 1/ 8), 4.519: ~1 levels ~983040 states ~11046824 transitions
pins2lts-mc-linux64( 2/ 8), 7.227: ~1 levels ~1966080 states ~22278912 transitions
pins2lts-mc-linux64( 2/ 8), 12.588: ~1 levels ~3932160 states ~45801408 transitions
pins2lts-mc-linux64( 2/ 8), 24.285: ~1 levels ~7864320 states ~95737168 transitions
pins2lts-mc-linux64( 2/ 8), 49.308: ~1 levels ~15728640 states ~199705800 transitions
pins2lts-mc-linux64( 2/ 8), 100.830: ~1 levels ~31457280 states ~415129480 transitions
pins2lts-mc-linux64( 2/ 8), 208.125: ~1 levels ~62914560 states ~849070256 transitions
pins2lts-mc-linux64( 1/ 8), 421.720: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 421.774:
pins2lts-mc-linux64( 0/ 8), 421.774: mean standard work distribution: 4.2% (states) 2.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 421.774:
pins2lts-mc-linux64( 0/ 8), 421.774: Explored 105204144 states 1534689515 transitions, fanout: 14.588
pins2lts-mc-linux64( 0/ 8), 421.774: Total exploration time 421.680 sec (421.620 sec minimum, 421.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 421.774: States per second: 249488, Transitions per second: 3639465
pins2lts-mc-linux64( 0/ 8), 421.774:
pins2lts-mc-linux64( 0/ 8), 421.774: Progress states detected: 134217039
pins2lts-mc-linux64( 0/ 8), 421.774: Redundant explorations: -21.6165
pins2lts-mc-linux64( 0/ 8), 421.774:
pins2lts-mc-linux64( 0/ 8), 421.774: Queue width: 8B, total height: 54114385, memory: 412.86MB
pins2lts-mc-linux64( 0/ 8), 421.774: Tree memory: 1182.5MB, 9.2 B/state, compr.: 9.8%
pins2lts-mc-linux64( 0/ 8), 421.774: Tree fill ratio (roots/leafs): 99.0%/61.0%
pins2lts-mc-linux64( 0/ 8), 421.774: Stored 30 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 421.774: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 421.774: Est. total memory use: 1595.3MB (~1436.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15463579475119640669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15463579475119640669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 19:40:35] [INFO ] Flatten gal took : 3 ms
[2022-05-17 19:40:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality15358988219552308164.gal : 2 ms
[2022-05-17 19:40:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality2408565705069259485.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15358988219552308164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2408565705069259485.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((Phase1>=2)&&(Phase2>=1))")))||(G("((Raf>=2)&&(Phase2>=1))")))))
Formula 0 simplified : !G(GX"((Phase1>=2)&&(Phase2>=1))" | G"((Raf>=2)&&(Phase2>=1))")
Detected timeout of ITS tools.
[2022-05-17 20:01:43] [INFO ] Flatten gal took : 88 ms
[2022-05-17 20:01:43] [INFO ] Input system was already deterministic with 30 transitions.
[2022-05-17 20:01:43] [INFO ] Transformed 22 places.
[2022-05-17 20:01:43] [INFO ] Transformed 30 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 20:01:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality3960778066238728201.gal : 3 ms
[2022-05-17 20:01:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality9488307530090718909.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3960778066238728201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9488307530090718909.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G(X("((Phase1>=2)&&(Phase2>=1))")))||(G("((Raf>=2)&&(Phase2>=1))")))))
Formula 0 simplified : !G(GX"((Phase1>=2)&&(Phase2>=1))" | G"((Raf>=2)&&(Phase2>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-01280"
export BK_EXAMINATION="LTLCardinality"
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 MAPK-PT-01280, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821100603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-01280.tgz
mv MAPK-PT-01280 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;