Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331000029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-00
FORMULA_NAME FlexibleBarrier-PT-06b-01
FORMULA_NAME FlexibleBarrier-PT-06b-02
FORMULA_NAME FlexibleBarrier-PT-06b-03
FORMULA_NAME FlexibleBarrier-PT-06b-04
FORMULA_NAME FlexibleBarrier-PT-06b-05
FORMULA_NAME FlexibleBarrier-PT-06b-06
FORMULA_NAME FlexibleBarrier-PT-06b-07
FORMULA_NAME FlexibleBarrier-PT-06b-08
FORMULA_NAME FlexibleBarrier-PT-06b-09
FORMULA_NAME FlexibleBarrier-PT-06b-10
FORMULA_NAME FlexibleBarrier-PT-06b-11
FORMULA_NAME FlexibleBarrier-PT-06b-12
FORMULA_NAME FlexibleBarrier-PT-06b-13
FORMULA_NAME FlexibleBarrier-PT-06b-14
FORMULA_NAME FlexibleBarrier-PT-06b-15

=== Now, execution of the tool begins

BK_START 1621120200834

Running Version 0
[2021-05-15 23:10:04] [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-15 23:10:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:10:04] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2021-05-15 23:10:04] [INFO ] Transformed 542 places.
[2021-05-15 23:10:04] [INFO ] Transformed 621 transitions.
[2021-05-15 23:10:04] [INFO ] Found NUPN structural information;
[2021-05-15 23:10:04] [INFO ] Parsed PT model containing 542 places and 621 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 23:10:04] [INFO ] Initial state test concluded for 2 properties.
FORMULA FlexibleBarrier-PT-06b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 172 places :
Symmetric choice reduction at 0 with 172 rule applications. Total rules 172 place count 370 transition count 449
Iterating global reduction 0 with 172 rules applied. Total rules applied 344 place count 370 transition count 449
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 414 place count 300 transition count 379
Iterating global reduction 0 with 70 rules applied. Total rules applied 484 place count 300 transition count 379
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 523 place count 261 transition count 340
Iterating global reduction 0 with 39 rules applied. Total rules applied 562 place count 261 transition count 340
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 580 place count 261 transition count 322
Applied a total of 580 rules in 151 ms. Remains 261 /542 variables (removed 281) and now considering 322/621 (removed 299) transitions.
// Phase 1: matrix 322 rows 261 cols
[2021-05-15 23:10:05] [INFO ] Computed 8 place invariants in 22 ms
[2021-05-15 23:10:05] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 322 rows 261 cols
[2021-05-15 23:10:05] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-15 23:10:05] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 261 cols
[2021-05-15 23:10:05] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-15 23:10:06] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 261/542 places, 322/621 transitions.
[2021-05-15 23:10:06] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 23:10:06] [INFO ] Flatten gal took : 106 ms
FORMULA FlexibleBarrier-PT-06b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 23:10:06] [INFO ] Flatten gal took : 44 ms
[2021-05-15 23:10:06] [INFO ] Input system was already deterministic with 322 transitions.
Incomplete random walk after 100000 steps, including 1860 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 24) seen :20
Running SMT prover for 4 properties.
// Phase 1: matrix 322 rows 261 cols
[2021-05-15 23:10:07] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:10:07] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-15 23:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:07] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-15 23:10:07] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 34 ms to minimize.
[2021-05-15 23:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2021-05-15 23:10:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:10:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-15 23:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:07] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-15 23:10:08] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
[2021-05-15 23:10:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2021-05-15 23:10:08] [INFO ] Computed and/alt/rep : 319/681/319 causal constraints (skipped 2 transitions) in 50 ms.
[2021-05-15 23:10:11] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2021-05-15 23:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2021-05-15 23:10:11] [INFO ] Added : 318 causal constraints over 64 iterations in 3316 ms. Result :sat
[2021-05-15 23:10:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-15 23:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:11] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-15 23:10:11] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 4 ms to minimize.
[2021-05-15 23:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2021-05-15 23:10:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:10:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-15 23:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:12] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-15 23:10:12] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2021-05-15 23:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-15 23:10:12] [INFO ] Computed and/alt/rep : 319/681/319 causal constraints (skipped 2 transitions) in 36 ms.
[2021-05-15 23:10:15] [INFO ] Added : 318 causal constraints over 64 iterations in 2736 ms. Result :sat
[2021-05-15 23:10:15] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-15 23:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:15] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-15 23:10:15] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2021-05-15 23:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-15 23:10:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:10:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-15 23:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:15] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-15 23:10:15] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2021-05-15 23:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2021-05-15 23:10:15] [INFO ] Computed and/alt/rep : 319/681/319 causal constraints (skipped 2 transitions) in 42 ms.
[2021-05-15 23:10:18] [INFO ] Added : 318 causal constraints over 64 iterations in 2714 ms. Result :sat
[2021-05-15 23:10:18] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-15 23:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:18] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-15 23:10:18] [INFO ] Computed and/alt/rep : 319/681/319 causal constraints (skipped 2 transitions) in 39 ms.
[2021-05-15 23:10:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:10:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-15 23:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:10:19] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-15 23:10:19] [INFO ] Computed and/alt/rep : 319/681/319 causal constraints (skipped 2 transitions) in 39 ms.
[2021-05-15 23:10:21] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2021-05-15 23:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2021-05-15 23:10:22] [INFO ] Added : 319 causal constraints over 64 iterations in 2781 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X((p1||G((p2&&(p0 U p3)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 303
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 303
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 231 transition count 292
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 231 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 231 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 226 transition count 283
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 226 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 226 transition count 280
Applied a total of 77 rules in 47 ms. Remains 226 /261 variables (removed 35) and now considering 280/322 (removed 42) transitions.
// Phase 1: matrix 280 rows 226 cols
[2021-05-15 23:10:22] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 23:10:22] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 280 rows 226 cols
[2021-05-15 23:10:22] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 23:10:22] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
// Phase 1: matrix 280 rows 226 cols
[2021-05-15 23:10:22] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:10:22] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 226/261 places, 280/322 transitions.
Stuttering acceptance computed with spot in 595 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p2 p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p2 p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s126 1), p0:(EQ s219 1), p3:(EQ s95 1), p2:(EQ s219 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-00 finished in 1444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((G(((p1 U p2)||X(!p0)))||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 304
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 233 transition count 294
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 233 transition count 294
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 233 transition count 291
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 228 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 228 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 228 transition count 283
Applied a total of 72 rules in 43 ms. Remains 228 /261 variables (removed 33) and now considering 283/322 (removed 39) transitions.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:10:23] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:10:23] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:10:23] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:10:24] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:10:24] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:10:24] [INFO ] Dead Transitions using invariants and state equation in 336 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/261 places, 283/322 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), false, false, false, false]
Running random walk in product with property : FlexibleBarrier-PT-06b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s23 1), p2:(EQ s79 1), p1:(EQ s219 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1837 reset in 530 ms.
Product exploration explored 100000 steps with 1853 reset in 276 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 411 ms :[(NOT p0), (NOT p0), false, false, false, false]
Product exploration explored 100000 steps with 1841 reset in 520 ms.
Product exploration explored 100000 steps with 1853 reset in 320 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), false, false, false, false]
Support contains 3 out of 228 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 228/228 places, 283/283 transitions.
Graph (trivial) has 203 edges and 228 vertex of which 37 / 228 are part of one of the 6 SCC in 4 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 197 transition count 251
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 24 place count 197 transition count 323
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 43 place count 197 transition count 323
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 70 place count 170 transition count 296
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 97 place count 170 transition count 296
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 125 place count 170 transition count 302
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 139 place count 156 transition count 288
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 153 place count 156 transition count 288
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 163 place count 156 transition count 318
Deduced a syphon composed of 50 places in 0 ms
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 184 place count 156 transition count 297
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 184 rules in 97 ms. Remains 156 /228 variables (removed 72) and now considering 297/283 (removed -14) transitions.
[2021-05-15 23:10:27] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-15 23:10:27] [INFO ] Flow matrix only has 278 transitions (discarded 19 similar events)
// Phase 1: matrix 278 rows 156 cols
[2021-05-15 23:10:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:10:27] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/228 places, 297/283 transitions.
Product exploration explored 100000 steps with 1840 reset in 232 ms.
Product exploration explored 100000 steps with 1847 reset in 280 ms.
[2021-05-15 23:10:28] [INFO ] Flatten gal took : 23 ms
[2021-05-15 23:10:28] [INFO ] Flatten gal took : 24 ms
[2021-05-15 23:10:28] [INFO ] Time to serialize gal into /tmp/LTL13851406557554785461.gal : 11 ms
[2021-05-15 23:10:28] [INFO ] Time to serialize properties into /tmp/LTL4446675404060025154.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/LTL13851406557554785461.gal, -t, CGAL, -LTL, /tmp/LTL4446675404060025154.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/LTL13851406557554785461.gal -t CGAL -LTL /tmp/LTL4446675404060025154.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p54!=1)"))&&(F((G((("(p514==1)")U("(p180==1)"))||(X("(p54==1)"))))||(G("(p54!=1)")))))))
Formula 0 simplified : !G(F"(p54!=1)" & F(G(("(p514==1)" U "(p180==1)") | X"(p54==1)") | G"(p54!=1)"))
Detected timeout of ITS tools.
[2021-05-15 23:10:43] [INFO ] Flatten gal took : 33 ms
[2021-05-15 23:10:43] [INFO ] Applying decomposition
[2021-05-15 23:10:43] [INFO ] Flatten gal took : 33 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/graph10440607724175887361.txt, -o, /tmp/graph10440607724175887361.bin, -w, /tmp/graph10440607724175887361.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/graph10440607724175887361.bin, -l, -1, -v, -w, /tmp/graph10440607724175887361.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:10:43] [INFO ] Decomposing Gal with order
[2021-05-15 23:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:10:43] [INFO ] Removed a total of 116 redundant transitions.
[2021-05-15 23:10:43] [INFO ] Flatten gal took : 129 ms
[2021-05-15 23:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 19 ms.
[2021-05-15 23:10:43] [INFO ] Time to serialize gal into /tmp/LTL10566110050950404808.gal : 16 ms
[2021-05-15 23:10:43] [INFO ] Time to serialize properties into /tmp/LTL16335392228409912574.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/LTL10566110050950404808.gal, -t, CGAL, -LTL, /tmp/LTL16335392228409912574.ltl, -c, -stutter-deadlock], 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/LTL10566110050950404808.gal -t CGAL -LTL /tmp/LTL16335392228409912574.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i1.i1.u6.p54!=1)"))&&(F((G((("(u60.p514==1)")U("(i4.i0.u25.p180==1)"))||(X("(i1.i1.u6.p54==1)"))))||(G("(i1.i1.u6.p54!=1)")))))))
Formula 0 simplified : !G(F"(i1.i1.u6.p54!=1)" & F(G(("(u60.p514==1)" U "(i4.i0.u25.p180==1)") | X"(i1.i1.u6.p54==1)") | G"(i1.i1.u6.p54!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t48, t76, t77, t107, t108, t143, t144, t180, t181, t211, t265, t267, t268, t270, u60.t7, u60.t11, u60.t45, i0.t214, i0.u8.t216, i1.i1.u4.t226, i1.i1.u5.t225, i1.i1.u6.t221, i2.i0.u14.t195, i2.i0.u15.t194, i2.i1.t190, i3.i0.u19.t185, i3.i1.u21.t183, i4.i0.u24.t159, i4.i0.u25.t153, i4.i0.u25.t158, i4.i1.t154, i5.t146, i5.u29.t148, i6.i0.u38.t114, i6.i1.t111, i7.i0.u41.t90, i7.i0.u44.t91, i7.i1.t86, i8.t79, i8.i0.u48.t81, i9.i0.u51.t61, i9.i0.u53.t62, i9.i1.t57, i10.u57.t52, i12.t266, i12.i0.u34.t125, i12.i0.u35.t124, i12.i0.u36.t120, i12.i1.t5, i12.i1.u62.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/230/51/281
Computing Next relation with stutter on 2.722e+07 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
985 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,9.92793,218048,1,0,372212,51493,4022,736315,1029,221613,847789
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-06b-01 finished in 31893 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||(X(p1)&&F(p2))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 302
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 302
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 230 transition count 291
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 230 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 230 transition count 287
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 225 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 225 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 225 transition count 279
Applied a total of 79 rules in 36 ms. Remains 225 /261 variables (removed 36) and now considering 279/322 (removed 43) transitions.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:10:55] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 23:10:55] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:10:55] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 23:10:56] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:10:56] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 265 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/261 places, 279/322 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s157 1), p1:(NEQ s0 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]]
Product exploration explored 100000 steps with 25062 reset in 382 ms.
Product exploration explored 100000 steps with 25113 reset in 505 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25010 reset in 244 ms.
Product exploration explored 100000 steps with 24967 reset in 459 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 225 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 225/225 places, 279/279 transitions.
Graph (trivial) has 199 edges and 225 vertex of which 31 / 225 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 199 transition count 252
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 24 place count 199 transition count 325
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 199 transition count 325
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 68 place count 175 transition count 301
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 92 place count 175 transition count 301
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 123 place count 175 transition count 307
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 139 place count 159 transition count 291
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 155 place count 159 transition count 291
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 169 place count 159 transition count 351
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 172 place count 156 transition count 344
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 175 place count 156 transition count 344
Deduced a syphon composed of 54 places in 0 ms
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 1 with 26 rules applied. Total rules applied 201 place count 156 transition count 318
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 201 rules in 104 ms. Remains 156 /225 variables (removed 69) and now considering 318/279 (removed -39) transitions.
[2021-05-15 23:10:58] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-15 23:10:58] [INFO ] Flow matrix only has 296 transitions (discarded 22 similar events)
// Phase 1: matrix 296 rows 156 cols
[2021-05-15 23:10:58] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:10:58] [INFO ] Dead Transitions using invariants and state equation in 242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/225 places, 318/279 transitions.
Product exploration explored 100000 steps with 25047 reset in 923 ms.
Product exploration explored 100000 steps with 25028 reset in 763 ms.
Starting structural reductions, iteration 0 : 225/225 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 225 /225 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:00] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:00] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:00] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-15 23:11:01] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:01] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/225 places, 279/279 transitions.
[2021-05-15 23:11:01] [INFO ] Flatten gal took : 31 ms
[2021-05-15 23:11:01] [INFO ] Flatten gal took : 29 ms
[2021-05-15 23:11:01] [INFO ] Time to serialize gal into /tmp/LTL9013483523215745410.gal : 9 ms
[2021-05-15 23:11:01] [INFO ] Time to serialize properties into /tmp/LTL18295416582675694720.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/LTL9013483523215745410.gal, -t, CGAL, -LTL, /tmp/LTL18295416582675694720.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/LTL9013483523215745410.gal -t CGAL -LTL /tmp/LTL18295416582675694720.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((X(G(((F("(p337==1)"))||((X("(p0!=1)"))&&(F("((p263!=1)||(p538!=1))"))))||(X(G("(p0!=1)")))))))
Formula 0 simplified : !XG(F"(p337==1)" | (X"(p0!=1)" & F"((p263!=1)||(p538!=1))") | XG"(p0!=1)")
Detected timeout of ITS tools.
[2021-05-15 23:11:16] [INFO ] Flatten gal took : 28 ms
[2021-05-15 23:11:16] [INFO ] Applying decomposition
[2021-05-15 23:11:16] [INFO ] Flatten gal took : 29 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/graph15411533580000421062.txt, -o, /tmp/graph15411533580000421062.bin, -w, /tmp/graph15411533580000421062.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/graph15411533580000421062.bin, -l, -1, -v, -w, /tmp/graph15411533580000421062.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:11:16] [INFO ] Decomposing Gal with order
[2021-05-15 23:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:11:16] [INFO ] Removed a total of 133 redundant transitions.
[2021-05-15 23:11:16] [INFO ] Flatten gal took : 71 ms
[2021-05-15 23:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2021-05-15 23:11:16] [INFO ] Time to serialize gal into /tmp/LTL5905346111314511870.gal : 10 ms
[2021-05-15 23:11:16] [INFO ] Time to serialize properties into /tmp/LTL9416323939544956451.ltl : 2 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/LTL5905346111314511870.gal, -t, CGAL, -LTL, /tmp/LTL9416323939544956451.ltl, -c, -stutter-deadlock], 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/LTL5905346111314511870.gal -t CGAL -LTL /tmp/LTL9416323939544956451.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((X(G(((F("(i9.i0.u56.p337==1)"))||((X("(i0.i0.u0.p0!=1)"))&&(F("((i7.u43.p263!=1)||(i3.i2.u74.p538!=1))"))))||(X(G("(i0.i0.u0.p0!=1)")))))))
Formula 0 simplified : !XG(F"(i9.i0.u56.p337==1)" | (X"(i0.i0.u0.p0!=1)" & F"((i7.u43.p263!=1)||(i3.i2.u74.p538!=1))") | XG"(i0.i0.u0.p0!=1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t47, t48, t77, t107, t108, t143, t144, t180, t265, t268, t270, t318, i0.t76, i0.i1.u51.t91, i0.i1.u52.t90, i0.i1.u53.t86, i1.i0.t221, i1.i1.u9.t216, i1.i2.u11.t214, i1.i2.u12.t235, i1.i3.t211, i1.i3.u3.t225, i1.i3.u5.t226, i2.i0.u14.t183, i2.i0.u24.t202, i2.i1.u15.t181, i2.i1.u21.t185, i3.t267, i3.i0.u16.t195, i3.i1.t190, i3.i2.t4, i3.i2.u73.t2, i3.i2.u73.t5, i4.i0.t177, i4.i0.u26.t146, i4.i0.u29.t166, i4.i0.u29.t170, i4.i1.u35.t148, i5.i0.u25.t153, i5.i0.u25.t158, i5.i0.u31.t159, i5.i1.t154, i6.i0.t120, i6.i1.u39.t125, i6.i1.u40.t119, i6.i1.u40.t124, i7.t138, i7.t112, i7.u38.t132, i7.u38.t135, i7.u44.t114, i8.t57, i8.u60.t61, i8.u61.t62, i9.i0.u55.t81, i9.i1.t102, i9.i1.u57.t79, i10.u65.t52, i11.t37, i11.t32, i11.t24, i11.t21, i11.u72.t7, i11.u72.t8, i11.u72.t11, i11.u72.t45, i11.u72.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/253/68/321
Computing Next relation with stutter on 4.70963e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2340375830390856325
[2021-05-15 23:11:31] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2340375830390856325
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/ltsmin2340375830390856325]
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/ltsmin2340375830390856325] 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/ltsmin2340375830390856325] 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 FlexibleBarrier-PT-06b-03 finished in 37383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 304
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 233 transition count 294
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 233 transition count 294
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 233 transition count 291
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 228 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 228 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 228 transition count 283
Applied a total of 72 rules in 16 ms. Remains 228 /261 variables (removed 33) and now considering 283/322 (removed 39) transitions.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:32] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:32] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:32] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:11:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:33] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/261 places, 283/322 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s188 1) (EQ s52 1)), p0:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 ms.
FORMULA FlexibleBarrier-PT-06b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-04 finished in 753 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(G(p0)) U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 238 edges and 261 vertex of which 31 / 261 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 234 transition count 255
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 195 transition count 255
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 195 transition count 238
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 178 transition count 238
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 138 place count 153 transition count 213
Iterating global reduction 2 with 25 rules applied. Total rules applied 163 place count 153 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 163 place count 153 transition count 211
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 167 place count 151 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 147 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 147 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 179 place count 147 transition count 203
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 255 place count 109 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 258 place count 106 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 106 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 264 place count 106 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 105 transition count 159
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 105 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 104 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 103 transition count 150
Applied a total of 275 rules in 58 ms. Remains 103 /261 variables (removed 158) and now considering 150/322 (removed 172) transitions.
[2021-05-15 23:11:33] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
// Phase 1: matrix 140 rows 103 cols
[2021-05-15 23:11:33] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2021-05-15 23:11:33] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
// Phase 1: matrix 140 rows 103 cols
[2021-05-15 23:11:33] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:33] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2021-05-15 23:11:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 23:11:33] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
// Phase 1: matrix 140 rows 103 cols
[2021-05-15 23:11:33] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-15 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/261 places, 150/322 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s101 1), p0:(EQ s36 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-05 finished in 568 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 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 237 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 229 transition count 254
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 194 transition count 254
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 71 place count 194 transition count 237
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 105 place count 177 transition count 237
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 131 place count 151 transition count 211
Iterating global reduction 2 with 26 rules applied. Total rules applied 157 place count 151 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 147 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 147 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 169 place count 147 transition count 203
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 245 place count 109 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 106 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 106 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 254 place count 106 transition count 159
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 106 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 105 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 104 transition count 151
Applied a total of 262 rules in 62 ms. Remains 104 /261 variables (removed 157) and now considering 151/322 (removed 171) transitions.
[2021-05-15 23:11:34] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 104 cols
[2021-05-15 23:11:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2021-05-15 23:11:34] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 104 cols
[2021-05-15 23:11:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 23:11:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:34] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2021-05-15 23:11:34] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 23:11:34] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 104 cols
[2021-05-15 23:11:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:34] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/261 places, 151/322 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s89 1) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-07 finished in 604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||(p1&&(X(!p2) U ((X(!p2)&&(p3||F(p0)))||X(G(!p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 302
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 302
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 230 transition count 291
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 230 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 230 transition count 287
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 225 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 225 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 225 transition count 279
Applied a total of 79 rules in 23 ms. Remains 225 /261 variables (removed 36) and now considering 279/322 (removed 43) transitions.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:34] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:34] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:34] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:35] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2021-05-15 23:11:35] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:11:35] [INFO ] Dead Transitions using invariants and state equation in 348 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/261 places, 279/322 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p0) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s126 0), p0:(NEQ s29 1), p2:(EQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14119 steps with 257 reset in 69 ms.
FORMULA FlexibleBarrier-PT-06b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-08 finished in 1103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 239 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 229 transition count 252
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 192 transition count 252
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 75 place count 192 transition count 236
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 107 place count 176 transition count 236
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 134 place count 149 transition count 209
Iterating global reduction 2 with 27 rules applied. Total rules applied 161 place count 149 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 149 transition count 208
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 163 place count 148 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 144 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 144 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 175 place count 144 transition count 200
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 249 place count 107 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 252 place count 104 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 255 place count 104 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 258 place count 104 transition count 157
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 264 place count 104 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 103 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 102 transition count 149
Applied a total of 266 rules in 60 ms. Remains 102 /261 variables (removed 159) and now considering 149/322 (removed 173) transitions.
[2021-05-15 23:11:35] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 102 cols
[2021-05-15 23:11:35] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:36] [INFO ] Implicit Places using invariants in 142 ms returned []
[2021-05-15 23:11:36] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 102 cols
[2021-05-15 23:11:36] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:36] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2021-05-15 23:11:36] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 23:11:36] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 102 cols
[2021-05-15 23:11:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:36] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/261 places, 149/322 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-09 finished in 679 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 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 240 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 229 transition count 251
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 191 transition count 251
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 77 place count 191 transition count 234
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 111 place count 174 transition count 234
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 139 place count 146 transition count 206
Iterating global reduction 2 with 28 rules applied. Total rules applied 167 place count 146 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 167 place count 146 transition count 205
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 169 place count 145 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 141 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 141 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 181 place count 141 transition count 197
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 251 place count 106 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 254 place count 103 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 103 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 260 place count 103 transition count 156
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 266 place count 103 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 267 place count 102 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 101 transition count 148
Applied a total of 268 rules in 61 ms. Remains 101 /261 variables (removed 160) and now considering 148/322 (removed 174) transitions.
[2021-05-15 23:11:36] [INFO ] Flow matrix only has 137 transitions (discarded 11 similar events)
// Phase 1: matrix 137 rows 101 cols
[2021-05-15 23:11:36] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 23:11:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2021-05-15 23:11:36] [INFO ] Flow matrix only has 137 transitions (discarded 11 similar events)
// Phase 1: matrix 137 rows 101 cols
[2021-05-15 23:11:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:36] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2021-05-15 23:11:36] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-15 23:11:36] [INFO ] Flow matrix only has 137 transitions (discarded 11 similar events)
// Phase 1: matrix 137 rows 101 cols
[2021-05-15 23:11:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:37] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/261 places, 148/322 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s42 1)], 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 7715 reset in 492 ms.
Product exploration explored 100000 steps with 7711 reset in 528 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7710 reset in 276 ms.
Product exploration explored 100000 steps with 7697 reset in 408 ms.
[2021-05-15 23:11:38] [INFO ] Flatten gal took : 9 ms
[2021-05-15 23:11:38] [INFO ] Flatten gal took : 6 ms
[2021-05-15 23:11:38] [INFO ] Time to serialize gal into /tmp/LTL9517781337616909323.gal : 2 ms
[2021-05-15 23:11:38] [INFO ] Time to serialize properties into /tmp/LTL16654519175081101563.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/LTL9517781337616909323.gal, -t, CGAL, -LTL, /tmp/LTL16654519175081101563.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/LTL9517781337616909323.gal -t CGAL -LTL /tmp/LTL16654519175081101563.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p255!=1)"))))
Formula 0 simplified : !FG"(p255!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.475e+07 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
396 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,3.99336,107092,1,0,128,481343,24,142,2650,455505,265
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-06b-10 finished in 6956 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 304
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 304
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 234 transition count 295
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 234 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 234 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 230 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 230 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 230 transition count 286
Applied a total of 67 rules in 12 ms. Remains 230 /261 variables (removed 31) and now considering 286/322 (removed 36) transitions.
// Phase 1: matrix 286 rows 230 cols
[2021-05-15 23:11:43] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:43] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 286 rows 230 cols
[2021-05-15 23:11:43] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:43] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 230 cols
[2021-05-15 23:11:43] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-15 23:11:44] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/261 places, 286/322 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 1) (EQ s77 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]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-11 finished in 674 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 303
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 303
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 232 transition count 293
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 232 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 232 transition count 289
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 228 transition count 285
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 228 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 228 transition count 283
Applied a total of 72 rules in 19 ms. Remains 228 /261 variables (removed 33) and now considering 283/322 (removed 39) transitions.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:44] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:44] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:44] [INFO ] Computed 8 place invariants in 8 ms
[2021-05-15 23:11:44] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 228 cols
[2021-05-15 23:11:44] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:45] [INFO ] Dead Transitions using invariants and state equation in 311 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/261 places, 283/322 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-12 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: 1}]], initial=2, aps=[p0:(OR (EQ s135 1) (AND (EQ s121 1) (EQ s226 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-12 finished in 986 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 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 237 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 229 transition count 253
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 193 transition count 253
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 73 place count 193 transition count 237
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 105 place count 177 transition count 237
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 131 place count 151 transition count 211
Iterating global reduction 2 with 26 rules applied. Total rules applied 157 place count 151 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 157 place count 151 transition count 210
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 159 place count 150 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 145 transition count 205
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 145 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 173 place count 145 transition count 201
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 245 place count 109 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 107 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 107 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 251 place count 107 transition count 161
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 256 place count 107 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 106 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 105 transition count 154
Applied a total of 258 rules in 60 ms. Remains 105 /261 variables (removed 156) and now considering 154/322 (removed 168) transitions.
[2021-05-15 23:11:45] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
// Phase 1: matrix 143 rows 105 cols
[2021-05-15 23:11:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2021-05-15 23:11:45] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
// Phase 1: matrix 143 rows 105 cols
[2021-05-15 23:11:45] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:45] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2021-05-15 23:11:45] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 23:11:45] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
// Phase 1: matrix 143 rows 105 cols
[2021-05-15 23:11:45] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 23:11:45] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/261 places, 154/322 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-14 finished in 645 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 322/322 transitions.
Graph (trivial) has 240 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 229 transition count 251
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 191 transition count 251
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 77 place count 191 transition count 234
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 111 place count 174 transition count 234
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 138 place count 147 transition count 207
Iterating global reduction 2 with 27 rules applied. Total rules applied 165 place count 147 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 147 transition count 206
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 167 place count 146 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 142 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 142 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 179 place count 142 transition count 198
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 251 place count 106 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 104 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 104 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 257 place count 104 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 104 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 103 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 102 transition count 150
Applied a total of 265 rules in 27 ms. Remains 102 /261 variables (removed 159) and now considering 150/322 (removed 172) transitions.
[2021-05-15 23:11:45] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2021-05-15 23:11:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2021-05-15 23:11:45] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2021-05-15 23:11:45] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 23:11:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:11:46] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2021-05-15 23:11:46] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 23:11:46] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2021-05-15 23:11:46] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 23:11:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/261 places, 150/322 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-15 finished in 400 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10088211189509442831
[2021-05-15 23:11:46] [INFO ] Computing symmetric may disable matrix : 322 transitions.
[2021-05-15 23:11:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 23:11:46] [INFO ] Applying decomposition
[2021-05-15 23:11:46] [INFO ] Computing symmetric may enable matrix : 322 transitions.
[2021-05-15 23:11:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 23:11:46] [INFO ] Flatten gal took : 18 ms
[2021-05-15 23:11:46] [INFO ] Computing Do-Not-Accords matrix : 322 transitions.
[2021-05-15 23:11:46] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 23:11:46] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10088211189509442831
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/ltsmin10088211189509442831]
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/graph14749171734704816910.txt, -o, /tmp/graph14749171734704816910.bin, -w, /tmp/graph14749171734704816910.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/graph14749171734704816910.bin, -l, -1, -v, -w, /tmp/graph14749171734704816910.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:11:46] [INFO ] Decomposing Gal with order
[2021-05-15 23:11:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:11:46] [INFO ] Removed a total of 133 redundant transitions.
[2021-05-15 23:11:46] [INFO ] Flatten gal took : 69 ms
[2021-05-15 23:11:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 23:11:46] [INFO ] Time to serialize gal into /tmp/LTLFireability2720080552702182419.gal : 9 ms
[2021-05-15 23:11:46] [INFO ] Time to serialize properties into /tmp/LTLFireability15737485389016669131.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/LTLFireability2720080552702182419.gal, -t, CGAL, -LTL, /tmp/LTLFireability15737485389016669131.ltl, -c, -stutter-deadlock], 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/LTLFireability2720080552702182419.gal -t CGAL -LTL /tmp/LTLFireability15737485389016669131.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(i7.i1.u57.p337==1)"))||((X("(i9.i0.u0.p0!=1)"))U(((F(!("((i5.i0.u43.p263==1)&&(i2.i2.u74.p538==1))")))&&(X("(i9.i0.u0.p0!=1)")))||(G(X("(i9.i0.u0.p0!=1)")))))))))
Formula 0 simplified : !XG(F"(i7.i1.u57.p337==1)" | (X"(i9.i0.u0.p0!=1)" U ((X"(i9.i0.u0.p0!=1)" & F!"((i5.i0.u43.p263==1)&&(i2.i2.u74.p538==1))") | GX"(i9.i0.u0.p0!=1)")))
Compilation finished in 2451 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10088211189509442831]
Link finished in 58 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))||(X((LTLAPp1==true))&&<>((LTLAPp2==true)))||X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10088211189509442831]
Reverse transition relation is NOT exact ! Due to transitions t1, t145, t193, t194, t258, t259, t323, t324, t388, t541, t544, t546, t614, i0.i0.u4.t495, i0.i0.u12.t459, i0.i1.t453, i0.i1.u5.t475, i0.i1.u6.t476, i0.i2.t470, i0.i3.u10.t462, i1.i0.u14.t395, i1.i0.u15.t423, i1.i1.u16.t389, i1.i1.u22.t398, i2.t543, i2.i0.u17.t412, i2.i1.t406, i2.i2.t6, i2.i2.u73.t2, i2.i2.u73.t9, i3.i0.u33.t333, i3.i1.t385, i3.i1.u27.t356, i3.i1.u27.t364, i3.i1.u35.t330, i4.i0.u36.t274, i4.i0.u36.t281, i4.i0.u40.t282, i4.i1.t276, i5.i0.u44.t268, i5.i1.t266, i5.i1.t312, i5.i1.u46.t295, i5.i1.u46.t301, i6.i0.u47.t216, i6.i0.u52.t217, i6.i1.t211, i7.i0.t245, i7.i0.u48.t200, i7.i1.u56.t203, i8.u67.t152, i9.t144, i9.i1.u62.t166, i9.i1.u63.t165, i9.i2.t160, i10.t111, i10.t97, i10.t71, i10.t67, i10.u72.t13, i10.u72.t16, i10.u72.t28, i10.u72.t141, i10.u72.t142, i11.t341, i11.u24.t339, i11.u24.t346, i11.u28.t347, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/254/68/322
Computing Next relation with stutter on 4.70963e+07 deadlock states
26 unique states visited
0 strongly connected components in search stack
27 transitions explored
15 items max in DFS search stack
4002 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,40.0756,529768,1,0,584570,111270,5117,3.07409e+06,1192,693036,1838257
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-06b-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621120402602

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r102-smll-162075331000029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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