Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282300459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FunctionPointer-PT-b064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 7 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 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 FunctionPointer-PT-b064-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654842397688

Running Version 202205111006
[2022-06-10 06:26:38] [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]
[2022-06-10 06:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:26:39] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-10 06:26:39] [INFO ] Transformed 306 places.
[2022-06-10 06:26:39] [INFO ] Transformed 840 transitions.
[2022-06-10 06:26:39] [INFO ] Parsed PT model containing 306 places and 840 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA FunctionPointer-PT-b064-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 35 place count 187 transition count 490
Iterating global reduction 1 with 26 rules applied. Total rules applied 61 place count 187 transition count 490
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 87 place count 187 transition count 464
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 172 transition count 434
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 172 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 172 transition count 430
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 127 place count 166 transition count 418
Iterating global reduction 3 with 6 rules applied. Total rules applied 133 place count 166 transition count 418
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 139 place count 160 transition count 394
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 160 transition count 394
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 151 place count 154 transition count 382
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 154 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 150 transition count 366
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 150 transition count 366
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 169 place count 146 transition count 350
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 146 transition count 350
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 177 place count 142 transition count 342
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 142 transition count 342
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 139 transition count 336
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 139 transition count 336
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 189 place count 137 transition count 332
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 137 transition count 332
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 193 place count 135 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 135 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 134 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 134 transition count 326
Applied a total of 197 rules in 90 ms. Remains 134 /222 variables (removed 88) and now considering 326/648 (removed 322) transitions.
[2022-06-10 06:26:39] [INFO ] Flow matrix only has 227 transitions (discarded 99 similar events)
// Phase 1: matrix 227 rows 134 cols
[2022-06-10 06:26:39] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 06:26:39] [INFO ] Implicit Places using invariants in 219 ms returned []
[2022-06-10 06:26:39] [INFO ] Flow matrix only has 227 transitions (discarded 99 similar events)
// Phase 1: matrix 227 rows 134 cols
[2022-06-10 06:26:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:26:39] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-10 06:26:39] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2022-06-10 06:26:39] [INFO ] Flow matrix only has 227 transitions (discarded 99 similar events)
// Phase 1: matrix 227 rows 134 cols
[2022-06-10 06:26:39] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 06:26:39] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/222 places, 326/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/222 places, 326/648 transitions.
Support contains 12 out of 134 places after structural reductions.
[2022-06-10 06:26:40] [INFO ] Flatten gal took : 48 ms
[2022-06-10 06:26:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA FunctionPointer-PT-b064-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 06:26:40] [INFO ] Flatten gal took : 22 ms
[2022-06-10 06:26:40] [INFO ] Input system was already deterministic with 326 transitions.
Support contains 11 out of 134 places (down from 12) after GAL structural reductions.
Incomplete random walk after 10049 steps, including 4 resets, run finished after 157 ms. (steps per millisecond=64 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:26:40] [INFO ] Flow matrix only has 227 transitions (discarded 99 similar events)
// Phase 1: matrix 227 rows 134 cols
[2022-06-10 06:26:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:26:40] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:26:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 06:26:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 06:26:40] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:40] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-10 06:26:40] [INFO ] After 21ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:40] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-10 06:26:40] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 326/326 transitions.
Graph (complete) has 538 edges and 134 vertex of which 110 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 110 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 104 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 104 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 104 transition count 258
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 99 transition count 244
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 99 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 95 transition count 236
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 92 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 92 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 90 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 90 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 88 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 88 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 86 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 86 transition count 218
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 86 transition count 214
Applied a total of 105 rules in 45 ms. Remains 86 /134 variables (removed 48) and now considering 214/326 (removed 112) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/134 places, 214/326 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1799459 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{}
Probabilistic random walk after 1799459 steps, saw 1134294 distinct states, run finished after 3002 ms. (steps per millisecond=599 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:26:43] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2022-06-10 06:26:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 06:26:43] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:26:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 06:26:43] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:26:43] [INFO ] After 9ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:43] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-10 06:26:43] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2022-06-10 06:26:43] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2022-06-10 06:26:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 06:26:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 06:26:43] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2022-06-10 06:26:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 06:26:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:26:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-06-10 06:26:43] [INFO ] Redundant transitions in 7 ms returned []
[2022-06-10 06:26:43] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2022-06-10 06:26:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 06:26:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 214/214 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 86 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 78 transition count 125
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 97 place count 78 transition count 108
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 131 place count 61 transition count 108
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 39 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 39 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 32 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 32 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 25 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 25 transition count 51
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 210 place count 25 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 210 place count 25 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 24 transition count 43
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 3 with 4 rules applied. Total rules applied 216 place count 22 transition count 43
Applied a total of 216 rules in 20 ms. Remains 22 /86 variables (removed 64) and now considering 43/214 (removed 171) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 22 cols
[2022-06-10 06:26:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 06:26:44] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:26:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 06:26:44] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 06:26:44] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:44] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-10 06:26:44] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:26:44] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:26:44] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:26:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8615478419032599381.gal : 1 ms
[2022-06-10 06:26:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11019651067452541556.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16698914871987802725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8615478419032599381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11019651067452541556.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11019651067452541556.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 74116
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :74116 after 2.14714e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.14714e+08 after 1.77591e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.77591e+09 after 9.4111e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.4111e+09 after 4.27012e+10
Detected timeout of ITS tools.
[2022-06-10 06:26:59] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:26:59] [INFO ] Applying decomposition
[2022-06-10 06:26:59] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7483612742657945420.txt' '-o' '/tmp/graph7483612742657945420.bin' '-w' '/tmp/graph7483612742657945420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7483612742657945420.bin' '-l' '-1' '-v' '-w' '/tmp/graph7483612742657945420.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:26:59] [INFO ] Decomposing Gal with order
[2022-06-10 06:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:26:59] [INFO ] Removed a total of 47 redundant transitions.
[2022-06-10 06:26:59] [INFO ] Flatten gal took : 29 ms
[2022-06-10 06:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2022-06-10 06:26:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17628250177671287986.gal : 2 ms
[2022-06-10 06:26:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12452397993147013683.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16698914871987802725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17628250177671287986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12452397993147013683.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality12452397993147013683.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 25412
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :25412 after 1.06792e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.06792e+07 after 1.57249e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.57249e+08 after 9.95846e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4655105511366829889
[2022-06-10 06:27:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4655105511366829889
Running compilation step : cd /tmp/ltsmin4655105511366829889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin4655105511366829889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4655105511366829889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp7==true'
LTSmin run took 100 ms.
Found Violation
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 720 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)||F(p2)))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 326/326 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 128 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 128 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 128 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 123 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 123 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 119 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 115 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 112 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 109 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 106 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 105 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 104 transition count 252
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 103 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 103 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 102 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 102 transition count 248
Applied a total of 65 rules in 15 ms. Remains 102 /134 variables (removed 32) and now considering 248/326 (removed 78) transitions.
[2022-06-10 06:27:14] [INFO ] Flow matrix only has 170 transitions (discarded 78 similar events)
// Phase 1: matrix 170 rows 102 cols
[2022-06-10 06:27:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-06-10 06:27:14] [INFO ] Flow matrix only has 170 transitions (discarded 78 similar events)
// Phase 1: matrix 170 rows 102 cols
[2022-06-10 06:27:14] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-10 06:27:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-06-10 06:27:15] [INFO ] Flow matrix only has 170 transitions (discarded 78 similar events)
// Phase 1: matrix 170 rows 102 cols
[2022-06-10 06:27:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/134 places, 248/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/134 places, 248/326 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ 1 s69), p0:(OR (LEQ s76 0) (LEQ 3 s75)), p1:(GT 3 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 336 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-b064-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b064-LTLCardinality-02 finished in 1382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X((F(p0)&&p1)) U (X(p2)||p2))))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 326/326 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 127 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 127 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 127 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 122 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 122 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 118 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 118 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 115 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 115 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 113 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 113 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 111 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 109 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 108 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 107 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 105 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 104 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 104 transition count 254
Applied a total of 63 rules in 20 ms. Remains 104 /134 variables (removed 30) and now considering 254/326 (removed 72) transitions.
[2022-06-10 06:27:16] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:27:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-10 06:27:16] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:16] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-10 06:27:16] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:16] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/134 places, 254/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/134 places, 254/326 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s83 0), p1:(LEQ s67 0), p0:(LEQ 3 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3887 steps with 40 reset in 19 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-04 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||!(!p0 U p1))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 326/326 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 129 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 129 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 129 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 125 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 125 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 122 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 122 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 120 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 120 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 118 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 118 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 116 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 114 transition count 274
Applied a total of 44 rules in 31 ms. Remains 114 /134 variables (removed 20) and now considering 274/326 (removed 52) transitions.
[2022-06-10 06:27:16] [INFO ] Flow matrix only has 188 transitions (discarded 86 similar events)
// Phase 1: matrix 188 rows 114 cols
[2022-06-10 06:27:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 06:27:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-06-10 06:27:16] [INFO ] Flow matrix only has 188 transitions (discarded 86 similar events)
// Phase 1: matrix 188 rows 114 cols
[2022-06-10 06:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-10 06:27:17] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-10 06:27:17] [INFO ] Flow matrix only has 188 transitions (discarded 86 similar events)
// Phase 1: matrix 188 rows 114 cols
[2022-06-10 06:27:17] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 06:27:17] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/134 places, 274/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/134 places, 274/326 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s81 0), p1:(LEQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-07 finished in 565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 326/326 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 127 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 127 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 127 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 122 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 122 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 118 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 118 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 115 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 115 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 113 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 113 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 111 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 109 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 108 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 107 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 105 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 104 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 104 transition count 254
Applied a total of 63 rules in 13 ms. Remains 104 /134 variables (removed 30) and now considering 254/326 (removed 72) transitions.
[2022-06-10 06:27:17] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-06-10 06:27:17] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2022-06-10 06:27:17] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:17] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/134 places, 254/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/134 places, 254/326 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s15 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-12 finished in 535 ms.
All properties solved by simple procedures.
Total runtime 39015 ms.

BK_STOP 1654842437909

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="FunctionPointer-PT-b064"
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 FunctionPointer-PT-b064, 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 r312-tall-165472282300459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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