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.r140-tall-162089127300133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeoElection-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127300133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 32K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 81K 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 NeoElection-COL-4-00
FORMULA_NAME NeoElection-COL-4-01
FORMULA_NAME NeoElection-COL-4-02
FORMULA_NAME NeoElection-COL-4-03
FORMULA_NAME NeoElection-COL-4-04
FORMULA_NAME NeoElection-COL-4-05
FORMULA_NAME NeoElection-COL-4-06
FORMULA_NAME NeoElection-COL-4-07
FORMULA_NAME NeoElection-COL-4-08
FORMULA_NAME NeoElection-COL-4-09
FORMULA_NAME NeoElection-COL-4-10
FORMULA_NAME NeoElection-COL-4-11
FORMULA_NAME NeoElection-COL-4-12
FORMULA_NAME NeoElection-COL-4-13
FORMULA_NAME NeoElection-COL-4-14
FORMULA_NAME NeoElection-COL-4-15

=== Now, execution of the tool begins

BK_START 1620932022071

Running Version 0
[2021-05-13 18:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-13 18:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:53:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-13 18:53:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-13 18:53:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 700 ms
[2021-05-13 18:53:44] [INFO ] Detected 4 constant HL places corresponding to 115 PT places.
[2021-05-13 18:53:44] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 18:53:45] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions in 3 ms.
[2021-05-13 18:53:45] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13621906866806987354.dot
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-13 18:53:45] [INFO ] Flatten gal took : 13 ms
[2021-05-13 18:53:45] [INFO ] Flatten gal took : 2 ms
[2021-05-13 18:53:45] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 2214 transitions in 64 ms.
[2021-05-13 18:53:45] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_3990686157336764809.dot
[2021-05-13 18:53:45] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 1687 places in 9 ms
Reduce places removed 1699 places and 2087 transitions.
Reduce places removed 9 places and 0 transitions.
FORMULA NeoElection-COL-4-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Applied a total of 12 rules in 18 ms. Remains 110 /122 variables (removed 12) and now considering 127/127 (removed 0) transitions.
[2021-05-13 18:53:45] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 110 cols
[2021-05-13 18:53:45] [INFO ] Computed 23 place invariants in 24 ms
[2021-05-13 18:53:45] [INFO ] Implicit Places using invariants in 173 ms returned [10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 210 ms to find 12 implicit places.
[2021-05-13 18:53:45] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 98 cols
[2021-05-13 18:53:45] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-13 18:53:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 98/122 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2021-05-13 18:53:45] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 98 cols
[2021-05-13 18:53:45] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-13 18:53:45] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/122 places, 127/127 transitions.
[2021-05-13 18:53:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 18:53:45] [INFO ] Flatten gal took : 52 ms
FORMULA NeoElection-COL-4-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:53:45] [INFO ] Flatten gal took : 46 ms
[2021-05-13 18:53:45] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 73 steps, including 0 resets, run visited all 10 properties in 5 ms. (steps per millisecond=14 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 78
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 78
Applied a total of 36 rules in 10 ms. Remains 80 /98 variables (removed 18) and now considering 78/127 (removed 49) transitions.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 80 cols
[2021-05-13 18:53:46] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 18:53:46] [INFO ] Implicit Places using invariants in 194 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 195 ms to find 4 implicit places.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2021-05-13 18:53:46] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 76/98 places, 78/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2021-05-13 18:53:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/98 places, 78/127 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s52 1)) (OR (LT s48 1) (LT s55 1)) (OR (LT s30 1) (LT s53 1)) (OR (LT s26 1) (LT s53 1)) (OR (LT s19 1) (LT s52 1)) (OR (LT s16 1) (LT s52 1)) (OR (LT s44 1) (LT s55 1)) (OR (LT s51 1) (LT s55 1)) (OR (LT s22 1) (LT s53 1)) (OR (LT s40 1) (LT s54 1)) (OR (LT s37 1) (LT s54 1)) (OR (LT s33 1) (LT s54 1))), p1:(OR (AND (GEQ s12 1) (GEQ s52 1)) (AND (GEQ s48 1) (GEQ s55 1)) (AND (GEQ s30 1) (GEQ s53 1)) (AND (GEQ s26 1) (GEQ s53 1)) (AND (GEQ s19 1) (GEQ s52 1)) (AND (GEQ s16 1) (GEQ s52 1)) (AND (GEQ s44 1) (GEQ s55 1)) (AND (GEQ s51 1) (GEQ s55 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s40 1) (GEQ s54 1)) (AND (GEQ s37 1) (GEQ s54 1)) (AND (GEQ s33 1) (GEQ s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 3 ms.
FORMULA NeoElection-COL-4-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-01 finished in 589 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 78
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 78
Applied a total of 36 rules in 5 ms. Remains 80 /98 variables (removed 18) and now considering 78/127 (removed 49) transitions.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 80 cols
[2021-05-13 18:53:46] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 18:53:46] [INFO ] Implicit Places using invariants in 47 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2021-05-13 18:53:46] [INFO ] Computed 7 place invariants in 17 ms
[2021-05-13 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 76/98 places, 78/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2021-05-13 18:53:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2021-05-13 18:53:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/98 places, 78/127 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s60 1) (GEQ s63 1) (GEQ s61 1) (GEQ s62 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 7845 reset in 268 ms.
Product exploration explored 100000 steps with 7873 reset in 209 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7839 reset in 165 ms.
Product exploration explored 100000 steps with 7825 reset in 157 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 78/78 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 76 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 76 transition count 78
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 12 rules in 33 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2021-05-13 18:53:47] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 18:53:47] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2021-05-13 18:53:47] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 18:53:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 78/78 transitions.
Product exploration explored 100000 steps with 19149 reset in 410 ms.
Product exploration explored 100000 steps with 19140 reset in 234 ms.
[2021-05-13 18:53:48] [INFO ] Flatten gal took : 7 ms
[2021-05-13 18:53:48] [INFO ] Flatten gal took : 6 ms
[2021-05-13 18:53:48] [INFO ] Time to serialize gal into /tmp/LTL9602459576582026581.gal : 98 ms
[2021-05-13 18:53:48] [INFO ] Time to serialize properties into /tmp/LTL9070318060997628901.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/LTL9602459576582026581.gal, -t, CGAL, -LTL, /tmp/LTL9070318060997628901.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/LTL9602459576582026581.gal -t CGAL -LTL /tmp/LTL9070318060997628901.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((P_polling_1>=1)||(P_polling_4>=1))||(P_polling_2>=1))||(P_polling_3>=1))"))))
Formula 0 simplified : !XF"((((P_polling_1>=1)||(P_polling_4>=1))||(P_polling_2>=1))||(P_polling_3>=1))"
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t13, t22, t31, t40, t49, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t119, t120, t121, t122, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/56/21/78
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
242 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,2.44125,94724,1,0,254,412459,181,130,2516,467728,325
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-4-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property NeoElection-COL-4-03 finished in 4952 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X((p1 U p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 84 transition count 82
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 84 transition count 82
Applied a total of 28 rules in 4 ms. Remains 84 /98 variables (removed 14) and now considering 82/127 (removed 45) transitions.
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 84 cols
[2021-05-13 18:53:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 18:53:51] [INFO ] Implicit Places using invariants in 59 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-13 18:53:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 18:53:51] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 80/98 places, 82/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 80 cols
[2021-05-13 18:53:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 18:53:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/98 places, 82/127 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeoElection-COL-4-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s57 1) (GEQ s58 1) (GEQ s56 1) (GEQ s59 1)), p2:(AND (OR (GEQ s67 1) (GEQ s71 1) (GEQ s75 1) (GEQ s79 1)) (OR (GEQ s57 1) (GEQ s58 1) (GEQ s56 1) (GEQ s59 1))), p1:(OR (GEQ s67 1) (GEQ s71 1) (GEQ s75 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 254 steps with 4 reset in 2 ms.
FORMULA NeoElection-COL-4-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-05 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 94 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 94 transition count 119
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 90 transition count 119
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 28 place count 76 transition count 74
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 76 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 68 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 67 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 66 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 65 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 64 transition count 62
Applied a total of 62 rules in 41 ms. Remains 64 /98 variables (removed 34) and now considering 62/127 (removed 65) transitions.
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 64 cols
[2021-05-13 18:53:51] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-13 18:53:51] [INFO ] Implicit Places using invariants in 87 ms returned [6, 7, 8, 9]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
[2021-05-13 18:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 60 cols
[2021-05-13 18:53:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 18:53:51] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 60/98 places, 62/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 18:53:51] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 18:53:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 60 cols
[2021-05-13 18:53:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/98 places, 62/127 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, p0]
Running random walk in product with property : NeoElection-COL-4-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s53 1) (GEQ s55 1) (GEQ s57 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-06 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 28 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 116
Applied a total of 10 rules in 2 ms. Remains 93 /98 variables (removed 5) and now considering 116/127 (removed 11) transitions.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 107 transitions (discarded 9 similar events)
// Phase 1: matrix 107 rows 93 cols
[2021-05-13 18:53:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 18:53:52] [INFO ] Implicit Places using invariants in 46 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 107 transitions (discarded 9 similar events)
// Phase 1: matrix 107 rows 92 cols
[2021-05-13 18:53:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 92/98 places, 116/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 107 transitions (discarded 9 similar events)
// Phase 1: matrix 107 rows 92 cols
[2021-05-13 18:53:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 92/98 places, 116/127 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s69 1) (GEQ s70 1) (GEQ s68 1) (GEQ s71 1)), p1:(OR (AND (GEQ s9 1) (GEQ s17 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s9 1) (GEQ s16 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s8 1) (GEQ s18 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s6 1) (GEQ s14 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s9 1) (GEQ s18 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s38 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s14 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s8 1) (GEQ s16 1) (GEQ s53 1) (GEQ s66 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s42 1) (GEQ s65 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s30 1) (GEQ s64 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 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-07 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 101
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 101
Applied a total of 18 rules in 1 ms. Remains 89 /98 variables (removed 9) and now considering 101/127 (removed 26) transitions.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 89 cols
[2021-05-13 18:53:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 18:53:52] [INFO ] Implicit Places using invariants in 31 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 88 cols
[2021-05-13 18:53:52] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-13 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 88/98 places, 101/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2021-05-13 18:53:52] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 88 cols
[2021-05-13 18:53:52] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-13 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/98 places, 101/127 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s14 1) (LT s43 1) (LT s66 1)) (OR (LT s14 1) (LT s47 1) (LT s66 1)) (OR (LT s18 1) (LT s59 1) (LT s67 1)) (OR (LT s13 1) (LT s43 1) (LT s66 1)) (OR (LT s11 1) (LT s32 1) (LT s65 1)) (OR (LT s17 1) (LT s59 1) (LT s67 1)) (OR (LT s15 1) (LT s47 1) (LT s66 1)) (OR (LT s10 1) (LT s32 1) (LT s65 1)) (OR (LT s16 1) (LT s59 1) (LT s67 1)) (OR (LT s16 1) (LT s63 1) (LT s67 1)) (OR (LT s17 1) (LT s63 1) (LT s67 1)) (OR (LT s16 1) (LT s55 1) (LT s67 1)) (OR (LT s12 1) (LT s32 1) (LT s65 1)) (OR (LT s13 1) (LT s47 1) (LT s66 1)) (OR (LT s18 1) (LT s55 1) (LT s67 1)) (OR (LT s15 1) (LT s43 1) (LT s66 1)) (OR (LT s18 1) (LT s63 1) (LT s67 1)) (OR (LT s17 1) (LT s55 1) (LT s67 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 149 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Support contains 18 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 101/101 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 2 place count 88 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 88 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 88 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 87 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 87 transition count 100
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 13 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 100/101 (removed 1) transitions.
[2021-05-13 18:53:53] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-13 18:53:53] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
// Phase 1: matrix 91 rows 87 cols
[2021-05-13 18:53:53] [INFO ] Computed 10 place invariants in 21 ms
[2021-05-13 18:53:53] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 100/101 transitions.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
[2021-05-13 18:53:54] [INFO ] Flatten gal took : 8 ms
[2021-05-13 18:53:54] [INFO ] Flatten gal took : 8 ms
[2021-05-13 18:53:54] [INFO ] Time to serialize gal into /tmp/LTL4287789864049232494.gal : 1 ms
[2021-05-13 18:53:54] [INFO ] Time to serialize properties into /tmp/LTL13636985755480736191.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4287789864049232494.gal, -t, CGAL, -LTL, /tmp/LTL13636985755480736191.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/LTL4287789864049232494.gal -t CGAL -LTL /tmp/LTL13636985755480736191.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((P_negotiation_52<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1))&&(((P_negotiation_52<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_49<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_40<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_67<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_58<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_34<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_64<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_64<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_67<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_64<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_43<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_49<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_58<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_67<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((P_negotiation_52<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1))&&(((P_negotiation_52<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_49<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_40<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_67<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_58<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_34<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_64<1)||(P_network_675<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_64<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_67<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_64<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_43<1)||(P_network_345<1))||(P_poll__handlingMessage_2<1)))&&(((P_negotiation_49<1)||(P_network_525<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_58<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1)))&&(((P_negotiation_70<1)||(P_network_705<1))||(P_poll__handlingMessage_4<1)))&&(((P_negotiation_67<1)||(P_network_645<1))||(P_poll__handlingMessage_4<1)))"
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t31, t33, t35, t40, t49, t51, t53, t94, t97, t98, t100, t101, t119, t120, t121, t122, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :3/63/35/101
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
531 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,5.32058,160556,1,0,236,869476,225,103,3259,750437,212
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-4-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NeoElection-COL-4-09 finished in 7931 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 94 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 94 transition count 119
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 90 transition count 119
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 34 place count 72 transition count 70
Iterating global reduction 2 with 18 rules applied. Total rules applied 52 place count 72 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 52 place count 72 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 68 transition count 66
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 76 place count 60 transition count 58
Applied a total of 76 rules in 20 ms. Remains 60 /98 variables (removed 38) and now considering 58/127 (removed 69) transitions.
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 60 cols
[2021-05-13 18:54:00] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 18:54:00] [INFO ] Implicit Places using invariants in 35 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
[2021-05-13 18:54:00] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2021-05-13 18:54:00] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 18:54:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 56/98 places, 58/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2021-05-13 18:54:00] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2021-05-13 18:54:00] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 18:54:00] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/98 places, 58/127 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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 52 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-14 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 127/127 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 96 transition count 119
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 90 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 23 place count 81 transition count 93
Iterating global reduction 2 with 9 rules applied. Total rules applied 32 place count 81 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 81 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 80 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 78 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 77 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 76 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 76 transition count 86
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 73 transition count 86
Applied a total of 46 rules in 14 ms. Remains 73 /98 variables (removed 25) and now considering 86/127 (removed 41) transitions.
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 73 cols
[2021-05-13 18:54:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 18:54:00] [INFO ] Implicit Places using invariants in 41 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
[2021-05-13 18:54:00] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 72 cols
[2021-05-13 18:54:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-13 18:54:00] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 72/98 places, 86/127 transitions.
Applied a total of 0 rules in 12 ms. Remains 72 /72 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2021-05-13 18:54:00] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-13 18:54:00] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 72 cols
[2021-05-13 18:54:00] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-13 18:54:00] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/98 places, 86/127 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : NeoElection-COL-4-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s39 1) (LT s60 1)) (OR (LT s12 1) (LT s43 1) (LT s60 1)) (OR (LT s16 1) (LT s54 1) (LT s61 1)) (OR (LT s11 1) (LT s39 1) (LT s60 1)) (OR (LT s9 1) (LT s29 1) (LT s59 1)) (OR (LT s15 1) (LT s54 1) (LT s61 1)) (OR (LT s13 1) (LT s43 1) (LT s60 1)) (OR (LT s8 1) (LT s29 1) (LT s59 1)) (OR (LT s14 1) (LT s54 1) (LT s61 1)) (OR (LT s14 1) (LT s58 1) (LT s61 1)) (OR (LT s15 1) (LT s58 1) (LT s61 1)) (OR (LT s14 1) (LT s50 1) (LT s61 1)) (OR (LT s10 1) (LT s29 1) (LT s59 1)) (OR (LT s11 1) (LT s43 1) (LT s60 1)) (OR (LT s16 1) (LT s50 1) (LT s61 1)) (OR (LT s13 1) (LT s39 1) (LT s60 1)) (OR (LT s16 1) (LT s58 1) (LT s61 1)) (OR (LT s15 1) (LT s50 1) (LT s61 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 93 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-15 finished in 214 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620932041817

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="NeoElection-COL-4"
export BK_EXAMINATION="LTLFireability"
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 NeoElection-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127300133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-4.tgz
mv NeoElection-COL-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;