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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 38K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K 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 IBMB2S565S3960-PT-none-00
FORMULA_NAME IBMB2S565S3960-PT-none-01
FORMULA_NAME IBMB2S565S3960-PT-none-02
FORMULA_NAME IBMB2S565S3960-PT-none-03
FORMULA_NAME IBMB2S565S3960-PT-none-04
FORMULA_NAME IBMB2S565S3960-PT-none-05
FORMULA_NAME IBMB2S565S3960-PT-none-06
FORMULA_NAME IBMB2S565S3960-PT-none-07
FORMULA_NAME IBMB2S565S3960-PT-none-08
FORMULA_NAME IBMB2S565S3960-PT-none-09
FORMULA_NAME IBMB2S565S3960-PT-none-10
FORMULA_NAME IBMB2S565S3960-PT-none-11
FORMULA_NAME IBMB2S565S3960-PT-none-12
FORMULA_NAME IBMB2S565S3960-PT-none-13
FORMULA_NAME IBMB2S565S3960-PT-none-14
FORMULA_NAME IBMB2S565S3960-PT-none-15

=== Now, execution of the tool begins

BK_START 1620837826169

Running Version 0
[2021-05-12 16:43:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:43:47] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-12 16:43:47] [INFO ] Transformed 273 places.
[2021-05-12 16:43:47] [INFO ] Transformed 179 transitions.
[2021-05-12 16:43:47] [INFO ] Parsed PT model containing 273 places and 179 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:43:47] [INFO ] Initial state test concluded for 3 properties.
FORMULA IBMB2S565S3960-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 86 places
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 179 transition count 179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 109 place count 164 transition count 164
Iterating global reduction 1 with 15 rules applied. Total rules applied 124 place count 164 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 163 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 163 transition count 163
Applied a total of 126 rules in 42 ms. Remains 163 /273 variables (removed 110) and now considering 163/179 (removed 16) transitions.
// Phase 1: matrix 163 rows 163 cols
[2021-05-12 16:43:48] [INFO ] Computed 11 place invariants in 20 ms
[2021-05-12 16:43:48] [INFO ] Implicit Places using invariants in 142 ms returned [132, 149]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
// Phase 1: matrix 163 rows 161 cols
[2021-05-12 16:43:48] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-12 16:43:48] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 161/273 places, 163/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 162
Applied a total of 2 rules in 17 ms. Remains 160 /161 variables (removed 1) and now considering 162/163 (removed 1) transitions.
// Phase 1: matrix 162 rows 160 cols
[2021-05-12 16:43:48] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-12 16:43:48] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 162 rows 160 cols
[2021-05-12 16:43:48] [INFO ] Computed 9 place invariants in 12 ms
[2021-05-12 16:43:48] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 160/273 places, 162/179 transitions.
[2021-05-12 16:43:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 16:43:48] [INFO ] Flatten gal took : 37 ms
FORMULA IBMB2S565S3960-PT-none-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:43:48] [INFO ] Flatten gal took : 16 ms
[2021-05-12 16:43:48] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 100000 steps, including 430 resets, run finished after 242 ms. (steps per millisecond=413 ) properties (out of 24) seen :16
Running SMT prover for 8 properties.
// Phase 1: matrix 162 rows 160 cols
[2021-05-12 16:43:48] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-12 16:43:49] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-12 16:43:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:49] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-12 16:43:49] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-12 16:43:49] [INFO ] Added : 107 causal constraints over 22 iterations in 429 ms. Result :sat
[2021-05-12 16:43:49] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-12 16:43:49] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 16:43:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:49] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-12 16:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:49] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-12 16:43:50] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-12 16:43:50] [INFO ] Added : 112 causal constraints over 23 iterations in 234 ms. Result :sat
[2021-05-12 16:43:50] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:50] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-12 16:43:50] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-12 16:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:50] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:50] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-12 16:43:50] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:50] [INFO ] Added : 124 causal constraints over 25 iterations in 233 ms. Result :sat
[2021-05-12 16:43:50] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-12 16:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-12 16:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:50] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:50] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-12 16:43:50] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-12 16:43:51] [INFO ] Added : 134 causal constraints over 28 iterations in 266 ms. Result :sat
[2021-05-12 16:43:51] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:51] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-12 16:43:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:51] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-12 16:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-12 16:43:51] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-12 16:43:51] [INFO ] Added : 124 causal constraints over 25 iterations in 222 ms. Result :sat
[2021-05-12 16:43:51] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-12 16:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-12 16:43:51] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 16:43:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:51] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-12 16:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:51] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-12 16:43:51] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:52] [INFO ] Added : 107 causal constraints over 22 iterations in 258 ms. Result :sat
[2021-05-12 16:43:52] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:52] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2021-05-12 16:43:52] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 10 ms returned sat
[2021-05-12 16:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:52] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-12 16:43:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:43:52] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-12 16:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:43:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-12 16:43:52] [INFO ] Computed and/alt/rep : 161/194/161 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:43:52] [INFO ] Added : 111 causal constraints over 23 iterations in 209 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-12 16:43:52] [INFO ] Initial state test concluded for 1 properties.
FORMULA IBMB2S565S3960-PT-none-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p1&&(p0 U (G(p0)||(p0&&G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Graph (complete) has 191 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 133 edges and 153 vertex of which 12 / 153 are part of one of the 1 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 142 transition count 84
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 171 place count 65 transition count 70
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 174 place count 64 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 176 place count 62 transition count 68
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 176 place count 62 transition count 47
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 220 place count 39 transition count 47
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 223 place count 38 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 225 place count 36 transition count 45
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 228 place count 33 transition count 42
Iterating global reduction 6 with 3 rules applied. Total rules applied 231 place count 33 transition count 42
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 249 place count 24 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 253 place count 24 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 259 place count 21 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 260 place count 21 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 21 transition count 28
Applied a total of 261 rules in 47 ms. Remains 21 /160 variables (removed 139) and now considering 28/162 (removed 134) transitions.
// Phase 1: matrix 28 rows 21 cols
[2021-05-12 16:43:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants in 15 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-12 16:43:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 28 rows 20 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 20/160 places, 28/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 27
Applied a total of 2 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 19 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 27 rows 19 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [8]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 18/160 places, 26/162 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 25
Applied a total of 1 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 18 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 18 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 18/160 places, 25/162 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(GT s15 s10), p0:(LEQ 1 s16), p2:(LEQ 3 s7)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-00 finished in 630 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Graph (complete) has 191 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 134 edges and 152 vertex of which 12 / 152 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 141 transition count 89
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 87 rules applied. Total rules applied 161 place count 70 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 164 place count 67 transition count 73
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 164 place count 67 transition count 49
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 214 place count 41 transition count 49
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 40 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 39 transition count 48
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 220 place count 36 transition count 45
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 36 transition count 45
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 245 place count 25 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 249 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 23 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 254 place count 23 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 255 place count 22 transition count 28
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 256 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 20 transition count 27
Applied a total of 257 rules in 21 ms. Remains 20 /160 variables (removed 140) and now considering 27/162 (removed 135) transitions.
// Phase 1: matrix 27 rows 20 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 27 rows 20 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned [7]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 35 ms to find 1 implicit places.
[2021-05-12 16:43:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 19 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:43:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 19/160 places, 26/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2021-05-12 16:43:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 19 cols
[2021-05-12 16:43:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:43:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/160 places, 26/162 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT s4 s10) (LEQ 2 s14)), p1:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-01 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p1&&X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 16 place count 145 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 145 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 142 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 141 transition count 148
Applied a total of 33 rules in 13 ms. Remains 141 /160 variables (removed 19) and now considering 148/162 (removed 14) transitions.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:43:59] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 16:43:59] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:43:59] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:44:00] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:00] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/162 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GT 1 s27), p0:(LEQ s54 s52), p1:(GT s49 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1421 steps with 6 reset in 9 ms.
FORMULA IBMB2S565S3960-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-02 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 146 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 146 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 146 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 144 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 143 transition count 150
Applied a total of 29 rules in 11 ms. Remains 143 /160 variables (removed 17) and now considering 150/162 (removed 12) transitions.
// Phase 1: matrix 150 rows 143 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 16:44:00] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 150 rows 143 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:00] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 143 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 16:44:00] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/160 places, 150/162 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(GT 1 s121), p0:(GT s48 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 445 steps with 2 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-03 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 16 place count 145 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 145 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 142 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 141 transition count 148
Applied a total of 33 rules in 9 ms. Remains 141 /160 variables (removed 19) and now considering 148/162 (removed 14) transitions.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:44:00] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:44:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:00] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:44:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/162 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s64), p1:(LEQ s121 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 141/141 places, 148/148 transitions.
Graph (trivial) has 124 edges and 141 vertex of which 18 / 141 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 124 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 46 place count 124 transition count 131
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 68 place count 124 transition count 131
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 91 place count 101 transition count 108
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 114 place count 101 transition count 108
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 137 place count 101 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 101 transition count 107
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 168 place count 71 transition count 77
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 198 place count 71 transition count 77
Performed 9 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 207 place count 71 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 213 place count 71 transition count 103
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 225 place count 59 transition count 77
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 59 transition count 77
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 237 rules in 17 ms. Remains 59 /141 variables (removed 82) and now considering 77/148 (removed 71) transitions.
[2021-05-12 16:44:02] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 77 rows 59 cols
[2021-05-12 16:44:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:44:02] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/141 places, 77/148 transitions.
Product exploration explored 100000 steps with 50000 reset in 504 ms.
Product exploration explored 100000 steps with 50000 reset in 450 ms.
[2021-05-12 16:44:03] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:44:03] [INFO ] Flatten gal took : 11 ms
[2021-05-12 16:44:03] [INFO ] Time to serialize gal into /tmp/LTL2232613631249852576.gal : 5 ms
[2021-05-12 16:44:03] [INFO ] Time to serialize properties into /tmp/LTL11042853419167337361.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2232613631249852576.gal, -t, CGAL, -LTL, /tmp/LTL11042853419167337361.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/LTL2232613631249852576.gal -t CGAL -LTL /tmp/LTL11042853419167337361.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(callToTask.s00003976.input.s00001052>=3)"))||(X("(join.s00002243.activated.s00001062<=callToProcess.s00003957.output.s00001077)"))))
Formula 0 simplified : !(F"(callToTask.s00003976.input.s00001052>=3)" | X"(join.s00002243.activated.s00001062<=callToProcess.s00003957.output.s00001077)")
Detected timeout of ITS tools.
[2021-05-12 16:44:18] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:44:18] [INFO ] Applying decomposition
[2021-05-12 16:44:18] [INFO ] Flatten gal took : 7 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/graph12936510014613008804.txt, -o, /tmp/graph12936510014613008804.bin, -w, /tmp/graph12936510014613008804.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/graph12936510014613008804.bin, -l, -1, -v, -w, /tmp/graph12936510014613008804.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:44:18] [INFO ] Decomposing Gal with order
[2021-05-12 16:44:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:44:18] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-12 16:44:18] [INFO ] Flatten gal took : 36 ms
[2021-05-12 16:44:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-12 16:44:18] [INFO ] Time to serialize gal into /tmp/LTL9327775370790869650.gal : 5 ms
[2021-05-12 16:44:18] [INFO ] Time to serialize properties into /tmp/LTL2968559456376223187.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/LTL9327775370790869650.gal, -t, CGAL, -LTL, /tmp/LTL2968559456376223187.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/LTL9327775370790869650.gal -t CGAL -LTL /tmp/LTL2968559456376223187.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gi2.gi0.gi3.gi1.gu34.callToTask.s00003976.input.s00001052>=3)"))||(X("(gu11.join.s00002243.activated.s00001062<=gu11.callToProcess.s00003957.output.s00001077)"))))
Formula 0 simplified : !(F"(gi2.gi0.gi3.gi1.gu34.callToTask.s00003976.input.s00001052>=3)" | X"(gu11.join.s00002243.activated.s00001062<=gu11.callToProcess.s00003957.output.s00001077)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6161792341755616294
[2021-05-12 16:44:33] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6161792341755616294
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/ltsmin6161792341755616294]
Compilation finished in 651 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6161792341755616294]
Link finished in 48 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, (<>((LTLAPp0==true))||X((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6161792341755616294]
LTSmin run took 529 ms.
FORMULA IBMB2S565S3960-PT-none-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-04 finished in 34082 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(X((p1&&X(G(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 154 transition count 162
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 149 transition count 157
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 149 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 147 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 147 transition count 155
Applied a total of 20 rules in 7 ms. Remains 147 /160 variables (removed 13) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 147 cols
[2021-05-12 16:44:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:34] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 155 rows 147 cols
[2021-05-12 16:44:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:34] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 147 cols
[2021-05-12 16:44:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:34] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/160 places, 155/162 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, true, true, p1, true, true]
Running random walk in product with property : IBMB2S565S3960-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LEQ s44 s136) (LEQ s27 s99)), p1:(GT 1 s138)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-05 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Graph (complete) has 191 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 152 transition count 76
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 68 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 173 place count 67 transition count 74
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 173 place count 67 transition count 50
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 223 place count 41 transition count 50
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 226 place count 40 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 228 place count 38 transition count 48
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 230 place count 36 transition count 46
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 36 transition count 46
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 260 place count 22 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 264 place count 22 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 270 place count 19 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 271 place count 19 transition count 31
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 273 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 274 place count 18 transition count 28
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 275 place count 17 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 276 place count 16 transition count 27
Applied a total of 276 rules in 17 ms. Remains 16 /160 variables (removed 144) and now considering 27/162 (removed 135) transitions.
// Phase 1: matrix 27 rows 16 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 27 rows 16 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [7]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 36 ms to find 1 implicit places.
[2021-05-12 16:44:35] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 15/160 places, 25/162 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 23
Applied a total of 2 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 15 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 23 rows 15 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/160 places, 23/162 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s6 s5)], 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 41 steps with 2 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-06 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Graph (complete) has 191 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 138 edges and 152 vertex of which 18 / 152 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 135 transition count 87
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 170 place count 62 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 61 transition count 66
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 171 place count 61 transition count 44
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 216 place count 38 transition count 44
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 35 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 35 transition count 41
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 243 place count 24 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 248 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 22 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 255 place count 19 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 256 place count 19 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 18 transition count 29
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 17 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 16 transition count 28
Applied a total of 259 rules in 14 ms. Remains 16 /160 variables (removed 144) and now considering 28/162 (removed 134) transitions.
// Phase 1: matrix 28 rows 16 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 28 rows 16 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants and state equation in 16 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 26 ms to find 1 implicit places.
[2021-05-12 16:44:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 15/160 places, 24/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2021-05-12 16:44:35] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 16:44:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 15/160 places, 24/162 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-07 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:(GT s8 s4)], 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 13 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-07 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||X((G(p1) U (!p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 16 place count 145 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 145 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 142 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 141 transition count 148
Applied a total of 33 rules in 9 ms. Remains 141 /160 variables (removed 19) and now considering 148/162 (removed 14) transitions.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:35] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:35] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:44:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/162 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 3 s25), p0:(GT 1 s119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), p0, true, p0, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Applying partial POR strategy [true, false, true, false, true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), p0, true, p0, (OR (NOT p1) p0)]
Support contains 2 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 141/141 places, 148/148 transitions.
Graph (trivial) has 126 edges and 141 vertex of which 18 / 141 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 124 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 49 place count 124 transition count 130
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 124 transition count 130
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 99 place count 96 transition count 102
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 127 place count 96 transition count 102
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 149 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 96 transition count 101
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 179 place count 67 transition count 72
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 208 place count 67 transition count 72
Performed 9 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 67 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 222 place count 67 transition count 101
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 234 place count 55 transition count 74
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 246 place count 55 transition count 74
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 246 rules in 11 ms. Remains 55 /141 variables (removed 86) and now considering 74/148 (removed 74) transitions.
[2021-05-12 16:44:36] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2021-05-12 16:44:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:44:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/141 places, 74/148 transitions.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
[2021-05-12 16:44:37] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:44:37] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:44:37] [INFO ] Time to serialize gal into /tmp/LTL16055233677944243264.gal : 1 ms
[2021-05-12 16:44:37] [INFO ] Time to serialize properties into /tmp/LTL5995474088643198941.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/LTL16055233677944243264.gal, -t, CGAL, -LTL, /tmp/LTL5995474088643198941.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/LTL16055233677944243264.gal -t CGAL -LTL /tmp/LTL5995474088643198941.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(join.s00001164.input.s00001052>=1)")||(X((G("(callToProcess.s00003957.output.s00001080>=3)"))U(("(join.s00001164.input.s00001052>=1)")&&(G("(callToProcess.s00003957.output.s00001080>=3)"))))))))
Formula 0 simplified : !X("(join.s00001164.input.s00001052>=1)" | X(G"(callToProcess.s00003957.output.s00001080>=3)" U ("(join.s00001164.input.s00001052>=1)" & G"(callToProcess.s00003957.output.s00001080>=3)")))
Detected timeout of ITS tools.
[2021-05-12 16:44:52] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:44:52] [INFO ] Applying decomposition
[2021-05-12 16:44:52] [INFO ] Flatten gal took : 5 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/graph11704346318661606804.txt, -o, /tmp/graph11704346318661606804.bin, -w, /tmp/graph11704346318661606804.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/graph11704346318661606804.bin, -l, -1, -v, -w, /tmp/graph11704346318661606804.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:44:52] [INFO ] Decomposing Gal with order
[2021-05-12 16:44:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:44:52] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-12 16:44:52] [INFO ] Flatten gal took : 11 ms
[2021-05-12 16:44:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:44:52] [INFO ] Time to serialize gal into /tmp/LTL9462515761888588091.gal : 2 ms
[2021-05-12 16:44:52] [INFO ] Time to serialize properties into /tmp/LTL2037136988187814263.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9462515761888588091.gal, -t, CGAL, -LTL, /tmp/LTL2037136988187814263.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/LTL9462515761888588091.gal -t CGAL -LTL /tmp/LTL2037136988187814263.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.i0.u48.join.s00001164.input.s00001052>=1)")||(X((G("(i1.i1.u9.callToProcess.s00003957.output.s00001080>=3)"))U(("(i0.i0.u48.join.s00001164.input.s00001052>=1)")&&(G("(i1.i1.u9.callToProcess.s00003957.output.s00001080>=3)"))))))))
Formula 0 simplified : !X("(i0.i0.u48.join.s00001164.input.s00001052>=1)" | X(G"(i1.i1.u9.callToProcess.s00003957.output.s00001080>=3)" U ("(i0.i0.u48.join.s00001164.input.s00001052>=1)" & G"(i1.i1.u9.callToProcess.s00003957.output.s00001080>=3)")))
Reverse transition relation is NOT exact ! Due to transitions t71, t75, t84, t161, i0.i0.t134, i0.i1.t93, i0.i1.u8.t91, i0.i1.u45.t126, i1.t80, i1.t77, i1.i1.t99, i1.i1.u0.t1, i1.i1.u0.t98, i2.i0.t107, i2.i0.u13.t104, i2.i0.u13.t105, i3.i0.u17.t27, i10.t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/130/18/148
Computing Next relation with stutter on 3746 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1066 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,10.6831,281484,1,0,340707,10408,1748,2.02017e+06,289,71653,195379
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IBMB2S565S3960-PT-none-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property IBMB2S565S3960-PT-none-08 finished in 31324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(F(p0)))&&F((p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 146 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 146 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 146 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 143 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 142 transition count 149
Applied a total of 31 rules in 5 ms. Remains 142 /160 variables (removed 18) and now considering 149/162 (removed 13) transitions.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:45:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:45:06] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:45:06] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 16:45:06] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:45:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:45:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 142/160 places, 149/162 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s5 s37), p2:(LEQ s132 s129), p0:(LEQ s76 s81)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 230 ms.
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Graph (complete) has 165 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Product exploration explored 100000 steps with 25000 reset in 261 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0)]
Support contains 6 out of 142 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 142/142 places, 149/149 transitions.
Graph (trivial) has 119 edges and 142 vertex of which 14 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 129 transition count 135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 49 place count 129 transition count 138
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 72 place count 129 transition count 138
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 95 place count 106 transition count 115
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 118 place count 106 transition count 115
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 137 place count 106 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 106 transition count 113
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 165 place count 80 transition count 87
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 191 place count 80 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 80 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 78 transition count 85
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 78 transition count 85
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 205 place count 78 transition count 131
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 216 place count 78 transition count 120
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 228 place count 66 transition count 87
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 240 place count 66 transition count 87
Deduced a syphon composed of 37 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 65 transition count 84
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 65 transition count 84
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 243 rules in 13 ms. Remains 65 /142 variables (removed 77) and now considering 84/149 (removed 65) transitions.
[2021-05-12 16:45:08] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 84 rows 65 cols
[2021-05-12 16:45:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:45:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/142 places, 84/149 transitions.
Product exploration explored 100000 steps with 25000 reset in 285 ms.
Product exploration explored 100000 steps with 25000 reset in 297 ms.
[2021-05-12 16:45:09] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:45:09] [INFO ] Flatten gal took : 8 ms
[2021-05-12 16:45:09] [INFO ] Time to serialize gal into /tmp/LTL7816869475247045446.gal : 1 ms
[2021-05-12 16:45:09] [INFO ] Time to serialize properties into /tmp/LTL1982616517062169411.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/LTL7816869475247045446.gal, -t, CGAL, -LTL, /tmp/LTL1982616517062169411.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/LTL7816869475247045446.gal -t CGAL -LTL /tmp/LTL1982616517062169411.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(callToTask.s00003980.output.s00001080<=decision.s00001123.activated)"))))&&(F(("(callToProcess.s00003859.output.s00001083<=callToTask.s00003963.input.s00001052)")||(X("(merge.s00001162.activated<=merge.s00001160.input.s00001068)")))))))
Formula 0 simplified : !X(XXF"(callToTask.s00003980.output.s00001080<=decision.s00001123.activated)" & F("(callToProcess.s00003859.output.s00001083<=callToTask.s00003963.input.s00001052)" | X"(merge.s00001162.activated<=merge.s00001160.input.s00001068)"))
Detected timeout of ITS tools.
[2021-05-12 16:45:24] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:45:24] [INFO ] Applying decomposition
[2021-05-12 16:45:24] [INFO ] Flatten gal took : 13 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/graph14002570522547959998.txt, -o, /tmp/graph14002570522547959998.bin, -w, /tmp/graph14002570522547959998.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/graph14002570522547959998.bin, -l, -1, -v, -w, /tmp/graph14002570522547959998.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:45:24] [INFO ] Decomposing Gal with order
[2021-05-12 16:45:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:45:24] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-12 16:45:24] [INFO ] Flatten gal took : 10 ms
[2021-05-12 16:45:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2021-05-12 16:45:24] [INFO ] Time to serialize gal into /tmp/LTL3367771151375009869.gal : 3 ms
[2021-05-12 16:45:24] [INFO ] Time to serialize properties into /tmp/LTL776199210912800697.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3367771151375009869.gal, -t, CGAL, -LTL, /tmp/LTL776199210912800697.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/LTL3367771151375009869.gal -t CGAL -LTL /tmp/LTL776199210912800697.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(gu38.callToTask.s00003980.output.s00001080<=gu38.decision.s00001123.activated)"))))&&(F(("(gu2.callToProcess.s00003859.output.s00001083<=gu2.callToTask.s00003963.input.s00001052)")||(X("(gu59.merge.s00001162.activated<=gu59.merge.s00001160.input.s00001068)")))))))
Formula 0 simplified : !X(XXF"(gu38.callToTask.s00003980.output.s00001080<=gu38.decision.s00001123.activated)" & F("(gu2.callToProcess.s00003859.output.s00001083<=gu2.callToTask.s00003963.input.s00001052)" | X"(gu59.merge.s00001162.activated<=gu59.merge.s00001160.input.s00001068)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14671657922056584510
[2021-05-12 16:45:41] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14671657922056584510
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/ltsmin14671657922056584510]
Compilation finished in 614 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14671657922056584510]
Link finished in 48 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((X(X(<>((LTLAPp0==true))))&&<>(((LTLAPp1==true)||X((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14671657922056584510]
LTSmin run took 400 ms.
FORMULA IBMB2S565S3960-PT-none-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-09 finished in 35807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 162/162 transitions.
Graph (complete) has 191 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 153 transition count 79
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 72 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 70 transition count 76
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 169 place count 70 transition count 52
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 219 place count 44 transition count 52
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 221 place count 43 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 42 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 41 transition count 50
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 227 place count 38 transition count 47
Iterating global reduction 6 with 3 rules applied. Total rules applied 230 place count 38 transition count 47
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 256 place count 25 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 259 place count 25 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 265 place count 22 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 266 place count 22 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 268 place count 22 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 269 place count 21 transition count 31
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 270 place count 20 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 271 place count 19 transition count 30
Applied a total of 271 rules in 9 ms. Remains 19 /160 variables (removed 141) and now considering 30/162 (removed 132) transitions.
// Phase 1: matrix 30 rows 19 cols
[2021-05-12 16:45:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:45:42] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 30 rows 19 cols
[2021-05-12 16:45:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:45:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned [8]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 35 ms to find 1 implicit places.
[2021-05-12 16:45:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 28 rows 18 cols
[2021-05-12 16:45:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:45:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 18/160 places, 28/162 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 26
Applied a total of 2 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 26/28 (removed 2) transitions.
// Phase 1: matrix 26 rows 18 cols
[2021-05-12 16:45:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:45:42] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 26 rows 18 cols
[2021-05-12 16:45:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:45:42] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/160 places, 26/162 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s8), p1:(LEQ s6 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1445 steps with 94 reset in 4 ms.
FORMULA IBMB2S565S3960-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-15 finished in 169 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620837943488

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406800348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;