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-165472282300468.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-b128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 7 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Jun 7 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-b128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654845997716

Running Version 202205111006
[2022-06-10 07:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 07:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 07:26:39] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-10 07:26:39] [INFO ] Transformed 306 places.
[2022-06-10 07:26:39] [INFO ] Transformed 840 transitions.
[2022-06-10 07:26:39] [INFO ] Parsed PT model containing 306 places and 840 transitions in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 36 place count 186 transition count 520
Iterating global reduction 1 with 26 rules applied. Total rules applied 62 place count 186 transition count 520
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 108 place count 186 transition count 474
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 121 place count 173 transition count 448
Iterating global reduction 2 with 13 rules applied. Total rules applied 134 place count 173 transition count 448
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 146 place count 173 transition count 436
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 167 transition count 424
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 167 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 162 transition count 404
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 162 transition count 404
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 173 place count 157 transition count 394
Iterating global reduction 3 with 5 rules applied. Total rules applied 178 place count 157 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 155 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 155 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 153 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 153 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 151 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 151 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 149 transition count 370
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 149 transition count 370
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 147 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 147 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 145 transition count 362
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 145 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 203 place count 144 transition count 360
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 144 transition count 360
Applied a total of 204 rules in 89 ms. Remains 144 /222 variables (removed 78) and now considering 360/648 (removed 288) transitions.
[2022-06-10 07:26:39] [INFO ] Flow matrix only has 246 transitions (discarded 114 similar events)
// Phase 1: matrix 246 rows 144 cols
[2022-06-10 07:26:39] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-10 07:26:39] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-06-10 07:26:39] [INFO ] Flow matrix only has 246 transitions (discarded 114 similar events)
// Phase 1: matrix 246 rows 144 cols
[2022-06-10 07:26:39] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 07:26:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 07:26:39] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2022-06-10 07:26:39] [INFO ] Flow matrix only has 246 transitions (discarded 114 similar events)
// Phase 1: matrix 246 rows 144 cols
[2022-06-10 07:26:39] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 07:26:39] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/222 places, 360/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/222 places, 360/648 transitions.
Support contains 17 out of 144 places after structural reductions.
[2022-06-10 07:26:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 07:26:40] [INFO ] Flatten gal took : 55 ms
FORMULA FunctionPointer-PT-b128-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 07:26:40] [INFO ] Flatten gal took : 25 ms
[2022-06-10 07:26:40] [INFO ] Input system was already deterministic with 360 transitions.
Incomplete random walk after 10032 steps, including 6 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-10 07:26:40] [INFO ] Flow matrix only has 246 transitions (discarded 114 similar events)
// Phase 1: matrix 246 rows 144 cols
[2022-06-10 07:26:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:26:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 07:26:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:26:40] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2022-06-10 07:26:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 07:26:40] [INFO ] After 44ms SMT Verify possible using 55 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-10 07:26:40] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-10 07:26:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 07:26:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:26:40] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-10 07:26:40] [INFO ] After 48ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-10 07:26:41] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-10 07:26:41] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 346
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 346
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 139 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 136 transition count 332
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 136 transition count 332
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 133 transition count 322
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 133 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 130 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 127 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 127 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 124 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 124 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 121 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 119 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 115 transition count 280
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 115 transition count 274
Applied a total of 70 rules in 113 ms. Remains 115 /144 variables (removed 29) and now considering 274/360 (removed 86) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/144 places, 274/360 transitions.
Incomplete random walk after 10014 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 294959 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294959 steps, saw 193929 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-10 07:26:44] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 07:26:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:26:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:26:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:26:44] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-06-10 07:26:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:26:44] [INFO ] After 26ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 07:26:44] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 07:26:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:26:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:26:44] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 07:26:44] [INFO ] After 32ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 07:26:44] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-10 07:26:44] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 17 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 274/274 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 12 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2022-06-10 07:26:44] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 07:26:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:26:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-06-10 07:26:44] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 07:26:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:26:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:26:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-10 07:26:45] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-10 07:26:45] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 07:26:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:26:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 274/274 transitions.
Graph (trivial) has 165 edges and 115 vertex of which 24 / 115 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 99 transition count 155
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 92 transition count 155
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 15 place count 92 transition count 135
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 55 place count 72 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 65 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 65 transition count 128
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 83 place count 65 transition count 114
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 3 with 30 rules applied. Total rules applied 113 place count 50 transition count 99
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 43 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 43 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 36 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 36 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 29 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 29 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 162 place count 29 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 29 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 28 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 25 transition count 49
Applied a total of 170 rules in 31 ms. Remains 25 /115 variables (removed 90) and now considering 49/274 (removed 225) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 49 rows 25 cols
[2022-06-10 07:26:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:26:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:26:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 07:26:45] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-06-10 07:26:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 07:26:45] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 07:26:45] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 07:26:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 07:26:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:26:45] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 07:26:45] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 07:26:45] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 07:26:45] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-10 07:26:45] [INFO ] Flatten gal took : 5 ms
[2022-06-10 07:26:45] [INFO ] Flatten gal took : 3 ms
[2022-06-10 07:26:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8812637034580051169.gal : 9 ms
[2022-06-10 07:26:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1384425920203549059.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms352185512417396974;'/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/ReachabilityCardinality8812637034580051169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1384425920203549059.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...319
Loading property file /tmp/ReachabilityCardinality1384425920203549059.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 759
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :759 after 1.21052e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.21052e+06 after 1.38116e+13
Detected timeout of ITS tools.
[2022-06-10 07:27:00] [INFO ] Flatten gal took : 9 ms
[2022-06-10 07:27:00] [INFO ] Applying decomposition
[2022-06-10 07:27:00] [INFO ] Flatten gal took : 3 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/graph11363253170596311765.txt' '-o' '/tmp/graph11363253170596311765.bin' '-w' '/tmp/graph11363253170596311765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11363253170596311765.bin' '-l' '-1' '-v' '-w' '/tmp/graph11363253170596311765.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:27:00] [INFO ] Decomposing Gal with order
[2022-06-10 07:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:27:00] [INFO ] Removed a total of 65 redundant transitions.
[2022-06-10 07:27:00] [INFO ] Flatten gal took : 30 ms
[2022-06-10 07:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2022-06-10 07:27:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16757362597928928116.gal : 2 ms
[2022-06-10 07:27:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2508595738263428421.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms352185512417396974;'/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/ReachabilityCardinality16757362597928928116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2508595738263428421.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...299
Loading property file /tmp/ReachabilityCardinality2508595738263428421.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 759
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9850986922307695026
[2022-06-10 07:27:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9850986922307695026
Running compilation step : cd /tmp/ltsmin9850986922307695026;'/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 177 ms.
Running link step : cd /tmp/ltsmin9850986922307695026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9850986922307695026;'/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' 'AtomicPropp2==true'
LTSmin run took 76 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin9850986922307695026;'/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' 'AtomicPropp3==true'
LTSmin run took 55 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin9850986922307695026;'/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' 'AtomicPropp10==true'
LTSmin run took 47 ms.
Found Violation
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-b128-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 130 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 126 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 118 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 114 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 108 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 108 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 108 transition count 260
Applied a total of 78 rules in 66 ms. Remains 108 /144 variables (removed 36) and now considering 260/360 (removed 100) transitions.
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-10 07:27:16] [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 07:27:16] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:27:16] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/144 places, 260/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/144 places, 260/360 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-00 finished in 618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(F(G(p0)))&&X(X(p0)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 137 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 137 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 132 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 132 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 127 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 117 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 112 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 107 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 103 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 97 transition count 234
Applied a total of 98 rules in 45 ms. Remains 97 /144 variables (removed 47) and now considering 234/360 (removed 126) transitions.
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 07:27:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 07:27:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-10 07:27:16] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 07:27:16] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 07:27:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:27:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/144 places, 234/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/144 places, 234/360 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-02 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((!F((F(p1)&&p0))&&G(p2)) U X(p3)))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 130 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 126 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 106 transition count 258
Applied a total of 80 rules in 20 ms. Remains 106 /144 variables (removed 38) and now considering 258/360 (removed 102) transitions.
[2022-06-10 07:27:17] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 07:27:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 07:27:17] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 07:27:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:17] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-06-10 07:27:17] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 07:27:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:17] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/144 places, 258/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/144 places, 258/360 transitions.
Stuttering acceptance computed with spot in 441 ms :[true, p3, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1)), p3, p3, p3, (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (AND p2 (NOT p1) p3)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p2) (AND p0 p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p0) p3), acceptance={} source=7 dest: 2}, { cond=(AND p2 p0 (NOT p1) p3), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 (NOT p1) p3), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p3:(AND (GEQ s1 1) (GEQ s45 1)), p2:(AND (GEQ s1 1) (GEQ s13 1)), p0:(AND (GEQ s0 1) (GEQ s87 1)), p1:(AND (GEQ s0 1) (GEQ s87 1))], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Product exploration explored 100000 steps with 50000 reset in 257 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p2 p0 (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), true, (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p0) p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 12 factoid took 176 ms. Reduced automaton from 9 states, 19 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-b128-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLFireability-05 finished in 1517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 138 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 133 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 128 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 128 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 118 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 118 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 113 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 113 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 108 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 104 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 98 transition count 238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 98 transition count 236
Applied a total of 96 rules in 66 ms. Remains 98 /144 variables (removed 46) and now considering 236/360 (removed 124) transitions.
[2022-06-10 07:27:18] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:27:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-06-10 07:27:18] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:27:18] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 07:27:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 07:27:19] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2022-06-10 07:27:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 07:27:19] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:27:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:19] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/144 places, 236/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/144 places, 236/360 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-08 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U F(X(G(!p0))))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 130 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 126 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 106 transition count 254
Applied a total of 84 rules in 54 ms. Remains 106 /144 variables (removed 38) and now considering 254/360 (removed 106) transitions.
[2022-06-10 07:27:19] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:19] [INFO ] Implicit Places using invariants in 405 ms returned []
[2022-06-10 07:27:19] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2022-06-10 07:27:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 07:27:19] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 07:27:19] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/144 places, 254/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/144 places, 254/360 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1026 reset in 349 ms.
Product exploration explored 100000 steps with 980 reset in 359 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p0]
Finished random walk after 3509 steps, including 3 resets, run visited all 1 properties in 7 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[p0]
Stuttering acceptance computed with spot in 25 ms :[p0]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2022-06-10 07:27:21] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:21] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:27:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-10 07:27:21] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:21] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-06-10 07:27:21] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 07:27:21] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:21] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 254/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p0]
Incomplete random walk after 10003 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1537413 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1537413 steps, saw 1010723 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 07:27:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:24] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 07:27:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:27:24] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 07:27:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:24] [INFO ] After 16ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:24] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 07:27:24] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:24] [INFO ] After 11ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:24] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-10 07:27:24] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 254/254 transitions.
Incomplete random walk after 10017 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1252 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1671264 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1671264 steps, saw 1098714 distinct states, run finished after 3003 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 07:27:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 07:27:27] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 07:27:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:27] [INFO ] After 13ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:27] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 07:27:28] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] After 12ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 07:27:28] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 254/254 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2022-06-10 07:27:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:27:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 07:27:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:27:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:27:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-10 07:27:28] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 07:27:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:27:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:27:28] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 254/254 transitions.
Graph (trivial) has 153 edges and 106 vertex of which 24 / 106 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 106 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 90 transition count 142
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 84 transition count 142
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 84 transition count 125
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 47 place count 67 transition count 125
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 60 transition count 118
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 60 transition count 118
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 75 place count 60 transition count 104
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 3 with 30 rules applied. Total rules applied 105 place count 45 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 38 transition count 75
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 38 transition count 75
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 126 place count 31 transition count 61
Iterating global reduction 3 with 7 rules applied. Total rules applied 133 place count 31 transition count 61
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 140 place count 24 transition count 47
Iterating global reduction 3 with 7 rules applied. Total rules applied 147 place count 24 transition count 47
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 24 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 24 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 23 transition count 39
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 4 with 4 rules applied. Total rules applied 160 place count 21 transition count 39
Applied a total of 160 rules in 11 ms. Remains 21 /106 variables (removed 85) and now considering 39/254 (removed 215) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 21 cols
[2022-06-10 07:27:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 07:27:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:27:28] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 07:27:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:28] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:27:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 07:27:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 07:27:28] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 07:27:28] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:27:28] [INFO ] Flatten gal took : 3 ms
[2022-06-10 07:27:28] [INFO ] Flatten gal took : 2 ms
[2022-06-10 07:27:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality133147795133733718.gal : 2 ms
[2022-06-10 07:27:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12576432425537242904.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16867295915028169603;'/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/ReachabilityCardinality133147795133733718.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12576432425537242904.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...319
Loading property file /tmp/ReachabilityCardinality12576432425537242904.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 759
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :759 after 671246
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :671246 after 4.00282e+11
Detected timeout of ITS tools.
[2022-06-10 07:27:43] [INFO ] Flatten gal took : 8 ms
[2022-06-10 07:27:43] [INFO ] Applying decomposition
[2022-06-10 07:27:43] [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/graph13590601978015542526.txt' '-o' '/tmp/graph13590601978015542526.bin' '-w' '/tmp/graph13590601978015542526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13590601978015542526.bin' '-l' '-1' '-v' '-w' '/tmp/graph13590601978015542526.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:27:43] [INFO ] Decomposing Gal with order
[2022-06-10 07:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:27:43] [INFO ] Removed a total of 36 redundant transitions.
[2022-06-10 07:27:43] [INFO ] Flatten gal took : 7 ms
[2022-06-10 07:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2022-06-10 07:27:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9817067515891839183.gal : 3 ms
[2022-06-10 07:27:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15758062061429370345.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16867295915028169603;'/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/ReachabilityCardinality9817067515891839183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15758062061429370345.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...299
Loading property file /tmp/ReachabilityCardinality15758062061429370345.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 759
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :759 after 90690
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90690 after 1.05467e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.05467e+08 after 3.81299e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.81299e+08 after 9.31892e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1370412653935641655
[2022-06-10 07:27:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1370412653935641655
Running compilation step : cd /tmp/ltsmin1370412653935641655;'/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 107 ms.
Running link step : cd /tmp/ltsmin1370412653935641655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1370412653935641655;'/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' 'apf0==true'
LTSmin run took 205 ms.
Found Violation
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 39 ms :[p0]
Product exploration explored 100000 steps with 968 reset in 253 ms.
Product exploration explored 100000 steps with 1018 reset in 329 ms.
Built C files in :
/tmp/ltsmin2133747695414005872
[2022-06-10 07:27:59] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2022-06-10 07:27:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:27:59] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2022-06-10 07:27:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:27:59] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2022-06-10 07:27:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:27:59] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2133747695414005872
Running compilation step : cd /tmp/ltsmin2133747695414005872;'/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 451 ms.
Running link step : cd /tmp/ltsmin2133747695414005872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2133747695414005872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15954620581987642766.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2022-06-10 07:28:14] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:28:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 07:28:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-10 07:28:14] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:28:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:28:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:28:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-10 07:28:15] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 07:28:15] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2022-06-10 07:28:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:28:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin11054937206515725222
[2022-06-10 07:28:15] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2022-06-10 07:28:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:28:15] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2022-06-10 07:28:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:28:15] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2022-06-10 07:28:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:28:15] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11054937206515725222
Running compilation step : cd /tmp/ltsmin11054937206515725222;'/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 456 ms.
Running link step : cd /tmp/ltsmin11054937206515725222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11054937206515725222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4452096945666728579.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 07:28:30] [INFO ] Flatten gal took : 14 ms
[2022-06-10 07:28:30] [INFO ] Flatten gal took : 13 ms
[2022-06-10 07:28:30] [INFO ] Time to serialize gal into /tmp/LTL9195814743671021843.gal : 2 ms
[2022-06-10 07:28:30] [INFO ] Time to serialize properties into /tmp/LTL1680020906788254990.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9195814743671021843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1680020906788254990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9195814...266
Read 1 LTL properties
Checking formula 0 : !((G(("((s0>=1)&&(l177>=1))")U(F(X(G(!("((s0>=1)&&(l177>=1))"))))))))
Formula 0 simplified : !G("((s0>=1)&&(l177>=1))" U FXG!"((s0>=1)&&(l177>=1))")
Detected timeout of ITS tools.
[2022-06-10 07:28:45] [INFO ] Flatten gal took : 12 ms
[2022-06-10 07:28:45] [INFO ] Applying decomposition
[2022-06-10 07:28:45] [INFO ] Flatten gal took : 13 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/graph3909884019710170405.txt' '-o' '/tmp/graph3909884019710170405.bin' '-w' '/tmp/graph3909884019710170405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3909884019710170405.bin' '-l' '-1' '-v' '-w' '/tmp/graph3909884019710170405.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:28:45] [INFO ] Decomposing Gal with order
[2022-06-10 07:28:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:28:45] [INFO ] Removed a total of 423 redundant transitions.
[2022-06-10 07:28:45] [INFO ] Flatten gal took : 23 ms
[2022-06-10 07:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 9 ms.
[2022-06-10 07:28:45] [INFO ] Time to serialize gal into /tmp/LTL7669259610558486509.gal : 4 ms
[2022-06-10 07:28:45] [INFO ] Time to serialize properties into /tmp/LTL8506024938407571194.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7669259610558486509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8506024938407571194.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7669259...245
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.u0.s0>=1)&&(i10.i1.u25.l177>=1))")U(F(X(G(!("((i0.u0.s0>=1)&&(i10.i1.u25.l177>=1))"))))))))
Formula 0 simplified : !G("((i0.u0.s0>=1)&&(i10.i1.u25.l177>=1))" U FXG!"((i0.u0.s0>=1)&&(i10.i1.u25.l177>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10419271809337576838
[2022-06-10 07:29:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10419271809337576838
Running compilation step : cd /tmp/ltsmin10419271809337576838;'/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 377 ms.
Running link step : cd /tmp/ltsmin10419271809337576838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10419271809337576838;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 116348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 138 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 134 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 134 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 130 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 126 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 122 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 122 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 118 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 114 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 108 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 106 transition count 260
Applied a total of 78 rules in 12 ms. Remains 106 /144 variables (removed 38) and now considering 260/360 (removed 100) transitions.
[2022-06-10 07:29:15] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 07:29:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:29:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 07:29:15] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 07:29:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 07:29:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-10 07:29:15] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 07:29:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:15] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/144 places, 260/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/144 places, 260/360 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s0 1) (GEQ s66 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 137 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 137 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 132 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 132 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 127 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 117 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 112 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 107 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 103 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 97 transition count 236
Applied a total of 96 rules in 11 ms. Remains 97 /144 variables (removed 47) and now considering 236/360 (removed 124) transitions.
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:29:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 07:29:16] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:29:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/144 places, 236/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/144 places, 236/360 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11 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:(AND (GEQ s2 1) (GEQ s66 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 130 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 127 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 127 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 124 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 124 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 121 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 121 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 118 transition count 282
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 118 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 115 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 110 transition count 266
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 110 transition count 262
Applied a total of 76 rules in 34 ms. Remains 110 /144 variables (removed 34) and now considering 262/360 (removed 98) transitions.
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 110 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 110 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:29:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:29:16] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-06-10 07:29:16] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 110 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/144 places, 262/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/144 places, 262/360 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s4 1) (GEQ s80 1)), p0:(OR (LT s0 1) (LT s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3588 steps with 37 reset in 14 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-12 finished in 494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(X(X(F(p0))))||p0))&&G(p0))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 340
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 133 transition count 328
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 133 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 128 transition count 310
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 128 transition count 310
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 123 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 118 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 113 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 108 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 108 transition count 260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 104 transition count 252
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 100 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 98 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 98 transition count 240
Applied a total of 92 rules in 14 ms. Remains 98 /144 variables (removed 46) and now considering 240/360 (removed 120) transitions.
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-10 07:29:16] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:29:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 07:29:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 07:29:17] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-10 07:29:17] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 07:29:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 07:29:17] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 240/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/144 places, 240/360 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-13 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:(AND (GEQ s1 1) (GEQ s80 1))], 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 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-13 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U F(X(G(!p0))))))'
[2022-06-10 07:29:17] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5697528074568616549
[2022-06-10 07:29:17] [INFO ] Computing symmetric may disable matrix : 360 transitions.
[2022-06-10 07:29:17] [INFO ] Applying decomposition
[2022-06-10 07:29:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:29:17] [INFO ] Computing symmetric may enable matrix : 360 transitions.
[2022-06-10 07:29:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:29:17] [INFO ] Flatten gal took : 16 ms
[2022-06-10 07:29:17] [INFO ] Computing Do-Not-Accords matrix : 360 transitions.
[2022-06-10 07:29:17] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:29:17] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5697528074568616549
Running compilation step : cd /tmp/ltsmin5697528074568616549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph17954192072604903030.txt' '-o' '/tmp/graph17954192072604903030.bin' '-w' '/tmp/graph17954192072604903030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17954192072604903030.bin' '-l' '-1' '-v' '-w' '/tmp/graph17954192072604903030.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:29:17] [INFO ] Decomposing Gal with order
[2022-06-10 07:29:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:29:17] [INFO ] Removed a total of 606 redundant transitions.
[2022-06-10 07:29:17] [INFO ] Flatten gal took : 31 ms
[2022-06-10 07:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 9 ms.
[2022-06-10 07:29:17] [INFO ] Time to serialize gal into /tmp/LTLFireability6455295884027622929.gal : 3 ms
[2022-06-10 07:29:17] [INFO ] Time to serialize properties into /tmp/LTLFireability7610986508519790932.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6455295884027622929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7610986508519790932.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(("((i8.u0.s0>=1)&&(i11.u35.l177>=1))")U(F(X(G(!("((i8.u0.s0>=1)&&(i11.u35.l177>=1))"))))))))
Formula 0 simplified : !G("((i8.u0.s0>=1)&&(i11.u35.l177>=1))" U FXG!"((i8.u0.s0>=1)&&(i11.u35.l177>=1))")
Compilation finished in 702 ms.
Running link step : cd /tmp/ltsmin5697528074568616549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5697528074568616549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: [](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))
pins2lts-mc-linux64( 1/ 8), 0.005: "[](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: There are 362 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.033: State length is 145, there are 364 groups
pins2lts-mc-linux64( 0/ 8), 0.033: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.033: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.033: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.033: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.100: [Blue] ~96 levels ~960 states ~5768 transitions
pins2lts-mc-linux64( 1/ 8), 0.150: [Blue] ~190 levels ~1920 states ~11744 transitions
pins2lts-mc-linux64( 1/ 8), 0.249: [Blue] ~376 levels ~3840 states ~23688 transitions
pins2lts-mc-linux64( 2/ 8), 0.403: [Blue] ~960 levels ~7680 states ~35120 transitions
pins2lts-mc-linux64( 2/ 8), 0.548: [Blue] ~1920 levels ~15360 states ~60080 transitions
pins2lts-mc-linux64( 2/ 8), 0.822: [Blue] ~3840 levels ~30720 states ~110000 transitions
pins2lts-mc-linux64( 2/ 8), 1.288: [Blue] ~7680 levels ~61440 states ~209840 transitions
pins2lts-mc-linux64( 2/ 8), 1.969: [Blue] ~15360 levels ~122880 states ~409520 transitions
pins2lts-mc-linux64( 1/ 8), 2.897: [Blue] ~30468 levels ~245760 states ~1134984 transitions
pins2lts-mc-linux64( 1/ 8), 4.376: [Blue] ~61188 levels ~491520 states ~2240904 transitions
pins2lts-mc-linux64( 1/ 8), 7.192: [Blue] ~122628 levels ~983040 states ~4452744 transitions
pins2lts-mc-linux64( 1/ 8), 12.925: [Blue] ~245508 levels ~1966080 states ~8876424 transitions
pins2lts-mc-linux64( 1/ 8), 24.734: [Blue] ~491268 levels ~3932160 states ~17723784 transitions
pins2lts-mc-linux64( 4/ 8), 43.424: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 43.557:
pins2lts-mc-linux64( 0/ 8), 43.557: Explored 5983144 states 32060264 transitions, fanout: 5.358
pins2lts-mc-linux64( 0/ 8), 43.559: Total exploration time 43.510 sec (43.380 sec minimum, 43.456 sec on average)
pins2lts-mc-linux64( 0/ 8), 43.559: States per second: 137512, Transitions per second: 736848
pins2lts-mc-linux64( 0/ 8), 43.559:
pins2lts-mc-linux64( 0/ 8), 43.559: State space has 31525358 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 43.559: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 43.559: blue states: 5983144 (18.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 43.559: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 43.559: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 43.559:
pins2lts-mc-linux64( 0/ 8), 43.559: Total memory used for local state coloring: 91.3MB
pins2lts-mc-linux64( 0/ 8), 43.559:
pins2lts-mc-linux64( 0/ 8), 43.559: Queue width: 8B, total height: 5982892, memory: 45.65MB
pins2lts-mc-linux64( 0/ 8), 43.559: Tree memory: 496.5MB, 16.5 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 43.560: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 43.560: Stored 381 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 43.560: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 43.560: Est. total memory use: 542.2MB (~1069.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5697528074568616549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5697528074568616549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U <>(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 07:50:09] [INFO ] Flatten gal took : 14 ms
[2022-06-10 07:50:09] [INFO ] Time to serialize gal into /tmp/LTLFireability3835073115893833703.gal : 2 ms
[2022-06-10 07:50:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9456887834120131044.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3835073115893833703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9456887834120131044.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G(("((s0>=1)&&(l177>=1))")U(F(X(G(!("((s0>=1)&&(l177>=1))"))))))))
Formula 0 simplified : !G("((s0>=1)&&(l177>=1))" U FXG!"((s0>=1)&&(l177>=1))")
Detected timeout of ITS tools.
[2022-06-10 08:11:18] [INFO ] Flatten gal took : 167 ms
[2022-06-10 08:11:19] [INFO ] Input system was already deterministic with 360 transitions.
[2022-06-10 08:11:19] [INFO ] Transformed 144 places.
[2022-06-10 08:11:19] [INFO ] Transformed 360 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 08:11:19] [INFO ] Time to serialize gal into /tmp/LTLFireability16843146758107453592.gal : 13 ms
[2022-06-10 08:11:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14205531929670227707.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16843146758107453592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14205531929670227707.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((s0>=1)&&(l177>=1))")U(F(X(G(!("((s0>=1)&&(l177>=1))"))))))))
Formula 0 simplified : !G("((s0>=1)&&(l177>=1))" U FXG!"((s0>=1)&&(l177>=1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-b128"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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