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-162075331200180.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-C0001N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:55 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-C0001N0000000100-00
FORMULA_NAME GPPP-PT-C0001N0000000100-01
FORMULA_NAME GPPP-PT-C0001N0000000100-02
FORMULA_NAME GPPP-PT-C0001N0000000100-03
FORMULA_NAME GPPP-PT-C0001N0000000100-04
FORMULA_NAME GPPP-PT-C0001N0000000100-05
FORMULA_NAME GPPP-PT-C0001N0000000100-06
FORMULA_NAME GPPP-PT-C0001N0000000100-07
FORMULA_NAME GPPP-PT-C0001N0000000100-08
FORMULA_NAME GPPP-PT-C0001N0000000100-09
FORMULA_NAME GPPP-PT-C0001N0000000100-10
FORMULA_NAME GPPP-PT-C0001N0000000100-11
FORMULA_NAME GPPP-PT-C0001N0000000100-12
FORMULA_NAME GPPP-PT-C0001N0000000100-13
FORMULA_NAME GPPP-PT-C0001N0000000100-14
FORMULA_NAME GPPP-PT-C0001N0000000100-15

=== Now, execution of the tool begins

BK_START 1621198150874

Running Version 0
[2021-05-16 20:49:14] [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-16 20:49:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:49:14] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-16 20:49:14] [INFO ] Transformed 33 places.
[2021-05-16 20:49:14] [INFO ] Transformed 22 transitions.
[2021-05-16 20:49:14] [INFO ] Parsed PT model containing 33 places and 22 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 20:49:14] [INFO ] Initial state test concluded for 7 properties.
FORMULA GPPP-PT-C0001N0000000100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 13 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:49:14] [INFO ] Computed 13 place invariants in 10 ms
[2021-05-16 20:49:15] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:49:15] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-16 20:49:15] [INFO ] Implicit Places using invariants in 88 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:15] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 20:49:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:15] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 20:49:15] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
[2021-05-16 20:49:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 20:49:15] [INFO ] Flatten gal took : 47 ms
FORMULA GPPP-PT-C0001N0000000100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:49:15] [INFO ] Flatten gal took : 14 ms
[2021-05-16 20:49:15] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=236 ) properties (out of 22) seen :17
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:16] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-16 20:49:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:16] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-16 20:49:16] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 20:49:16] [INFO ] Added : 21 causal constraints over 5 iterations in 81 ms. Result :sat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 7 ms returned unsat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-16 20:49:16] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2021-05-16 20:49:16] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000000100-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:16] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:17] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 20:49:17] [INFO ] Implicit Places using invariants in 68 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s25 s1), p1:(GT 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 0 reset in 6 ms.
FORMULA GPPP-PT-C0001N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-00 finished in 854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 20 place count 19 transition count 13
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 22 place count 18 transition count 12
Applied a total of 22 rules in 26 ms. Remains 18 /31 variables (removed 13) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:17] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 20:49:17] [INFO ] Implicit Places using invariants in 50 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
[2021-05-16 20:49:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 20:49:17] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-16 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 16/31 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 11
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 15 transition count 11
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 4 place count 14 transition count 10
Applied a total of 4 rules in 7 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 20:49:17] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-16 20:49:17] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 20:49:17] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-16 20:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 20:49:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/31 places, 10/22 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s9)], 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 50000 reset in 481 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
[2021-05-16 20:49:19] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:49:19] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:49:19] [INFO ] Time to serialize gal into /tmp/LTL9383721335937832356.gal : 2 ms
[2021-05-16 20:49:19] [INFO ] Time to serialize properties into /tmp/LTL13510693048454062790.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/LTL9383721335937832356.gal, -t, CGAL, -LTL, /tmp/LTL13510693048454062790.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/LTL9383721335937832356.gal -t CGAL -LTL /tmp/LTL13510693048454062790.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.t4.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/1/10
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.051635,15984,1,0,26,970,43,15,469,650,35
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000000100-01 finished in 1550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:19] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:19] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 20:49:19] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:19] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:19] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 235 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-02 finished in 402 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 20 place count 19 transition count 13
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 22 place count 18 transition count 12
Applied a total of 22 rules in 10 ms. Remains 18 /31 variables (removed 13) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:19] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:19] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:19] [INFO ] Implicit Places using invariants in 40 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-16 20:49:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 20:49:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 16/31 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
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 4 place count 14 transition count 10
Applied a total of 4 rules in 18 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 20:49:19] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-16 20:49:19] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 20:49:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 20:49:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 20:49:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/31 places, 10/22 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s9)], 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 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
[2021-05-16 20:49:20] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:49:20] [INFO ] Flatten gal took : 3 ms
[2021-05-16 20:49:20] [INFO ] Time to serialize gal into /tmp/LTL6721582696830193247.gal : 5 ms
[2021-05-16 20:49:20] [INFO ] Time to serialize properties into /tmp/LTL1011521480648290120.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/LTL6721582696830193247.gal, -t, CGAL, -LTL, /tmp/LTL1011521480648290120.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/LTL6721582696830193247.gal -t CGAL -LTL /tmp/LTL1011521480648290120.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.t4.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/1/10
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.035498,16296,1,0,26,970,43,15,468,650,35
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000000100-06 finished in 1019 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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.
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 3 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 28 transition count 18
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 7 place count 27 transition count 18
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 12 place count 24 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 22 transition count 15
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 17 place count 21 transition count 14
Applied a total of 17 rules in 10 ms. Remains 21 /31 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 21 cols
[2021-05-16 20:49:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:49:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2021-05-16 20:49:20] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-16 20:49:20] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
[2021-05-16 20:49:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 20:49:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 20:49:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 18/31 places, 14/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 13
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 17 transition count 13
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 4 place count 16 transition count 12
Applied a total of 4 rules in 3 ms. Remains 16 /18 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 20:49:20] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 20:49:20] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 20:49:20] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-16 20:49:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 20:49:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-07 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:(OR (GT s1 s7) (GT 2 s12))], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-07 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:21] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 20:49:21] [INFO ] Implicit Places using invariants in 66 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:21] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:21] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s0 s21), p1:(GT s10 s19)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6269 reset in 277 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-09 finished in 685 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 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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.
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 3 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 3 with 3 rules applied. Total rules applied 20 place count 19 transition count 13
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 22 place count 18 transition count 12
Applied a total of 22 rules in 13 ms. Remains 18 /31 variables (removed 13) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 20:49:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-16 20:49:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 20:49:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 16/31 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 11
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 15 transition count 11
Applied a total of 2 rules in 3 ms. Remains 15 /16 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-16 20:49:21] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-16 20:49:21] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-16 20:49:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 20:49:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:49:21] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/31 places, 11/22 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-10 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 s5 s0)], 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 27 steps with 2 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-10 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:22] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:49:22] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-16 20:49:22] [INFO ] Implicit Places using invariants in 49 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s23 s13), p0:(LEQ s11 s21)], 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 12 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-12 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(G((p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
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 2 with 4 rules applied. Total rules applied 11 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 13 place count 24 transition count 15
Applied a total of 13 rules in 11 ms. Remains 24 /31 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 20:49:22] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 20:49:22] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] Implicit Places using invariants in 47 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
[2021-05-16 20:49:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 20:49:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 21/31 places, 15/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 14
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 20 transition count 14
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 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 9 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 20:49:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:22] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 20:49:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 20:49:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s3), p1:(LEQ 3 s10), p2:(LEQ 2 s5)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-15 finished in 455 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621198164108

--------------------
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-C0001N0000000100"
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-C0001N0000000100, 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-162075331200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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