Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620671289234

Running Version 0
[2021-05-10 18:28:10] [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]
[2021-05-10 18:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 18:28:10] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-10 18:28:10] [INFO ] Transformed 22 places.
[2021-05-10 18:28:10] [INFO ] Transformed 20 transitions.
[2021-05-10 18:28:10] [INFO ] Parsed PT model containing 22 places and 20 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 18:28:10] [INFO ] Initial state test concluded for 3 properties.
FORMULA FMS-PT-10000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-10000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-10000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-10000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 17 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:10] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-10 18:28:10] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:10] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 18:28:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 18:28:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 18:28:11] [INFO ] Flatten gal took : 18 ms
FORMULA FMS-PT-10000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 18:28:11] [INFO ] Flatten gal took : 4 ms
[2021-05-10 18:28:11] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100013 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=1785 ) properties (out of 22) seen :10
Running SMT prover for 12 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:11] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:28:11] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 18:28:11] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 18:28:11] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 18:28:11] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:28:11] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 18:28:11] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:28:11] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 18:28:11] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:28:11] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 18:28:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 18:28:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 18:28:11] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-10 18:28:11] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-10000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-10000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&(p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:11] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 18:28:11] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:11] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:11] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 18:28:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : FMS-PT-10000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s5 s7), p2:(GT s14 s10), p0:(LEQ s16 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-10000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-03 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 19 place count 10 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 10 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 9 transition count 9
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 3 with 2 rules applied. Total rules applied 23 place count 8 transition count 8
Applied a total of 23 rules in 10 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
[2021-05-10 18:28:12] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-10 18:28:12] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 18:28:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 18:28:12] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-04 finished in 95 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p1 U p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 14 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 3 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 18:28:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 18:28:12] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 18:28:12] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : FMS-PT-10000-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (GT 2 s8) (GT s4 s2)), p1:(LEQ s2 s5), p0:(AND (GT 1 s3) (GT s2 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 268 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 29 in 1 ms.
FORMULA FMS-PT-10000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-07 finished in 374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:12] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-10000-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s19 s1), p1:(LEQ s5 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4869 reset in 139 ms.
Stack based approach found an accepted trace after 189 steps with 9 reset with depth 5 and stack size 5 in 1 ms.
FORMULA FMS-PT-10000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-08 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:12] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 18:28:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 46 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-10000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s0 s14), p1:(LEQ 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5595 reset in 142 ms.
Stack based approach found an accepted trace after 25 steps with 1 reset with depth 11 and stack size 11 in 0 ms.
FORMULA FMS-PT-10000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-09 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:13] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:13] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:13] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ s5 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 87 ms.
Product exploration explored 100000 steps with 20000 reset in 102 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 73 ms.
Product exploration explored 100000 steps with 20000 reset in 80 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 22 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 15 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2021-05-10 18:28:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2021-05-10 18:28:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 20000 reset in 166 ms.
Product exploration explored 100000 steps with 20000 reset in 159 ms.
[2021-05-10 18:28:14] [INFO ] Flatten gal took : 3 ms
[2021-05-10 18:28:14] [INFO ] Flatten gal took : 3 ms
[2021-05-10 18:28:14] [INFO ] Time to serialize gal into /tmp/LTL5461537619291509313.gal : 1 ms
[2021-05-10 18:28:14] [INFO ] Time to serialize properties into /tmp/LTL16033776537278914377.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5461537619291509313.gal, -t, CGAL, -LTL, /tmp/LTL16033776537278914377.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5461537619291509313.gal -t CGAL -LTL /tmp/LTL16033776537278914377.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(P1wM1<=P3)")))))))
Formula 0 simplified : !XXXXF"(P1wM1<=P3)"
Detected timeout of ITS tools.
[2021-05-10 18:28:29] [INFO ] Flatten gal took : 2 ms
[2021-05-10 18:28:29] [INFO ] Applying decomposition
[2021-05-10 18:28:29] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5824609324232938585.txt, -o, /tmp/graph5824609324232938585.bin, -w, /tmp/graph5824609324232938585.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5824609324232938585.bin, -l, -1, -v, -w, /tmp/graph5824609324232938585.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 18:28:29] [INFO ] Decomposing Gal with order
[2021-05-10 18:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 18:28:29] [INFO ] Flatten gal took : 19 ms
[2021-05-10 18:28:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 18:28:29] [INFO ] Time to serialize gal into /tmp/LTL1261213932240898197.gal : 1 ms
[2021-05-10 18:28:29] [INFO ] Time to serialize properties into /tmp/LTL14841347889468225263.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1261213932240898197.gal, -t, CGAL, -LTL, /tmp/LTL14841347889468225263.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1261213932240898197.gal -t CGAL -LTL /tmp/LTL14841347889468225263.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(gu8.P1wM1<=gu8.P3)")))))))
Formula 0 simplified : !XXXXF"(gu8.P1wM1<=gu8.P3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13395045069683986326
[2021-05-10 18:28:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13395045069683986326
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13395045069683986326]
Compilation finished in 189 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13395045069683986326]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(X(<>((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13395045069683986326]
LTSmin run took 361 ms.
FORMULA FMS-PT-10000-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-10000-10 finished in 31944 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 9 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 10 transition count 15
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 22 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 6 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 5
Applied a total of 27 rules in 3 ms. Remains 5 /22 variables (removed 17) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 18:28:45] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Implicit Places using invariants in 12 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-10 18:28:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-10 18:28:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 18:28:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 4/22 places, 5/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-10 18:28:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-10 18:28:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 2 iterations. Remains : 4/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-10000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s2)], 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 5 steps with 0 reset in 1 ms.
FORMULA FMS-PT-10000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-13 finished in 68 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 9 transition count 10
Applied a total of 23 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:28:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:28:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 18:28:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 18:28:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-10000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s5), p0:(LEQ s1 s4)], 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 96 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-14 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||G((p2||X(F((p2&&F(p3)))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 18:28:45] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 18:28:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 18:28:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : FMS-PT-10000-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p1 p0 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p3)) (AND p2 (NOT p0) (NOT p3))), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 2 s11) (LEQ 3 s7)), p1:(LEQ 3 s7), p2:(LEQ 2 s9), p3:(LEQ s0 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 487 steps with 0 reset with depth 488 and stack size 488 in 2 ms.
FORMULA FMS-PT-10000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-15 finished in 418 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620671326675

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-10000"
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 FMS-PT-10000, 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 r083-tall-162048875900820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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