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.r292-tall-162124156400404.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 HirschbergSinclair-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 33K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 160K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.0K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 333K May 12 08:13 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 HirschbergSinclair-PT-10-00
FORMULA_NAME HirschbergSinclair-PT-10-01
FORMULA_NAME HirschbergSinclair-PT-10-02
FORMULA_NAME HirschbergSinclair-PT-10-03
FORMULA_NAME HirschbergSinclair-PT-10-04
FORMULA_NAME HirschbergSinclair-PT-10-05
FORMULA_NAME HirschbergSinclair-PT-10-06
FORMULA_NAME HirschbergSinclair-PT-10-07
FORMULA_NAME HirschbergSinclair-PT-10-08
FORMULA_NAME HirschbergSinclair-PT-10-09
FORMULA_NAME HirschbergSinclair-PT-10-10
FORMULA_NAME HirschbergSinclair-PT-10-11
FORMULA_NAME HirschbergSinclair-PT-10-12
FORMULA_NAME HirschbergSinclair-PT-10-13
FORMULA_NAME HirschbergSinclair-PT-10-14
FORMULA_NAME HirschbergSinclair-PT-10-15

=== Now, execution of the tool begins

BK_START 1621284816526

Running Version 0
[2021-05-17 20:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:53:44] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-17 20:53:44] [INFO ] Transformed 260 places.
[2021-05-17 20:53:44] [INFO ] Transformed 236 transitions.
[2021-05-17 20:53:44] [INFO ] Parsed PT model containing 260 places and 236 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:53:44] [INFO ] Initial state test concluded for 5 properties.
FORMULA HirschbergSinclair-PT-10-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 251 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 244 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 244 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 239 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 239 transition count 224
Applied a total of 33 rules in 59 ms. Remains 239 /260 variables (removed 21) and now considering 224/236 (removed 12) transitions.
// Phase 1: matrix 224 rows 239 cols
[2021-05-17 20:53:44] [INFO ] Computed 15 place invariants in 19 ms
[2021-05-17 20:53:45] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 224 rows 239 cols
[2021-05-17 20:53:45] [INFO ] Computed 15 place invariants in 11 ms
[2021-05-17 20:53:45] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 239 cols
[2021-05-17 20:53:45] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 20:53:45] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 239/260 places, 224/236 transitions.
[2021-05-17 20:53:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 20:53:45] [INFO ] Flatten gal took : 50 ms
FORMULA HirschbergSinclair-PT-10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:53:45] [INFO ] Flatten gal took : 22 ms
[2021-05-17 20:53:45] [INFO ] Input system was already deterministic with 224 transitions.
Incomplete random walk after 100000 steps, including 424 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 19) seen :16
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 239 cols
[2021-05-17 20:53:46] [INFO ] Computed 15 place invariants in 5 ms
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive and 14 generalized place invariants in 10 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive and 14 generalized place invariants in 10 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using 1 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-17 20:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:53:46] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 237 transition count 128
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 142 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 141 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 136 transition count 122
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 136 transition count 122
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 2 rules applied. Total rules applied 205 place count 136 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 207 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 127 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 126 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 125 transition count 111
Applied a total of 216 rules in 100 ms. Remains 125 /239 variables (removed 114) and now considering 111/224 (removed 113) transitions.
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:53:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:53:46] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:53:46] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 20:53:46] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2021-05-17 20:53:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:53:46] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:53:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/239 places, 111/224 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-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 (GT 3 s39) (LEQ 1 s34))], 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 121 steps with 0 reset in 10 ms.
FORMULA HirschbergSinclair-PT-10-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-00 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 237 transition count 128
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 142 transition count 128
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 137 transition count 123
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 137 transition count 123
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 137 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 127 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 126 transition count 112
Applied a total of 214 rules in 73 ms. Remains 126 /239 variables (removed 113) and now considering 112/224 (removed 112) transitions.
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:47] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-17 20:53:47] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:47] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 20:53:47] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2021-05-17 20:53:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:47] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:53:47] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/239 places, 112/224 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s63 s65)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 820 reset in 321 ms.
Product exploration explored 100000 steps with 820 reset in 205 ms.
Graph (complete) has 316 edges and 126 vertex of which 116 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 820 reset in 131 ms.
Product exploration explored 100000 steps with 819 reset in 204 ms.
[2021-05-17 20:53:48] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:53:48] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:53:48] [INFO ] Time to serialize gal into /tmp/LTL10778671099927028260.gal : 3 ms
[2021-05-17 20:53:48] [INFO ] Time to serialize properties into /tmp/LTL3649537454403503892.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/LTL10778671099927028260.gal, -t, CGAL, -LTL, /tmp/LTL3649537454403503892.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/LTL10778671099927028260.gal -t CGAL -LTL /tmp/LTL3649537454403503892.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(rcv_right_election_10_3_2_8<=rcv_right_election_10_3_3_7)"))))
Formula 0 simplified : !FG"(rcv_right_election_10_3_2_8<=rcv_right_election_10_3_3_7)"
Reverse transition relation is NOT exact ! Due to transitions t12.t13, t18.t19, t22.t23, t27.t28, t31.t32, t35.t36, t41.t42, t45.t46, t192.t193, t212.t213, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/102/10/112
Computing Next relation with stutter on 2.34375e+07 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
263 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.65569,111104,1,0,877,471306,254,780,3520,461871,2046
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-10-01 finished in 4474 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 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 237 transition count 127
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 141 transition count 127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 137 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 137 transition count 123
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 137 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 127 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 126 transition count 112
Applied a total of 214 rules in 74 ms. Remains 126 /239 variables (removed 113) and now considering 112/224 (removed 112) transitions.
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:51] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:53:51] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:51] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:53:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2021-05-17 20:53:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2021-05-17 20:53:51] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:53:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/239 places, 112/224 transitions.
Stuttering acceptance computed with spot in 5549 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 827 reset in 123 ms.
Product exploration explored 100000 steps with 826 reset in 129 ms.
Graph (complete) has 317 edges and 126 vertex of which 116 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 827 reset in 115 ms.
Product exploration explored 100000 steps with 827 reset in 130 ms.
[2021-05-17 20:53:58] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:53:58] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:53:58] [INFO ] Time to serialize gal into /tmp/LTL6958707842570148556.gal : 1 ms
[2021-05-17 20:53:58] [INFO ] Time to serialize properties into /tmp/LTL17139575461343857697.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/LTL6958707842570148556.gal, -t, CGAL, -LTL, /tmp/LTL17139575461343857697.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/LTL6958707842570148556.gal -t CGAL -LTL /tmp/LTL17139575461343857697.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(rcv_left_reply_2_0_2<1)"))))
Formula 0 simplified : !FG"(rcv_left_reply_2_0_2<1)"
Reverse transition relation is NOT exact ! Due to transitions t17, t18.t19, t22.t23, t27.t28, t31.t32, t35.t36, t41.t42, t45.t46, t192.t193, t212.t213, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/102/10/112
Computing Next relation with stutter on 2.8125e+07 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
690 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,6.9173,210576,1,0,1106,1.01057e+06,254,882,3510,1.10909e+06,2179
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HirschbergSinclair-PT-10-03 finished in 14795 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 230 transition count 216
Applied a total of 17 rules in 14 ms. Remains 230 /239 variables (removed 9) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:10] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:10] [INFO ] Computed 14 place invariants in 10 ms
[2021-05-17 20:54:10] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:10] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/224 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s2 s197), p0:(AND (LEQ s2 s197) (LEQ 1 s179))], 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 9679 reset in 262 ms.
Product exploration explored 100000 steps with 9764 reset in 291 ms.
Graph (complete) has 439 edges and 230 vertex of which 220 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9911 reset in 219 ms.
Product exploration explored 100000 steps with 9796 reset in 236 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 230/230 places, 216/216 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 230 transition count 216
Deduced a syphon composed of 94 places in 1 ms
Applied a total of 94 rules in 28 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2021-05-17 20:54:12] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:12] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:54:12] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Product exploration explored 100000 steps with 10447 reset in 421 ms.
Product exploration explored 100000 steps with 10436 reset in 382 ms.
[2021-05-17 20:54:13] [INFO ] Flatten gal took : 13 ms
[2021-05-17 20:54:13] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:54:13] [INFO ] Time to serialize gal into /tmp/LTL11446316090624442271.gal : 3 ms
[2021-05-17 20:54:13] [INFO ] Time to serialize properties into /tmp/LTL3793957384045834786.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/LTL11446316090624442271.gal, -t, CGAL, -LTL, /tmp/LTL3793957384045834786.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/LTL11446316090624442271.gal -t CGAL -LTL /tmp/LTL3793957384045834786.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((init2<=rcv_right_election_10_4_8_2)&&(reply_10_3_to_left_1>=1))"))||(F("(init2<=rcv_right_election_10_4_8_2)")))))
Formula 0 simplified : !X(G"((init2<=rcv_right_election_10_4_8_2)&&(reply_10_3_to_left_1>=1))" | F"(init2<=rcv_right_election_10_4_8_2)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t19, t21, t23, t25, t28, t30, t32, t34, t36, t38, t42, t44, t46, t48, t193, t213, t223, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/30/216
Detected timeout of ITS tools.
[2021-05-17 20:54:28] [INFO ] Flatten gal took : 42 ms
[2021-05-17 20:54:28] [INFO ] Applying decomposition
[2021-05-17 20:54:28] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17514440341847211239.txt, -o, /tmp/graph17514440341847211239.bin, -w, /tmp/graph17514440341847211239.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17514440341847211239.bin, -l, -1, -v, -w, /tmp/graph17514440341847211239.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:54:28] [INFO ] Decomposing Gal with order
[2021-05-17 20:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:54:28] [INFO ] Removed a total of 23 redundant transitions.
[2021-05-17 20:54:28] [INFO ] Flatten gal took : 54 ms
[2021-05-17 20:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 20:54:28] [INFO ] Time to serialize gal into /tmp/LTL5675010179476705574.gal : 3 ms
[2021-05-17 20:54:28] [INFO ] Time to serialize properties into /tmp/LTL3311389382175915517.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/LTL5675010179476705574.gal, -t, CGAL, -LTL, /tmp/LTL3311389382175915517.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/LTL5675010179476705574.gal -t CGAL -LTL /tmp/LTL3311389382175915517.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu1.init2<=gu1.rcv_right_election_10_4_8_2)&&(gi1.gi2.gu10.reply_10_3_to_left_1>=1))"))||(F("(gu1.init2<=gu1.rcv_right_election_10_4_8_2)")))))
Formula 0 simplified : !X(G"((gu1.init2<=gu1.rcv_right_election_10_4_8_2)&&(gi1.gi2.gu10.reply_10_3_to_left_1>=1))" | F"(gu1.init2<=gu1.rcv_right_election_10_4_8_2)")
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gu3.t19, gi1.gi0.gu3.t25, gi1.gi0.gu4.t23, gi1.gi0.gu4.t30, gi1.gi0.t3, gi1.gi1.gu6.t32, gi1.gi1.gu6.t38, gi1.gi1.gu7.t42, gi1.gi1.gu11.t28, gi1.gi1.gu11.t34, gi1.gi1.gu12.t36, gi1.gi1.gu12.t44, gi1.gi1.t5, gi1.gi1.t6, gi1.gi1.t7, gi1.gi1.t48, gi1.gi2.gu2.t13, gi1.gi2.gu8.t46, gi1.gi2.gu8.t213, gi1.gi2.gu10.t11, gi1.gi2.t0, gi1.gi2.t9, gi1.gi2.t15, gi1.gi2.t193, gi1.gi2.t223, gi1.t21, gi1.t8, gi1.t4, gi1.t2, t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/30/216
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3830988735159445829
[2021-05-17 20:54:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3830988735159445829
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3830988735159445829]
Compilation finished in 935 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3830988735159445829]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3830988735159445829]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-10-04 finished in 59922 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((G(p1) U (p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 233 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 233 transition count 218
Applied a total of 12 rules in 18 ms. Remains 233 /239 variables (removed 6) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 233 cols
[2021-05-17 20:55:06] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 20:55:06] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 218 rows 233 cols
[2021-05-17 20:55:06] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 20:55:06] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 233 cols
[2021-05-17 20:55:06] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 20:55:06] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/239 places, 218/224 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s17 s146), p1:(LEQ s56 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 55 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-07 finished in 665 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 230 transition count 216
Applied a total of 17 rules in 13 ms. Remains 230 /239 variables (removed 9) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:06] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:07] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:55:07] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:55:07] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/224 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s141 s110)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Product exploration explored 100000 steps with 25000 reset in 259 ms.
Graph (complete) has 439 edges and 230 vertex of which 220 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Product exploration explored 100000 steps with 25000 reset in 219 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 230/230 places, 216/216 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 230 transition count 216
Deduced a syphon composed of 94 places in 1 ms
Applied a total of 94 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2021-05-17 20:55:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:08] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Product exploration explored 100000 steps with 25000 reset in 648 ms.
Product exploration explored 100000 steps with 25000 reset in 597 ms.
[2021-05-17 20:55:10] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:55:10] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:55:10] [INFO ] Time to serialize gal into /tmp/LTL13081582165078150454.gal : 10 ms
[2021-05-17 20:55:10] [INFO ] Time to serialize properties into /tmp/LTL13046237679621909026.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/LTL13081582165078150454.gal, -t, CGAL, -LTL, /tmp/LTL13046237679621909026.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/LTL13081582165078150454.gal -t CGAL -LTL /tmp/LTL13046237679621909026.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(rcv_left_reply_10_3_7<=rcv_right_reply_10_2_2)"))))))
Formula 0 simplified : !XXXF"(rcv_left_reply_10_3_7<=rcv_right_reply_10_2_2)"
Detected timeout of ITS tools.
[2021-05-17 20:55:25] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:55:25] [INFO ] Applying decomposition
[2021-05-17 20:55:25] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12403863567637797282.txt, -o, /tmp/graph12403863567637797282.bin, -w, /tmp/graph12403863567637797282.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12403863567637797282.bin, -l, -1, -v, -w, /tmp/graph12403863567637797282.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:55:25] [INFO ] Decomposing Gal with order
[2021-05-17 20:55:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:55:25] [INFO ] Removed a total of 25 redundant transitions.
[2021-05-17 20:55:25] [INFO ] Flatten gal took : 40 ms
[2021-05-17 20:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-17 20:55:25] [INFO ] Time to serialize gal into /tmp/LTL14914629832976101405.gal : 14 ms
[2021-05-17 20:55:25] [INFO ] Time to serialize properties into /tmp/LTL6366759520179229614.ltl : 13 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/LTL14914629832976101405.gal, -t, CGAL, -LTL, /tmp/LTL6366759520179229614.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/LTL14914629832976101405.gal -t CGAL -LTL /tmp/LTL6366759520179229614.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(gu17.rcv_left_reply_10_3_7<=gu17.rcv_right_reply_10_2_2)"))))))
Formula 0 simplified : !XXXF"(gu17.rcv_left_reply_10_3_7<=gu17.rcv_right_reply_10_2_2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11078154328548749318
[2021-05-17 20:55:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11078154328548749318
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11078154328548749318]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11078154328548749318] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11078154328548749318] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-10-09 finished in 34676 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 237 transition count 129
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 143 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 142 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 138 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 138 transition count 124
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 2 rules applied. Total rules applied 201 place count 138 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 136 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 127 transition count 113
Applied a total of 212 rules in 33 ms. Remains 127 /239 variables (removed 112) and now considering 113/224 (removed 111) transitions.
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:41] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:41] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:41] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:41] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2021-05-17 20:55:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:41] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:55:42] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/239 places, 113/224 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s50 s24)], 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 122 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-10 finished in 422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 237 transition count 126
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 140 transition count 126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 135 transition count 121
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 135 transition count 121
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 207 place count 135 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 209 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 127 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 126 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 125 transition count 111
Applied a total of 217 rules in 30 ms. Remains 125 /239 variables (removed 114) and now considering 111/224 (removed 113) transitions.
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:42] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-17 20:55:42] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2021-05-17 20:55:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 111 rows 125 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/239 places, 111/224 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s2)], 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 8 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-11 finished in 324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 230 transition count 216
Applied a total of 17 rules in 8 ms. Remains 230 /239 variables (removed 9) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:42] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:55:42] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:42] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/224 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s62)], 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 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-13 finished in 554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0 U p1) U G(p1))&&F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 224/224 transitions.
Graph (complete) has 451 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 237 transition count 132
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 146 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 144 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 192 place count 139 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 197 place count 139 transition count 125
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 2 rules applied. Total rules applied 199 place count 139 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 201 place count 137 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 136 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 129 transition count 115
Applied a total of 209 rules in 53 ms. Remains 129 /239 variables (removed 110) and now considering 115/224 (removed 109) transitions.
// Phase 1: matrix 115 rows 129 cols
[2021-05-17 20:55:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:43] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 115 rows 129 cols
[2021-05-17 20:55:43] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-17 20:55:43] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2021-05-17 20:55:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 115 rows 129 cols
[2021-05-17 20:55:43] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/239 places, 115/224 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s57 s103), p0:(LEQ s124 s30), p2:(GT s0 s117)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-14 finished in 459 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9226510715452967843
[2021-05-17 20:55:43] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2021-05-17 20:55:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:55:43] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2021-05-17 20:55:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:55:43] [INFO ] Applying decomposition
[2021-05-17 20:55:43] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2021-05-17 20:55:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:55:43] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9226510715452967843
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9226510715452967843]
[2021-05-17 20:55:43] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1727317292918595771.txt, -o, /tmp/graph1727317292918595771.bin, -w, /tmp/graph1727317292918595771.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1727317292918595771.bin, -l, -1, -v, -w, /tmp/graph1727317292918595771.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:55:43] [INFO ] Decomposing Gal with order
[2021-05-17 20:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:55:43] [INFO ] Removed a total of 32 redundant transitions.
[2021-05-17 20:55:43] [INFO ] Flatten gal took : 29 ms
[2021-05-17 20:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 20:55:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality8863341121473438234.gal : 3 ms
[2021-05-17 20:55:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality4362338392347896523.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/LTLCardinality8863341121473438234.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4362338392347896523.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/LTLCardinality8863341121473438234.gal -t CGAL -LTL /tmp/LTLCardinality4362338392347896523.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X((G("((gu25.init2<=gu25.rcv_right_election_10_4_8_2)&&(gi0.gi3.gu22.reply_10_3_to_left_1>=1))"))||(F("(gu25.init2<=gu25.rcv_right_election_10_4_8_2)")))))
Formula 0 simplified : !X(G"((gu25.init2<=gu25.rcv_right_election_10_4_8_2)&&(gi0.gi3.gu22.reply_10_3_to_left_1>=1))" | F"(gu25.init2<=gu25.rcv_right_election_10_4_8_2)")
Compilation finished in 954 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9226510715452967843]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9226510715452967843]
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu0.hdl_right_election_10_4_9_1, gi0.gi0.gu1.hdl_left_election_1_0_1_2, gi0.gi0.gu1.hdl_left_reply_2_0_2, gi0.gi1.gu3.hdl_left_election_5_0_1_6, gi0.gi1.gu4.hdl_left_election_6_0_1_7, gi0.gi1.gu4.hdl_left_reply_7_0_7, gi0.gi1.gu4.hdl_right_election_8_0_1_7, gi0.gi1.gu5.hdl_left_election_7_0_1_8, gi0.gi1.start7, gi0.gi2.gu2.hdl_left_election_4_0_1_5, gi0.gi2.gu2.hdl_right_election_6_0_1_5, gi0.gi2.gu8.hdl_left_election_2_0_1_3, gi0.gi2.gu10.hdl_left_election_3_0_1_4, gi0.gi2.gu10.hdl_right_election_5_0_1_4, gi0.gi2.start3, gi0.gi2.start4, gi0.gi2.start5, gi0.gi2.reply_4_0_from_left_4, gi0.gi3.gu7.election_1_0_1_from_right_10, gi0.gi3.gu7.hdl_right_election_1_0_1_10, gi0.gi3.gu7.election_9_0_1_from_left_10, gi0.gi3.gu11.hdl_left_election_8_0_1_9, gi0.elected_10_10, gi0.hdl_left_election_10_4_9_9, gi0.hdl_right_election_3_0_1_2, gi0.start10, gi0.start9, gi0.start8, gi0.start6, gi0.start1, start2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/193/31/224
Computing Next relation with stutter on 6.48e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3392 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,33.9695,802360,1,0,744,3.92644e+06,484,431,6950,3.11954e+06,1136
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(F("(gu16.rcv_left_reply_10_3_7<=gu16.rcv_right_reply_10_2_2)"))))))
Formula 1 simplified : !XXXF"(gu16.rcv_left_reply_10_3_7<=gu16.rcv_right_reply_10_2_2)"
Computing Next relation with stutter on 6.48e+07 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 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,33.9853,802856,1,0,745,3.92698e+06,493,433,6953,3.11998e+06,1146
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621285031860

--------------------
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="HirschbergSinclair-PT-10"
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 HirschbergSinclair-PT-10, 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 r292-tall-162124156400404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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