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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.3K Mar 28 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:10 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.1K Mar 23 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:22 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 23K 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-04a-00
FORMULA_NAME FlexibleBarrier-PT-04a-01
FORMULA_NAME FlexibleBarrier-PT-04a-02
FORMULA_NAME FlexibleBarrier-PT-04a-03
FORMULA_NAME FlexibleBarrier-PT-04a-04
FORMULA_NAME FlexibleBarrier-PT-04a-05
FORMULA_NAME FlexibleBarrier-PT-04a-06
FORMULA_NAME FlexibleBarrier-PT-04a-07
FORMULA_NAME FlexibleBarrier-PT-04a-08
FORMULA_NAME FlexibleBarrier-PT-04a-09
FORMULA_NAME FlexibleBarrier-PT-04a-10
FORMULA_NAME FlexibleBarrier-PT-04a-11
FORMULA_NAME FlexibleBarrier-PT-04a-12
FORMULA_NAME FlexibleBarrier-PT-04a-13
FORMULA_NAME FlexibleBarrier-PT-04a-14
FORMULA_NAME FlexibleBarrier-PT-04a-15

=== Now, execution of the tool begins

BK_START 1621112889978

Running Version 0
[2021-05-15 21:08:13] [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-15 21:08:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:08:13] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-15 21:08:13] [INFO ] Transformed 51 places.
[2021-05-15 21:08:13] [INFO ] Transformed 88 transitions.
[2021-05-15 21:08:13] [INFO ] Found NUPN structural information;
[2021-05-15 21:08:13] [INFO ] Parsed PT model containing 51 places and 88 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 21:08:13] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 20 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:13] [INFO ] Computed 6 place invariants in 15 ms
[2021-05-15 21:08:13] [INFO ] Implicit Places using invariants in 236 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:13] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 21:08:14] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:14] [INFO ] Computed 5 place invariants in 13 ms
[2021-05-15 21:08:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/78 transitions.
[2021-05-15 21:08:14] [INFO ] Flatten gal took : 55 ms
FORMULA FlexibleBarrier-PT-04a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 21:08:14] [INFO ] Flatten gal took : 22 ms
[2021-05-15 21:08:14] [INFO ] Input system was already deterministic with 74 transitions.
Finished random walk after 284 steps, including 0 resets, run visited all 18 properties in 11 ms. (steps per millisecond=25 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Graph (trivial) has 37 edges and 50 vertex of which 9 / 50 are part of one of the 3 SCC in 10 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 42 vertex of which 22 / 42 are part of one of the 6 SCC in 1 ms
Free SCC test removed 16 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 26 transition count 63
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 35 place count 22 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 20 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 18 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 18 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 rules applied. Total rules applied 45 place count 18 transition count 30
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 49 place count 16 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 14 transition count 28
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 53 place count 13 transition count 27
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 61 place count 13 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 65 place count 12 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 68 place count 10 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 68 place count 10 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 70 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 71 place count 8 transition count 12
Iterating global reduction 9 with 1 rules applied. Total rules applied 72 place count 8 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 74 place count 8 transition count 10
Applied a total of 74 rules in 48 ms. Remains 8 /50 variables (removed 42) and now considering 10/74 (removed 64) transitions.
// Phase 1: matrix 10 rows 8 cols
[2021-05-15 21:08:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-15 21:08:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-15 21:08:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-15 21:08:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-15 21:08:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-15 21:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-15 21:08:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/50 places, 10/74 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s6 1) (OR (NEQ s4 0) (NEQ s1 1)))], 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 0 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-04a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-00 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:15] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 21:08:15] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:15] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 21:08:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-15 21:08:15] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:15] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:15] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (NEQ s27 0) (NEQ s49 1)) (NEQ s45 0) (NEQ s14 1)), p1:(AND (NEQ s45 0) (NEQ s14 1)), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-03 finished in 656 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:16] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 21:08:16] [INFO ] Implicit Places using invariants in 76 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:16] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:16] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-15 21:08:16] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s6 0) (EQ s20 1)), p0:(AND (EQ s20 0) (EQ s6 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 450 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), true]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 74/74 transitions.
Graph (trivial) has 59 edges and 49 vertex of which 40 / 49 are part of one of the 6 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 15 transition count 27
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 14 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 14 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 14 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 14 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 13 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 13 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 13 transition count 17
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 11 transition count 15
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 21 rules in 37 ms. Remains 11 /49 variables (removed 38) and now considering 15/74 (removed 59) transitions.
[2021-05-15 21:08:18] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 21:08:18] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 11 cols
[2021-05-15 21:08:18] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-15 21:08:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/49 places, 15/74 transitions.
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
[2021-05-15 21:08:19] [INFO ] Flatten gal took : 7 ms
[2021-05-15 21:08:19] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:08:19] [INFO ] Time to serialize gal into /tmp/LTL11673660828637419973.gal : 3 ms
[2021-05-15 21:08:19] [INFO ] Time to serialize properties into /tmp/LTL13511078679651359221.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/LTL11673660828637419973.gal, -t, CGAL, -LTL, /tmp/LTL13511078679651359221.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/LTL11673660828637419973.gal -t CGAL -LTL /tmp/LTL13511078679651359221.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p20==0)&&(p6==1))")U("((p6==0)||(p20==1))"))))
Formula 0 simplified : !X("((p20==0)&&(p6==1))" U "((p6==0)||(p20==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
2 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.053279,17152,1,0,6,3722,21,0,1146,883,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-04a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-04a-04 finished in 3153 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U X(p1)))&&(F(!p0) U X(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:19] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:19] [INFO ] Implicit Places using invariants in 56 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:19] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:19] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FlexibleBarrier-PT-04a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s45 1), p2:(EQ s9 1), p1:(EQ s23 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-05 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:19] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 21:08:19] [INFO ] Implicit Places using invariants in 95 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:19] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-15 21:08:20] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-15 21:08:20] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-06 finished in 654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:20] [INFO ] Implicit Places using invariants in 89 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:20] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:20] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s44 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 74/74 transitions.
Graph (trivial) has 58 edges and 49 vertex of which 40 / 49 are part of one of the 8 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 31
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 16 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 16 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 16 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 15 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 15 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 15 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 14 transition count 27
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 14 transition count 27
Deduced a syphon composed of 2 places in 1 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 14 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 13 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 13 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 20 rules in 24 ms. Remains 13 /49 variables (removed 36) and now considering 20/74 (removed 54) transitions.
[2021-05-15 21:08:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-15 21:08:22] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-15 21:08:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-15 21:08:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/49 places, 20/74 transitions.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
[2021-05-15 21:08:22] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:08:22] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:08:22] [INFO ] Time to serialize gal into /tmp/LTL6142863220435162507.gal : 6 ms
[2021-05-15 21:08:22] [INFO ] Time to serialize properties into /tmp/LTL10763528917766298621.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/LTL6142863220435162507.gal, -t, CGAL, -LTL, /tmp/LTL10763528917766298621.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/LTL6142863220435162507.gal -t CGAL -LTL /tmp/LTL10763528917766298621.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p27==0)||(p44==1))"))))
Formula 0 simplified : !XF"((p27==0)||(p44==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
4 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.058676,16932,1,0,6,3722,20,0,1136,883,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-04a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-04a-07 finished in 2543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:23] [INFO ] Implicit Places using invariants in 84 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:23] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:23] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-15 21:08:23] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s42 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][false, false]]
Product exploration explored 100000 steps with 970 reset in 212 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-11 finished in 612 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 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Graph (trivial) has 42 edges and 50 vertex of which 12 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 53 edges and 40 vertex of which 38 / 40 are part of one of the 4 SCC in 0 ms
Free SCC test removed 34 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 62
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 62 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 3 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 2 transition count 4
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 2 transition count 3
Applied a total of 67 rules in 5 ms. Remains 2 /50 variables (removed 48) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 21:08:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 21:08:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 21:08:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 21:08:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-15 21:08:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 21:08:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 21:08:23] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/50 places, 3/74 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-13 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Graph (trivial) has 41 edges and 50 vertex of which 9 / 50 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 53 edges and 42 vertex of which 34 / 42 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 14 transition count 65
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (trivial) has 13 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 53 place count 10 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 9 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 8 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 8 transition count 16
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 60 place count 8 transition count 14
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 62 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 6 transition count 13
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 68 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 69 place count 6 transition count 7
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 71 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 71 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 73 place count 4 transition count 5
Applied a total of 73 rules in 9 ms. Remains 4 /50 variables (removed 46) and now considering 5/74 (removed 69) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 21:08:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-15 21:08:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 21:08:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-15 21:08:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-15 21:08:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 21:08:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-15 21:08:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/50 places, 5/74 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s0 1), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-14 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&(p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:24] [INFO ] Implicit Places using invariants in 71 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-15 21:08:24] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 49/50 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:24] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/50 places, 74/74 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s19 0), p1:(AND (EQ s15 0) (EQ s32 1)), p2:(OR (EQ s9 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 5 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-15 finished in 527 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621112905525

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

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