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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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.3K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:56 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-C0001N0000001000-00
FORMULA_NAME GPPP-PT-C0001N0000001000-01
FORMULA_NAME GPPP-PT-C0001N0000001000-02
FORMULA_NAME GPPP-PT-C0001N0000001000-03
FORMULA_NAME GPPP-PT-C0001N0000001000-04
FORMULA_NAME GPPP-PT-C0001N0000001000-05
FORMULA_NAME GPPP-PT-C0001N0000001000-06
FORMULA_NAME GPPP-PT-C0001N0000001000-07
FORMULA_NAME GPPP-PT-C0001N0000001000-08
FORMULA_NAME GPPP-PT-C0001N0000001000-09
FORMULA_NAME GPPP-PT-C0001N0000001000-10
FORMULA_NAME GPPP-PT-C0001N0000001000-11
FORMULA_NAME GPPP-PT-C0001N0000001000-12
FORMULA_NAME GPPP-PT-C0001N0000001000-13
FORMULA_NAME GPPP-PT-C0001N0000001000-14
FORMULA_NAME GPPP-PT-C0001N0000001000-15

=== Now, execution of the tool begins

BK_START 1621201943471

Running Version 0
[2021-05-16 21:52:26] [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 21:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 21:52:26] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-16 21:52:26] [INFO ] Transformed 33 places.
[2021-05-16 21:52:26] [INFO ] Transformed 22 transitions.
[2021-05-16 21:52:26] [INFO ] Parsed PT model containing 33 places and 22 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 21:52:26] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000001000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 21:52:26] [INFO ] Computed 13 place invariants in 9 ms
[2021-05-16 21:52:26] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 21:52:26] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-16 21:52:26] [INFO ] Implicit Places using invariants in 52 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:52:26] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:52:26] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 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 21:52:26] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 21:52:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 21:52:27] [INFO ] Flatten gal took : 43 ms
[2021-05-16 21:52:27] [INFO ] Flatten gal took : 13 ms
[2021-05-16 21:52:27] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 25) seen :17
Running SMT prover for 8 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:52:27] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-16 21:52:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:52:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:27] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-16 21:52:27] [INFO ] Computed and/alt/rep : 21/41/21 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 21:52:27] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-16 21:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-16 21:52:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:52:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 66 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-16 21:52:28] [INFO ] Computed and/alt/rep : 21/41/21 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 21:52:28] [INFO ] Added : 21 causal constraints over 5 iterations in 82 ms. Result :sat
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 21:52:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:52:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:52:28] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-16 21:52:28] [INFO ] Computed and/alt/rep : 21/41/21 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 21:52:28] [INFO ] Added : 21 causal constraints over 5 iterations in 46 ms. Result :sat
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-16 21:52:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2021-05-16 21:52:28] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0001N0000001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 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 31 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 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 33 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 21:52:28] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:52:28] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 21:52:28] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-16 21:52:28] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
[2021-05-16 21:52:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 21:52:28] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-16 21:52:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 18/32 places, 13/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 12
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 12
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 11
Applied a total of 4 rules in 6 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 16 cols
[2021-05-16 21:52:28] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 21:52:28] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2021-05-16 21:52:28] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 21:52:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:52:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s13 s1)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-00 finished in 496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], 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 4 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.
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 31 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 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 6 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 21:52:29] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 21:52:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 21:52:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 21:52:29] [INFO ] Implicit Places using invariants in 44 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
[2021-05-16 21:52:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-16 21:52:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:52:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 16/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 23 transition count 15
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 22 transition count 15
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 21:52:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:52:29] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 21:52:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 21:52:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-01 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}]], initial=1, aps=[p0:(OR (LEQ s11 s3) (AND (LEQ 2 s0) (LEQ 3 s17)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 403 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
[2021-05-16 21:52:30] [INFO ] Flatten gal took : 4 ms
[2021-05-16 21:52:30] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:52:30] [INFO ] Time to serialize gal into /tmp/LTL18152303168448466455.gal : 75 ms
[2021-05-16 21:52:30] [INFO ] Time to serialize properties into /tmp/LTL15730426219882378604.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/LTL18152303168448466455.gal, -t, CGAL, -LTL, /tmp/LTL15730426219882378604.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/LTL18152303168448466455.gal -t CGAL -LTL /tmp/LTL15730426219882378604.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((FBP<=GSSG)||((Pi>=2)&&(b2>=3)))")))
Formula 0 simplified : !G"((FBP<=GSSG)||((Pi>=2)&&(b2>=3)))"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/14/1/15
Detected timeout of ITS tools.
[2021-05-16 21:52:45] [INFO ] Flatten gal took : 5 ms
[2021-05-16 21:52:45] [INFO ] Applying decomposition
[2021-05-16 21:52:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15011634987548678300.txt, -o, /tmp/graph15011634987548678300.bin, -w, /tmp/graph15011634987548678300.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15011634987548678300.bin, -l, -1, -v, -w, /tmp/graph15011634987548678300.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:52:45] [INFO ] Decomposing Gal with order
[2021-05-16 21:52:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:52:45] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 21:52:45] [INFO ] Flatten gal took : 50 ms
[2021-05-16 21:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 21:52:45] [INFO ] Time to serialize gal into /tmp/LTL12468836653553756584.gal : 2 ms
[2021-05-16 21:52:45] [INFO ] Time to serialize properties into /tmp/LTL4049994945126356928.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/LTL12468836653553756584.gal, -t, CGAL, -LTL, /tmp/LTL4049994945126356928.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/LTL12468836653553756584.gal -t CGAL -LTL /tmp/LTL4049994945126356928.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((gu1.FBP<=gu1.GSSG)||((gi1.gu3.Pi>=2)&&(gi1.gu4.b2>=3)))")))
Formula 0 simplified : !G"((gu1.FBP<=gu1.GSSG)||((gi1.gu3.Pi>=2)&&(gi1.gu4.b2>=3)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11417393707070359118
[2021-05-16 21:53:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11417393707070359118
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11417393707070359118]
Compilation finished in 365 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11417393707070359118]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin11417393707070359118]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000001000-01 finished in 46842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||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 21:53:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:53:15] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 21:53:15] [INFO ] Implicit Places using invariants in 44 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 45 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:53:15] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 21:53:15] [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 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 21:53:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-02 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}]], initial=1, aps=[p1:(LEQ 2 s12), p0:(LEQ s1 s24)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
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.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 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 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 4 place count 27 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 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 24 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 24 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 24 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 23 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 23 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 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 9 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 21:53:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:53:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
[2021-05-16 21:53:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 21:53:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:53:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/28 places, 17/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 486 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
[2021-05-16 21:53:18] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:53:18] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:53:18] [INFO ] Time to serialize gal into /tmp/LTL14919365415623216639.gal : 2 ms
[2021-05-16 21:53:18] [INFO ] Time to serialize properties into /tmp/LTL16658451846219203369.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/LTL14919365415623216639.gal, -t, CGAL, -LTL, /tmp/LTL16658451846219203369.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/LTL14919365415623216639.gal -t CGAL -LTL /tmp/LTL16658451846219203369.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(NADPH<=a1)")||(G("(FBP>=2)")))))
Formula 0 simplified : !X("(NADPH<=a1)" | G"(FBP>=2)")
Detected timeout of ITS tools.
[2021-05-16 21:53:33] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:53:33] [INFO ] Applying decomposition
[2021-05-16 21:53:33] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4862642782471603040.txt, -o, /tmp/graph4862642782471603040.bin, -w, /tmp/graph4862642782471603040.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4862642782471603040.bin, -l, -1, -v, -w, /tmp/graph4862642782471603040.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:53:33] [INFO ] Decomposing Gal with order
[2021-05-16 21:53:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:53:33] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-16 21:53:33] [INFO ] Flatten gal took : 9 ms
[2021-05-16 21:53:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 21:53:33] [INFO ] Time to serialize gal into /tmp/LTL10961855187620215525.gal : 3 ms
[2021-05-16 21:53:33] [INFO ] Time to serialize properties into /tmp/LTL14243724195101222538.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/LTL10961855187620215525.gal, -t, CGAL, -LTL, /tmp/LTL14243724195101222538.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/LTL10961855187620215525.gal -t CGAL -LTL /tmp/LTL14243724195101222538.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu0.NADPH<=gu0.a1)")||(G("(gi1.gi0.gu4.FBP>=2)")))))
Formula 0 simplified : !X("(gu0.NADPH<=gu0.a1)" | G"(gi1.gi0.gu4.FBP>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2560984097777634175
[2021-05-16 21:53:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2560984097777634175
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2560984097777634175]
Compilation finished in 215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2560984097777634175]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2560984097777634175]
LTSmin run took 356 ms.
FORMULA GPPP-PT-C0001N0000001000-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-02 finished in 33143 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 4 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.
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 31 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 29 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 29 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 28 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 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 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 22 transition count 14
Applied a total of 17 rules in 7 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 21:53:48] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 21:53:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 21:53:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 46 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
[2021-05-16 21:53:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 21:53:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 18/32 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 21:53:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 21:53:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s11) (LEQ 1 s7))], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-04 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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.
Graph (trivial) has 4 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.
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 31 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 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 5 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 21:53:49] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 21:53:49] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 45 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
[2021-05-16 21:53:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 21:53:49] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 18/32 places, 13/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 12
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 12
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 11
Applied a total of 4 rules in 3 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 16 cols
[2021-05-16 21:53:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2021-05-16 21:53:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-05 finished in 244 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 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.
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 31 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 29 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 29 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 28 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 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 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 22 transition count 14
Applied a total of 17 rules in 8 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 21:53:49] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 21:53:49] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
[2021-05-16 21:53:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 21:53:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 18/32 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 6 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 21:53:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 21:53:49] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-16 21:53:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-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:(LEQ s1 s7)], 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 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-07 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (G(p0)||(F(p2)&&p1))) U X(p3)))], 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 21:53:49] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:53:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:53:49] [INFO ] Implicit Places using invariants in 39 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:53:49] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 40 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 21:53:49] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-16 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 457 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GT 3 s3) (GT s4 s2)), p0:(GT s4 s2), p2:(GT 1 s15), p3:(OR (GT 3 s3) (GT s28 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-08 finished in 649 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&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 21:53:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:53:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:53:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:53:50] [INFO ] Implicit Places using invariants in 94 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:53:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 21:53:50] [INFO ] Dead Transitions using invariants and state equation in 38 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 21:53:50] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:53:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s23), p0:(LEQ s9 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20467 reset in 111 ms.
Product exploration explored 100000 steps with 20522 reset in 202 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20460 reset in 103 ms.
Product exploration explored 100000 steps with 20551 reset in 153 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (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.
Graph (trivial) has 7 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 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 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 4 place count 27 transition count 21
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 21
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 25 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 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 12 place count 25 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 24 transition count 18
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 24 transition count 18
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 15 place count 24 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 15 rules in 5 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 21:53:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 21:53:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
[2021-05-16 21:53:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 21:53:51] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:53:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/28 places, 18/22 transitions.
Product exploration explored 100000 steps with 25437 reset in 216 ms.
Product exploration explored 100000 steps with 25306 reset in 165 ms.
[2021-05-16 21:53:52] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:53:52] [INFO ] Flatten gal took : 2 ms
[2021-05-16 21:53:52] [INFO ] Time to serialize gal into /tmp/LTL5410516521674977653.gal : 1 ms
[2021-05-16 21:53:52] [INFO ] Time to serialize properties into /tmp/LTL8063335986009349607.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/LTL5410516521674977653.gal, -t, CGAL, -LTL, /tmp/LTL8063335986009349607.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/LTL5410516521674977653.gal -t CGAL -LTL /tmp/LTL8063335986009349607.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(E4P<=Pyr)")&&(F("(b2>=2)"))))))
Formula 0 simplified : !XF("(E4P<=Pyr)" & F"(b2>=2)")
Detected timeout of ITS tools.
[2021-05-16 21:54:07] [INFO ] Flatten gal took : 7 ms
[2021-05-16 21:54:07] [INFO ] Applying decomposition
[2021-05-16 21:54:07] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14766358752693099425.txt, -o, /tmp/graph14766358752693099425.bin, -w, /tmp/graph14766358752693099425.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14766358752693099425.bin, -l, -1, -v, -w, /tmp/graph14766358752693099425.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:54:07] [INFO ] Decomposing Gal with order
[2021-05-16 21:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:54:07] [INFO ] Removed a total of 5 redundant transitions.
[2021-05-16 21:54:07] [INFO ] Flatten gal took : 9 ms
[2021-05-16 21:54:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 21:54:07] [INFO ] Time to serialize gal into /tmp/LTL17417511943940385820.gal : 2 ms
[2021-05-16 21:54:07] [INFO ] Time to serialize properties into /tmp/LTL4960286596637486280.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/LTL17417511943940385820.gal, -t, CGAL, -LTL, /tmp/LTL4960286596637486280.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/LTL17417511943940385820.gal -t CGAL -LTL /tmp/LTL4960286596637486280.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu3.E4P<=gu3.Pyr)")&&(F("(gi1.gi2.gu8.b2>=2)"))))))
Formula 0 simplified : !XF("(gu3.E4P<=gu3.Pyr)" & F"(gi1.gi2.gu8.b2>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11598892330579968131
[2021-05-16 21:54:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11598892330579968131
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11598892330579968131]
Compilation finished in 221 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11598892330579968131]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11598892330579968131]
LTSmin run took 338 ms.
FORMULA GPPP-PT-C0001N0000001000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-09 finished in 32665 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(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.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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 31 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 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
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 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 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 23 place count 18 transition count 12
Applied a total of 23 rules in 9 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 21:54:23] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:54:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 21:54:23] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 21:54:23] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
[2021-05-16 21:54:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 21:54:23] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 21:54:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 16/32 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 3 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 21:54:23] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-16 21:54:23] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 21:54:23] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 21:54:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:54:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/32 places, 10/22 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s8)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-14 finished in 207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0&&(p1 U (p2||G(p1))))||F(((p3&&X(p4))||G(p4)))) U ((!p0&&((p0&&(p1 U (p2||G(p1))))||F(((p3&&X(p4))||G(p4)))))||G(((p0&&(p1 U (p2||G(p1))))||F(((p3&&X(p4))||G(p4))))))))], 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 21:54:23] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 21:54:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 21:54:23] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 21:54:23] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:54:23] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:54:23] [INFO ] Dead Transitions using invariants and state equation in 32 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 21:54:23] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:54:23] [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 138 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p4), (NOT p4)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p4), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p4), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s17), p3:(GT 3 s14), p2:(AND (GT 2 s17) (GT 1 s3)), p1:(GT 1 s3), p4:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6405 reset in 218 ms.
Stack based approach found an accepted trace after 3235 steps with 198 reset with depth 27 and stack size 25 in 5 ms.
FORMULA GPPP-PT-C0001N0000001000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-15 finished in 534 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10949967581135049054
[2021-05-16 21:54:23] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-16 21:54:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 21:54:23] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-16 21:54:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 21:54:23] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-16 21:54:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 21:54:23] [INFO ] Applying decomposition
[2021-05-16 21:54:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10949967581135049054
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10949967581135049054]
[2021-05-16 21:54:23] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8397135809040533860.txt, -o, /tmp/graph8397135809040533860.bin, -w, /tmp/graph8397135809040533860.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8397135809040533860.bin, -l, -1, -v, -w, /tmp/graph8397135809040533860.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:54:23] [INFO ] Decomposing Gal with order
[2021-05-16 21:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:54:23] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-16 21:54:23] [INFO ] Flatten gal took : 9 ms
[2021-05-16 21:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 21:54:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality3436086799044364633.gal : 2 ms
[2021-05-16 21:54:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality6253091117579318367.ltl : 3 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/LTLCardinality3436086799044364633.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6253091117579318367.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/LTLCardinality3436086799044364633.gal -t CGAL -LTL /tmp/LTLCardinality6253091117579318367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((gu5.FBP<=gu5.GSSG)||((gi0.gi0.gu0.Pi>=2)&&(gi0.gi1.gu8.b2>=3)))")))
Formula 0 simplified : !G"((gu5.FBP<=gu5.GSSG)||((gi0.gi0.gu0.Pi>=2)&&(gi0.gi1.gu8.b2>=3)))"
Compilation finished in 256 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10949967581135049054]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin10949967581135049054]
LTSmin run took 60372 ms.
FORMULA GPPP-PT-C0001N0000001000-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621202125502

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

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