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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K 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.6K 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 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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-C0001N0000000010-00
FORMULA_NAME GPPP-PT-C0001N0000000010-01
FORMULA_NAME GPPP-PT-C0001N0000000010-02
FORMULA_NAME GPPP-PT-C0001N0000000010-03
FORMULA_NAME GPPP-PT-C0001N0000000010-04
FORMULA_NAME GPPP-PT-C0001N0000000010-05
FORMULA_NAME GPPP-PT-C0001N0000000010-06
FORMULA_NAME GPPP-PT-C0001N0000000010-07
FORMULA_NAME GPPP-PT-C0001N0000000010-08
FORMULA_NAME GPPP-PT-C0001N0000000010-09
FORMULA_NAME GPPP-PT-C0001N0000000010-10
FORMULA_NAME GPPP-PT-C0001N0000000010-11
FORMULA_NAME GPPP-PT-C0001N0000000010-12
FORMULA_NAME GPPP-PT-C0001N0000000010-13
FORMULA_NAME GPPP-PT-C0001N0000000010-14
FORMULA_NAME GPPP-PT-C0001N0000000010-15

=== Now, execution of the tool begins

BK_START 1621196669852

Running Version 0
[2021-05-16 20:24:33] [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:24:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:24:33] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-16 20:24:33] [INFO ] Transformed 33 places.
[2021-05-16 20:24:33] [INFO ] Transformed 22 transitions.
[2021-05-16 20:24:33] [INFO ] Parsed PT model containing 33 places and 22 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 20:24:33] [INFO ] Initial state test concluded for 5 properties.
FORMULA GPPP-PT-C0001N0000000010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 20 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:24:33] [INFO ] Computed 13 place invariants in 14 ms
[2021-05-16 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:24:33] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-16 20:24:33] [INFO ] Implicit Places using invariants in 57 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:33] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:33] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 20:24:34] [INFO ] Flatten gal took : 45 ms
[2021-05-16 20:24:34] [INFO ] Flatten gal took : 14 ms
[2021-05-16 20:24:34] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=288 ) properties (out of 24) seen :21
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:34] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 20:24:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:24:34] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-16 20:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:24:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 20:24:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:24:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-16 20:24:34] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-16 20:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:24:35] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-16 20:24:35] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 20:24:35] [INFO ] Added : 19 causal constraints over 4 iterations in 62 ms. Result :sat
[2021-05-16 20:24:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:24:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2021-05-16 20:24:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:24:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-16 20:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:24:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 20:24:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:24:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 20:24:35] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-16 20:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:24:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-16 20:24:35] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 20:24:35] [INFO ] Added : 21 causal constraints over 5 iterations in 213 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:35] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:35] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:35] [INFO ] Implicit Places using invariants in 62 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:35] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 4 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:24:35] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, 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:(GT 1 s19), p1:(AND (GT s25 s1) (GT 1 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 452 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 8 ms.
FORMULA GPPP-PT-C0001N0000000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-00 finished in 1355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 6 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 31 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 30 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 2 with 5 rules applied. Total rules applied 8 place count 27 transition count 18
Applied a total of 8 rules in 26 ms. Remains 27 /32 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2021-05-16 20:24:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 20:24:37] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2021-05-16 20:24:37] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 20:24:37] [INFO ] Implicit Places using invariants in 95 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
[2021-05-16 20:24:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 20:24:37] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 18/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:24:37] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:37] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:24:37] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:24:37] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/32 places, 17/22 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s11 s7), p0:(LEQ s12 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 452 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
[2021-05-16 20:24:38] [INFO ] Flatten gal took : 7 ms
[2021-05-16 20:24:38] [INFO ] Flatten gal took : 6 ms
[2021-05-16 20:24:38] [INFO ] Time to serialize gal into /tmp/LTL9674454821645445264.gal : 2 ms
[2021-05-16 20:24:38] [INFO ] Time to serialize properties into /tmp/LTL1640136807024191573.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/LTL9674454821645445264.gal, -t, CGAL, -LTL, /tmp/LTL1640136807024191573.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/LTL9674454821645445264.gal -t CGAL -LTL /tmp/LTL1640136807024191573.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((G("(_3PG<=NADPplus)"))U("(ADP<=F6P)")))))
Formula 0 simplified : !FG(G"(_3PG<=NADPplus)" U "(ADP<=F6P)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/16/1/17
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
78 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.80583,35076,1,0,383,94147,68,220,879,110656,1077
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000010-03 finished in 3039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:39] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:40] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:40] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 28/32 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:24:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1649 reset in 215 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-04 finished in 552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0) U p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:40] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:40] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 20:24:40] [INFO ] Implicit Places using invariants in 96 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 5 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:24:40] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s12 s5), p2:(OR (LEQ s25 s18) (LEQ s26 s4)), p0:(LEQ s25 s18)], 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 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 6 edges and 28 vertex of which 2 / 28 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 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 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 27 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 27 transition count 21
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 25 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 25 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 25 transition count 19
Performed 1 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 1 rules applied. Total rules applied 11 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 25 /28 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 25 cols
[2021-05-16 20:24:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
[2021-05-16 20:24:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 25 cols
[2021-05-16 20:24:42] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 20:24:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 19/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 533 ms.
Product exploration explored 100000 steps with 50000 reset in 405 ms.
[2021-05-16 20:24:43] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:24:43] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:24:43] [INFO ] Time to serialize gal into /tmp/LTL6942100097476653589.gal : 1 ms
[2021-05-16 20:24:43] [INFO ] Time to serialize properties into /tmp/LTL10577978085155329672.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/LTL6942100097476653589.gal, -t, CGAL, -LTL, /tmp/LTL10577978085155329672.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/LTL6942100097476653589.gal -t CGAL -LTL /tmp/LTL10577978085155329672.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("(a2<=Pyr)"))U("(FBP<=Xu5P)"))||(F("((a2<=Pyr)||(c1<=Ru5P))")))))
Formula 0 simplified : !X((F"(a2<=Pyr)" U "(FBP<=Xu5P)") | F"((a2<=Pyr)||(c1<=Ru5P))")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
26 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.285628,20928,1,0,44,19930,73,25,945,16985,57
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000010-05 finished in 3224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:43] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:43] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 20:24:43] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:24:43] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 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:24:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 2 / 29 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 28 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 22
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 25 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 25 transition count 19
Performed 2 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 2 rules applied. Total rules applied 15 place count 25 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 8 ms. Remains 24 /29 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 20:24:44] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
[2021-05-16 20:24:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 20:24:44] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/29 places, 18/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Product exploration explored 100000 steps with 50000 reset in 392 ms.
[2021-05-16 20:24:45] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:24:45] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:24:45] [INFO ] Time to serialize gal into /tmp/LTL4786981786723599118.gal : 2 ms
[2021-05-16 20:24:45] [INFO ] Time to serialize properties into /tmp/LTL17786439051450456817.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/LTL4786981786723599118.gal, -t, CGAL, -LTL, /tmp/LTL17786439051450456817.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/LTL4786981786723599118.gal -t CGAL -LTL /tmp/LTL17786439051450456817.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Lac<=Pi)"))))
Formula 0 simplified : !XF"(Lac<=Pi)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
76 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.780724,26376,1,0,44,41002,68,25,980,40400,56
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000010-06 finished in 2576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:24:46] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:46] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 28/32 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:24:46] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s24), p1:(GT 2 s10)], nbAcceptance=1, 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 5 reset in 94 ms.
Product exploration explored 100000 steps with 3 reset in 126 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 9 reset in 165 ms.
Product exploration explored 100000 steps with 7 reset in 191 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 27 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 24 transition count 18
Performed 2 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 2 rules applied. Total rules applied 15 place count 24 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 23 transition count 17
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 18 place count 23 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 18 rules in 10 ms. Remains 23 /28 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:24:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
[2021-05-16 20:24:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:24:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/28 places, 17/22 transitions.
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-07 finished in 1398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:47] [INFO ] Implicit Places using invariants in 51 ms returned [0, 1, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:24:47] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 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:24:47] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s3), p0:(OR (GT 3 s3) (GT s28 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 214 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 2 / 29 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 28 transition count 21
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 28 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 25 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 25 transition count 18
Performed 1 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 1 rules applied. Total rules applied 14 place count 25 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 24 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 24 transition count 17
Performed 1 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 1 rules applied. Total rules applied 17 place count 24 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 5 ms. Remains 24 /29 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 24 cols
[2021-05-16 20:24:49] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
[2021-05-16 20:24:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-16 20:24:49] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/29 places, 17/22 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-08 finished in 1855 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&(p1||F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Implicit Places using invariants in 49 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:24:49] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 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:24:49] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), p0, true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LEQ s10 s19) (LEQ 2 s24)), p0:(GT s0 s21)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2687 reset in 104 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-09 finished in 471 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||X(X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:50] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:50] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:50] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 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:24:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s10 s4) (LEQ s8 s10)), p1:(LEQ s10 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33378 reset in 96 ms.
Product exploration explored 100000 steps with 33240 reset in 117 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33314 reset in 162 ms.
Product exploration explored 100000 steps with 33254 reset in 155 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 28 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 28 transition count 22
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 22
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 25 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 25 transition count 19
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 13 place count 25 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 24 transition count 18
Performed 1 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 1 rules applied. Total rules applied 16 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 6 ms. Remains 24 /28 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 20:24:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
[2021-05-16 20:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 20:24:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/28 places, 18/22 transitions.
Product exploration explored 100000 steps with 33281 reset in 191 ms.
Product exploration explored 100000 steps with 33424 reset in 241 ms.
[2021-05-16 20:24:51] [INFO ] Flatten gal took : 3 ms
[2021-05-16 20:24:51] [INFO ] Flatten gal took : 3 ms
[2021-05-16 20:24:51] [INFO ] Time to serialize gal into /tmp/LTL17934636479286211325.gal : 2 ms
[2021-05-16 20:24:51] [INFO ] Time to serialize properties into /tmp/LTL11033536853144561460.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/LTL17934636479286211325.gal, -t, CGAL, -LTL, /tmp/LTL11033536853144561460.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/LTL17934636479286211325.gal -t CGAL -LTL /tmp/LTL11033536853144561460.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("((F6P<=Ru5P)||(GAP<=F6P))"))||(X(X(F("(F6P<=Ru5P)")))))))
Formula 0 simplified : !G(G"((F6P<=Ru5P)||(GAP<=F6P))" | XXF"(F6P<=Ru5P)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
68 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.682275,28684,1,0,96,58399,76,42,977,68429,163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000010-10 finished in 2609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:52] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:52] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:52] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 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:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s12 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 7 edges and 29 vertex of which 2 / 29 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 28 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 28 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 25 transition count 18
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 25 transition count 18
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 14 place count 25 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 24 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 24 transition count 17
Performed 1 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 1 rules applied. Total rules applied 17 place count 24 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 13 ms. Remains 24 /29 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 24 cols
[2021-05-16 20:24:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
[2021-05-16 20:24:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-16 20:24:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:24:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/29 places, 17/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
[2021-05-16 20:24:54] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:24:54] [INFO ] Flatten gal took : 6 ms
[2021-05-16 20:24:54] [INFO ] Time to serialize gal into /tmp/LTL5340596306620373809.gal : 1 ms
[2021-05-16 20:24:54] [INFO ] Time to serialize properties into /tmp/LTL5237559356719772153.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/LTL5340596306620373809.gal, -t, CGAL, -LTL, /tmp/LTL5237559356719772153.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/LTL5340596306620373809.gal -t CGAL -LTL /tmp/LTL5237559356719772153.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(G6P<=NADH)")))
Formula 0 simplified : !X"(G6P<=NADH)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
95 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.965009,28024,1,0,44,57945,62,25,982,60592,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000010-12 finished in 2757 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:55] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:55] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 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:24:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-13 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s27 s7)], 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 21 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-13 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 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 31 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 30 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 2 with 5 rules applied. Total rules applied 8 place count 27 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 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 6 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:24:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:24:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:24:55] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 2, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
[2021-05-16 20:24:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2021-05-16 20:24:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 17/22 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 1 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 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 3 with 2 rules applied. Total rules applied 6 place count 18 transition count 14
Applied a total of 6 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 20:24:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 20:24:55] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 20:24:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 20:24:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 20:24:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-14 finished in 212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p0))&&F(p1)&&(p2||X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:55] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:24:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:24:55] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:24:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:24:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 28/32 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:24:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:24:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s3), p1:(LEQ s7 s17), p2:(LEQ 3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-15 finished in 601 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621196697643

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

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