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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 94K 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 FlexibleBarrier-PT-10a-00
FORMULA_NAME FlexibleBarrier-PT-10a-01
FORMULA_NAME FlexibleBarrier-PT-10a-02
FORMULA_NAME FlexibleBarrier-PT-10a-03
FORMULA_NAME FlexibleBarrier-PT-10a-04
FORMULA_NAME FlexibleBarrier-PT-10a-05
FORMULA_NAME FlexibleBarrier-PT-10a-06
FORMULA_NAME FlexibleBarrier-PT-10a-07
FORMULA_NAME FlexibleBarrier-PT-10a-08
FORMULA_NAME FlexibleBarrier-PT-10a-09
FORMULA_NAME FlexibleBarrier-PT-10a-10
FORMULA_NAME FlexibleBarrier-PT-10a-11
FORMULA_NAME FlexibleBarrier-PT-10a-12
FORMULA_NAME FlexibleBarrier-PT-10a-13
FORMULA_NAME FlexibleBarrier-PT-10a-14
FORMULA_NAME FlexibleBarrier-PT-10a-15

=== Now, execution of the tool begins

BK_START 1621127741502

Running Version 0
[2021-05-16 01:15:44] [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 01:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 01:15:44] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2021-05-16 01:15:44] [INFO ] Transformed 123 places.
[2021-05-16 01:15:44] [INFO ] Transformed 334 transitions.
[2021-05-16 01:15:44] [INFO ] Found NUPN structural information;
[2021-05-16 01:15:44] [INFO ] Parsed PT model containing 123 places and 334 transitions in 186 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 01:15:44] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2021-05-16 01:15:44] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-16 01:15:45] [INFO ] Implicit Places using invariants in 428 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:45] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 01:15:45] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Starting structural reductions, iteration 1 : 122/123 places, 242/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:45] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 01:15:45] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/252 transitions.
[2021-05-16 01:15:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 01:15:45] [INFO ] Flatten gal took : 102 ms
FORMULA FlexibleBarrier-PT-10a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 01:15:45] [INFO ] Flatten gal took : 44 ms
[2021-05-16 01:15:46] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=280 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:46] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 01:15:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1)))&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 103 edges and 122 vertex of which 27 / 122 are part of one of the 9 SCC in 11 ms
Free SCC test removed 18 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 132 edges and 102 vertex of which 83 / 102 are part of one of the 11 SCC in 0 ms
Free SCC test removed 72 places
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 5 rules applied. Total rules applied 6 place count 30 transition count 184
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 156 rules applied. Total rules applied 162 place count 21 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 164 place count 19 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 164 place count 19 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 17 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 16 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 16 transition count 33
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 3 with 3 rules applied. Total rules applied 173 place count 16 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 175 place count 14 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 179 place count 12 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 180 place count 12 transition count 27
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 187 place count 12 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 190 place count 11 transition count 18
Applied a total of 190 rules in 47 ms. Remains 11 /122 variables (removed 111) and now considering 18/242 (removed 224) transitions.
[2021-05-16 01:15:46] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-16 01:15:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 01:15:46] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-16 01:15:46] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-16 01:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 01:15:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-16 01:15:46] [INFO ] Redundant transitions in 13 ms returned [7, 8, 9]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions :[9, 8, 7]
// Phase 1: matrix 15 rows 11 cols
[2021-05-16 01:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 01:15:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 11/122 places, 15/242 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 12
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 8 transition count 9
Applied a total of 9 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 9/15 (removed 6) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 01:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 01:15:46] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 01:15:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 01:15:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/122 places, 9/242 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s0 1)), p1:(AND (NEQ s4 0) (NEQ s6 1)), p2:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-00 finished in 609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:47] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:15:47] [INFO ] Implicit Places using invariants in 149 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:47] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 01:15:47] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Starting structural reductions, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 11 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 01:15:47] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/122 places, 242/242 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s15 0) (EQ s5 1)), p1:(OR (EQ s20 0) (EQ s72 1))], 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 50000 reset in 654 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Product exploration explored 100000 steps with 50000 reset in 511 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 121/121 places, 242/242 transitions.
Graph (trivial) has 148 edges and 121 vertex of which 105 / 121 are part of one of the 13 SCC in 1 ms
Free SCC test removed 92 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 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 29 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 29 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 28 transition count 90
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 28 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 28 transition count 89
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 2 with 1 rules applied. Total rules applied 9 place count 28 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 27 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 27 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 47 place count 27 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 23 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 23 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 55 rules in 18 ms. Remains 23 /121 variables (removed 98) and now considering 40/242 (removed 202) transitions.
[2021-05-16 01:15:50] [INFO ] Redundant transitions in 18 ms returned [21, 22, 27, 28, 29]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions :[29, 28, 27, 22, 21]
[2021-05-16 01:15:50] [INFO ] Flow matrix only has 25 transitions (discarded 10 similar events)
// Phase 1: matrix 25 rows 23 cols
[2021-05-16 01:15:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 23/121 places, 35/242 transitions.
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2021-05-16 01:15:50] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-16 01:15:50] [INFO ] Flow matrix only has 25 transitions (discarded 10 similar events)
// Phase 1: matrix 25 rows 23 cols
[2021-05-16 01:15:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/121 places, 35/242 transitions.
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
[2021-05-16 01:15:51] [INFO ] Flatten gal took : 18 ms
[2021-05-16 01:15:51] [INFO ] Flatten gal took : 18 ms
[2021-05-16 01:15:51] [INFO ] Time to serialize gal into /tmp/LTL12900949011716731764.gal : 11 ms
[2021-05-16 01:15:51] [INFO ] Time to serialize properties into /tmp/LTL17353096333205283171.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/LTL12900949011716731764.gal, -t, CGAL, -LTL, /tmp/LTL17353096333205283171.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/LTL12900949011716731764.gal -t CGAL -LTL /tmp/LTL17353096333205283171.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p15==0)||(p5==1))"))||(G("((p20==0)||(p72==1))")))))
Formula 0 simplified : !X(F"((p15==0)||(p5==1))" | G"((p20==0)||(p72==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
66 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.698128,31648,1,0,6,104728,23,0,3339,13432,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-10a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-10a-02 finished in 5282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0&&X(p1))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:15:52] [INFO ] Implicit Places using invariants in 113 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Starting structural reductions, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 18 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/122 places, 242/242 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s70 1), p1:(AND (NEQ s83 0) (NEQ s28 1))], 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 8179 reset in 567 ms.
Stack based approach found an accepted trace after 32 steps with 2 reset with depth 12 and stack size 12 in 1 ms.
FORMULA FlexibleBarrier-PT-10a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-07 finished in 1193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 110 edges and 122 vertex of which 30 / 122 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 176
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 92 transition count 176
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 81 place count 62 transition count 146
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 126 place count 62 transition count 101
Applied a total of 126 rules in 27 ms. Remains 62 /122 variables (removed 60) and now considering 101/242 (removed 141) transitions.
[2021-05-16 01:15:53] [INFO ] Flow matrix only has 82 transitions (discarded 19 similar events)
// Phase 1: matrix 82 rows 62 cols
[2021-05-16 01:15:53] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 01:15:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-16 01:15:53] [INFO ] Flow matrix only has 82 transitions (discarded 19 similar events)
// Phase 1: matrix 82 rows 62 cols
[2021-05-16 01:15:53] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 01:15:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-16 01:15:53] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2021-05-16 01:15:53] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 01:15:53] [INFO ] Flow matrix only has 82 transitions (discarded 19 similar events)
// Phase 1: matrix 82 rows 62 cols
[2021-05-16 01:15:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:15:53] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/122 places, 101/242 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
[2021-05-16 01:15:55] [INFO ] Flatten gal took : 12 ms
[2021-05-16 01:15:55] [INFO ] Flatten gal took : 14 ms
[2021-05-16 01:15:55] [INFO ] Time to serialize gal into /tmp/LTL7929350885718813871.gal : 3 ms
[2021-05-16 01:15:55] [INFO ] Time to serialize properties into /tmp/LTL11078315005051188188.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/LTL7929350885718813871.gal, -t, CGAL, -LTL, /tmp/LTL11078315005051188188.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/LTL7929350885718813871.gal -t CGAL -LTL /tmp/LTL11078315005051188188.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p0==0)||(p122==1))")))
Formula 0 simplified : !F"((p0==0)||(p122==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
13 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.154649,17984,1,0,7,9606,20,2,1543,4333,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-10a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-10a-08 finished in 1932 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:55] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 01:15:55] [INFO ] Implicit Places using invariants in 156 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:55] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Starting structural reductions, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:56] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/122 places, 242/242 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (NEQ s59 0) (NEQ s1 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-09 finished in 750 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 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 107 edges and 122 vertex of which 30 / 122 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 135 edges and 100 vertex of which 91 / 100 are part of one of the 11 SCC in 0 ms
Free SCC test removed 80 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 20 transition count 183
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 176 rules applied. Total rules applied 181 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 9 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 8 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 189 place count 6 transition count 12
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 193 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 194 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 5 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 197 place count 4 transition count 6
Iterating global reduction 8 with 1 rules applied. Total rules applied 198 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 199 place count 4 transition count 5
Applied a total of 199 rules in 11 ms. Remains 4 /122 variables (removed 118) and now considering 5/242 (removed 237) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 01:15:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 01:15:56] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 01:15:56] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 01:15:56] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-16 01:15:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 01:15:56] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/122 places, 5/242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-10 finished in 147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((X(F(p2))||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 122 cols
[2021-05-16 01:15:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 01:15:56] [INFO ] Implicit Places using invariants in 102 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:56] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Starting structural reductions, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2021-05-16 01:15:56] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/122 places, 242/242 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-13 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=1, aps=[p2:(EQ s33 1), p0:(OR (EQ s33 0) (EQ s23 1)), p1:(OR (EQ s119 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30605 reset in 305 ms.
Stack based approach found an accepted trace after 891 steps with 268 reset with depth 10 and stack size 10 in 4 ms.
FORMULA FlexibleBarrier-PT-10a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-13 finished in 1207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 108 edges and 122 vertex of which 27 / 122 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 140 edges and 102 vertex of which 95 / 102 are part of one of the 11 SCC in 0 ms
Free SCC test removed 84 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 18 transition count 193
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 1 with 191 rules applied. Total rules applied 196 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 197 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 6 transition count 11
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 2 with 3 rules applied. Total rules applied 201 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 4 transition count 8
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 4 with 2 rules applied. Total rules applied 205 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 210 place count 2 transition count 3
Applied a total of 210 rules in 10 ms. Remains 2 /122 variables (removed 120) and now considering 3/242 (removed 239) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 01:15:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 01:15:57] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 01:15:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 01:15:57] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-16 01:15:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 01:15:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 01:15:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 3/242 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-14 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:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-14 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((((p0 U p1) U p2) U (G(((p0 U p1) U p2))||(((p0 U p1) U p2)&&G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 99 edges and 122 vertex of which 24 / 122 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 128 edges and 104 vertex of which 83 / 104 are part of one of the 13 SCC in 0 ms
Free SCC test removed 70 places
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 5 rules applied. Total rules applied 6 place count 34 transition count 201
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Graph (trivial) has 28 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 140 rules applied. Total rules applied 146 place count 26 transition count 69
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 25 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 23 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 23 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 5 rules applied. Total rules applied 161 place count 23 transition count 55
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 20 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 19 transition count 54
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 6 with 2 rules applied. Total rules applied 168 place count 18 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 18 transition count 52
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 187 place count 18 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 189 place count 18 transition count 32
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 193 place count 16 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 194 place count 16 transition count 30
Applied a total of 194 rules in 19 ms. Remains 16 /122 variables (removed 106) and now considering 30/242 (removed 212) transitions.
[2021-05-16 01:15:57] [INFO ] Flow matrix only has 20 transitions (discarded 10 similar events)
// Phase 1: matrix 20 rows 16 cols
[2021-05-16 01:15:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 01:15:57] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-16 01:15:57] [INFO ] Flow matrix only has 20 transitions (discarded 10 similar events)
// Phase 1: matrix 20 rows 16 cols
[2021-05-16 01:15:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-16 01:15:58] [INFO ] Redundant transitions in 73 ms returned [15, 16, 17, 18, 19, 20, 21, 22, 23, 24]
Found 10 redundant transitions using SMT.
Drop transitions removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions :[24, 23, 22, 21, 20, 19, 18, 17, 16, 15]
// Phase 1: matrix 20 rows 16 cols
[2021-05-16 01:15:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 16/122 places, 20/242 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 19
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 19
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 14 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 14 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 14 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 12 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 12 transition count 13
Applied a total of 11 rules in 8 ms. Remains 12 /16 variables (removed 4) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 12 cols
[2021-05-16 01:15:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:58] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 13 rows 12 cols
[2021-05-16 01:15:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 01:15:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/122 places, 13/242 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-15 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s8 1)), p2:(OR (EQ s4 0) (EQ s2 1)), p1:(AND (OR (EQ s4 0) (EQ s2 1)) (OR (EQ s6 0) (EQ s10 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-15 finished in 551 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621127759446

--------------------
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="FlexibleBarrier-PT-10a"
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 FlexibleBarrier-PT-10a, 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-162075331000052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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