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.r102-smll-162075331400276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 GPPP-PT-C1000N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331400276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000010-00
FORMULA_NAME GPPP-PT-C1000N0000000010-01
FORMULA_NAME GPPP-PT-C1000N0000000010-02
FORMULA_NAME GPPP-PT-C1000N0000000010-03
FORMULA_NAME GPPP-PT-C1000N0000000010-04
FORMULA_NAME GPPP-PT-C1000N0000000010-05
FORMULA_NAME GPPP-PT-C1000N0000000010-06
FORMULA_NAME GPPP-PT-C1000N0000000010-07
FORMULA_NAME GPPP-PT-C1000N0000000010-08
FORMULA_NAME GPPP-PT-C1000N0000000010-09
FORMULA_NAME GPPP-PT-C1000N0000000010-10
FORMULA_NAME GPPP-PT-C1000N0000000010-11
FORMULA_NAME GPPP-PT-C1000N0000000010-12
FORMULA_NAME GPPP-PT-C1000N0000000010-13
FORMULA_NAME GPPP-PT-C1000N0000000010-14
FORMULA_NAME GPPP-PT-C1000N0000000010-15

=== Now, execution of the tool begins

BK_START 1621231133676

Running Version 0
[2021-05-17 05:58:56] [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-17 05:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 05:58:56] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-17 05:58:56] [INFO ] Transformed 33 places.
[2021-05-17 05:58:56] [INFO ] Transformed 22 transitions.
[2021-05-17 05:58:56] [INFO ] Parsed PT model containing 33 places and 22 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 05:58:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C1000N0000000010-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:57] [INFO ] Invariants computation overflowed in 13 ms
[2021-05-17 05:58:57] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:57] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:57] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:57] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:58:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:57] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
[2021-05-17 05:58:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 05:58:57] [INFO ] Flatten gal took : 31 ms
FORMULA GPPP-PT-C1000N0000000010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 05:58:57] [INFO ] Flatten gal took : 11 ms
[2021-05-17 05:58:57] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 229 resets, run finished after 381 ms. (steps per millisecond=262 ) properties (out of 29) seen :24
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 05:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 05:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 05:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
[2021-05-17 05:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-17 05:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 05:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned unsat
[2021-05-17 05:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-17 05:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 05:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 05:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Nat]Absence check using state equation in 33 ms returned unsat
[2021-05-17 05:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-17 05:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 05:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 05:58:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2021-05-17 05:58:58] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C1000N0000000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Applied a total of 7 rules in 51 ms. Remains 29 /33 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 29 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 18 rows 29 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:58] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 18 rows 29 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:58:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:58:58] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 2, 3, 18, 22]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 158 ms to find 5 implicit places.
[2021-05-17 05:58:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 24/33 places, 18/22 transitions.
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 6 place count 21 transition count 15
Applied a total of 6 rules in 6 ms. Remains 21 /24 variables (removed 3) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 05:58:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:58:59] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 10 ms
[2021-05-17 05:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:58:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s12 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-01 finished in 707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&((p1||(p2 U (p3||G(p2)))) U ((p4&&(p1||(p2 U (p3||G(p2)))))||G((p1||(p2 U (p3||G(p2)))))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:58:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:58:59] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 05:58:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 155 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:58:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:58:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 (NOT p4) p1) (AND p0 (NOT p4) p3) (AND p0 (NOT p4) p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p4) p1) (AND (NOT p4) p3) (AND (NOT p4) p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT s12 s18) (GT s24 s23)), p1:(GT 2 s14), p3:(AND (GT s3 s26) (GT s14 s8)), p2:(GT s14 s8), p4:(GT s3 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-02 finished in 643 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1&&(p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 29 transition count 19
Applied a total of 6 rules in 6 ms. Remains 29 /33 variables (removed 4) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 29 cols
[2021-05-17 05:58:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 19 rows 29 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 19 rows 29 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 05:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 119 ms to find 2 implicit places.
[2021-05-17 05:59:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 27/33 places, 19/22 transitions.
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 2 place count 26 transition count 18
Applied a total of 2 rules in 4 ms. Remains 26 /27 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 05:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/33 places, 18/22 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s14 s9), p1:(GT s1 s11), p2:(GT s15 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 301 steps with 0 reset in 7 ms.
FORMULA GPPP-PT-C1000N0000000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-03 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((X(p0)||(p1&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 155 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT s27 s20), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10846 reset in 349 ms.
Stack based approach found an accepted trace after 29 steps with 3 reset with depth 7 and stack size 7 in 2 ms.
FORMULA GPPP-PT-C1000N0000000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-05 finished in 811 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 11 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:01] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:01] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [0, 2, 3, 13, 17]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 133 ms to find 5 implicit places.
[2021-05-17 05:59:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 19/33 places, 15/22 transitions.
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 6 place count 16 transition count 12
Applied a total of 6 rules in 4 ms. Remains 16 /19 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:01] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 05:59:01] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24883 reset in 216 ms.
Product exploration explored 100000 steps with 24927 reset in 248 ms.
Graph (complete) has 42 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25057 reset in 108 ms.
Product exploration explored 100000 steps with 24918 reset in 145 ms.
[2021-05-17 05:59:02] [INFO ] Flatten gal took : 11 ms
[2021-05-17 05:59:02] [INFO ] Flatten gal took : 3 ms
[2021-05-17 05:59:02] [INFO ] Time to serialize gal into /tmp/LTL10782441344559887128.gal : 1 ms
[2021-05-17 05:59:02] [INFO ] Time to serialize properties into /tmp/LTL13314984552577103114.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10782441344559887128.gal, -t, CGAL, -LTL, /tmp/LTL13314984552577103114.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/LTL10782441344559887128.gal -t CGAL -LTL /tmp/LTL13314984552577103114.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(b2>=3)")))
Formula 0 simplified : !F"(b2>=3)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/10/1/12
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
168 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.70979,39096,1,0,231,109423,46,138,1000,100779,438
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C1000N0000000010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C1000N0000000010-06 finished in 3039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(F(p0)) U p1))||X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:04] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:04] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-17 05:59:04] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:04] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:04] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 112 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:04] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:04] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 05:59:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s13), p0:(LEQ s7 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 33333 reset in 153 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 28 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 22 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 05:59:06] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-17 05:59:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 05:59:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 33333 reset in 297 ms.
Product exploration explored 100000 steps with 33333 reset in 279 ms.
[2021-05-17 05:59:07] [INFO ] Flatten gal took : 4 ms
[2021-05-17 05:59:07] [INFO ] Flatten gal took : 3 ms
[2021-05-17 05:59:07] [INFO ] Time to serialize gal into /tmp/LTL17742932429364679833.gal : 2 ms
[2021-05-17 05:59:07] [INFO ] Time to serialize properties into /tmp/LTL2736518600558032025.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17742932429364679833.gal, -t, CGAL, -LTL, /tmp/LTL2736518600558032025.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/LTL17742932429364679833.gal -t CGAL -LTL /tmp/LTL2736518600558032025.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((G(F("(Xu5P<=Pyr)")))U("(G6P>=1)")))||(X(X("(G6P>=1)")))))
Formula 0 simplified : !(G(GF"(Xu5P<=Pyr)" U "(G6P>=1)") | XX"(G6P>=1)")
Detected timeout of ITS tools.
[2021-05-17 05:59:22] [INFO ] Flatten gal took : 5 ms
[2021-05-17 05:59:22] [INFO ] Applying decomposition
[2021-05-17 05:59:22] [INFO ] Flatten gal took : 4 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/graph17893852630636676410.txt, -o, /tmp/graph17893852630636676410.bin, -w, /tmp/graph17893852630636676410.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/graph17893852630636676410.bin, -l, -1, -v, -w, /tmp/graph17893852630636676410.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 05:59:22] [INFO ] Decomposing Gal with order
[2021-05-17 05:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 05:59:22] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-17 05:59:22] [INFO ] Flatten gal took : 40 ms
[2021-05-17 05:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 05:59:22] [INFO ] Time to serialize gal into /tmp/LTL4054561024741684276.gal : 3 ms
[2021-05-17 05:59:22] [INFO ] Time to serialize properties into /tmp/LTL15791754377283178387.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/LTL4054561024741684276.gal, -t, CGAL, -LTL, /tmp/LTL15791754377283178387.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/LTL4054561024741684276.gal -t CGAL -LTL /tmp/LTL15791754377283178387.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((G(F("(gu3.Xu5P<=gu3.Pyr)")))U("(gi0.gi1.gu4.G6P>=1)")))||(X(X("(gi0.gi1.gu4.G6P>=1)")))))
Formula 0 simplified : !(G(GF"(gu3.Xu5P<=gu3.Pyr)" U "(gi0.gi1.gu4.G6P>=1)") | XX"(gi0.gi1.gu4.G6P>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8480457299211662743
[2021-05-17 05:59:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8480457299211662743
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/ltsmin8480457299211662743]
Compilation finished in 561 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8480457299211662743]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](([](<>((LTLAPp0==true))) U (LTLAPp1==true)))||X(X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8480457299211662743]
LTSmin run took 669 ms.
FORMULA GPPP-PT-C1000N0000000010-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C1000N0000000010-07 finished in 34378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
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 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 17
Applied a total of 9 rules in 14 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 05:59:38] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 05:59:38] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:38] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 05:59:38] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [0, 2, 3, 17, 21]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 195 ms to find 5 implicit places.
[2021-05-17 05:59:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 23/33 places, 17/22 transitions.
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 6 place count 20 transition count 14
Applied a total of 6 rules in 4 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-08 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 108 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s23)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-11 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p0 U (p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
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 3 place count 31 transition count 20
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
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 13 place count 25 transition count 16
Applied a total of 13 rules in 10 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [0, 2, 3, 13, 18]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 84 ms to find 5 implicit places.
[2021-05-17 05:59:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/33 places, 16/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 14
Applied a total of 4 rules in 17 ms. Remains 18 /20 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 05:59:39] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 05:59:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 05:59:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s4 s10) (LEQ 2 s10)), p0:(LEQ s4 s10), p2:(LEQ 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-15 finished in 303 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621231180856

--------------------
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="GPPP-PT-C1000N0000000010"
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 GPPP-PT-C1000N0000000010, 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 r102-smll-162075331400276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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