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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Jun 7 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654839746379

Running Version 202205111006
[2022-06-10 05:42:27] [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 05:42:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 05:42:27] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2022-06-10 05:42:27] [INFO ] Transformed 306 places.
[2022-06-10 05:42:27] [INFO ] Transformed 840 transitions.
[2022-06-10 05:42:27] [INFO ] Parsed PT model containing 306 places and 840 transitions in 252 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 6 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 520
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 520
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 108 place count 187 transition count 472
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 175 transition count 448
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 175 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 144 place count 175 transition count 436
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 150 place count 169 transition count 424
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 169 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 164 transition count 404
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 164 transition count 404
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 171 place count 159 transition count 394
Iterating global reduction 3 with 5 rules applied. Total rules applied 176 place count 159 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 155 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 155 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 153 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 153 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 190 place count 151 transition count 370
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 151 transition count 370
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 194 place count 149 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 149 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 198 place count 147 transition count 362
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 147 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 201 place count 146 transition count 360
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 146 transition count 360
Applied a total of 202 rules in 85 ms. Remains 146 /222 variables (removed 76) and now considering 360/648 (removed 288) transitions.
[2022-06-10 05:42:28] [INFO ] Flow matrix only has 247 transitions (discarded 113 similar events)
// Phase 1: matrix 247 rows 146 cols
[2022-06-10 05:42:28] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 05:42:28] [INFO ] Implicit Places using invariants in 254 ms returned []
[2022-06-10 05:42:28] [INFO ] Flow matrix only has 247 transitions (discarded 113 similar events)
// Phase 1: matrix 247 rows 146 cols
[2022-06-10 05:42:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:42:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 05:42:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2022-06-10 05:42:28] [INFO ] Flow matrix only has 247 transitions (discarded 113 similar events)
// Phase 1: matrix 247 rows 146 cols
[2022-06-10 05:42:28] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 05:42:28] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/222 places, 360/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/222 places, 360/648 transitions.
Support contains 19 out of 146 places after structural reductions.
[2022-06-10 05:42:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 05:42:29] [INFO ] Flatten gal took : 56 ms
FORMULA FunctionPointer-PT-b032-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 05:42:29] [INFO ] Flatten gal took : 27 ms
[2022-06-10 05:42:29] [INFO ] Input system was already deterministic with 360 transitions.
Support contains 18 out of 146 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 05:42:29] [INFO ] Flow matrix only has 247 transitions (discarded 113 similar events)
// Phase 1: matrix 247 rows 146 cols
[2022-06-10 05:42:29] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 05:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 05:42:30] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 05:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-10 05:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 05:42:30] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 05:42:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 05:42:30] [INFO ] After 70ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 05:42:30] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-06-10 05:42:30] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 7 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 142 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 139 transition count 342
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 139 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 137 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 137 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 135 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 135 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 133 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 133 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 131 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 131 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 129 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 129 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 127 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 127 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 125 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 125 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 124 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 122 transition count 298
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 122 transition count 290
Applied a total of 58 rules in 113 ms. Remains 122 /146 variables (removed 24) and now considering 290/360 (removed 70) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/146 places, 290/360 transitions.
Incomplete random walk after 10016 steps, including 9 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-10 05:42:31] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
// Phase 1: matrix 198 rows 122 cols
[2022-06-10 05:42:31] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-10 05:42:31] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-06-10 05:42:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-10 05:42:31] [INFO ] After 30ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 05:42:31] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 05:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 05:42:31] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 05:42:31] [INFO ] After 32ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 05:42:31] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-10 05:42:31] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 290/290 transitions.
Applied a total of 0 rules in 13 ms. Remains 122 /122 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 290/290 transitions.
Incomplete random walk after 10009 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 05:42:31] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
// Phase 1: matrix 198 rows 122 cols
[2022-06-10 05:42:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 05:42:31] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 05:42:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-10 05:42:31] [INFO ] After 28ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 05:42:31] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 05:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:42:31] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 05:42:31] [INFO ] After 23ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 05:42:31] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-10 05:42:31] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 290/290 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 290/290 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 05:42:31] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
// Phase 1: matrix 198 rows 122 cols
[2022-06-10 05:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 05:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 05:42:32] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 05:42:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-10 05:42:32] [INFO ] After 15ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:32] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 05:42:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:42:32] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:32] [INFO ] After 20ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:32] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-10 05:42:32] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 290/290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 274
Applied a total of 14 rules in 31 ms. Remains 115 /122 variables (removed 7) and now considering 274/290 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/122 places, 274/290 transitions.
Incomplete random walk after 10000 steps, including 13 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1370713 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 1370713 steps, saw 901116 distinct states, run finished after 3003 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 05:42:35] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 05:42:35] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 05:42:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 05:42:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 05:42:35] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 05:42:35] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:35] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:42:35] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] After 11ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [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 9 ms.
[2022-06-10 05:42:35] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 7 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 8 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2022-06-10 05:42:35] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 05:42:35] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 05:42:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-06-10 05:42:35] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 05:42:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:42:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 05:42:35] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-06-10 05:42:35] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-10 05:42:35] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2022-06-10 05:42:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:42:35] [INFO ] Dead Transitions using invariants and state equation in 100 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 0 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 22 ms. Remains 25 /115 variables (removed 90) and now considering 49/274 (removed 225) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 49 rows 25 cols
[2022-06-10 05:42:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:42:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 05:42:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:42:35] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 05:42:35] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:35] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 05:42:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:42:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:42:35] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-10 05:42:35] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 05:42:35] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:42:35] [INFO ] Flatten gal took : 6 ms
[2022-06-10 05:42:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5029507035233648741.gal : 2 ms
[2022-06-10 05:42:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10039453305838044119.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4522848884837918471;'/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/ReachabilityCardinality5029507035233648741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10039453305838044119.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10039453305838044119.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 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 20965
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20965 after 1.29082e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.29082e+09 after 7.73077e+10
Detected timeout of ITS tools.
[2022-06-10 05:42:50] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:42:50] [INFO ] Applying decomposition
[2022-06-10 05:42:50] [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/graph9405437278606147429.txt' '-o' '/tmp/graph9405437278606147429.bin' '-w' '/tmp/graph9405437278606147429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9405437278606147429.bin' '-l' '-1' '-v' '-w' '/tmp/graph9405437278606147429.weights' '-q' '0' '-e' '0.001'
[2022-06-10 05:42:51] [INFO ] Decomposing Gal with order
[2022-06-10 05:42:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 05:42:51] [INFO ] Removed a total of 66 redundant transitions.
[2022-06-10 05:42:51] [INFO ] Flatten gal took : 35 ms
[2022-06-10 05:42:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2022-06-10 05:42:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18013876565716949421.gal : 2 ms
[2022-06-10 05:42:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15814124890977909060.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4522848884837918471;'/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/ReachabilityCardinality18013876565716949421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15814124890977909060.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15814124890977909060.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 126
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin549020130440295075
[2022-06-10 05:43:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin549020130440295075
Running compilation step : cd /tmp/ltsmin549020130440295075;'/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 574 ms.
Running link step : cd /tmp/ltsmin549020130440295075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin549020130440295075;'/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' 'AtomicPropp12==true'
LTSmin run took 315 ms.
Found Violation
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' '!(F(G(F(p0))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 346
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 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 134 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 124 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 124 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 114 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 114 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 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 102 place count 97 transition count 234
Applied a total of 102 rules in 56 ms. Remains 97 /146 variables (removed 49) and now considering 234/360 (removed 126) transitions.
[2022-06-10 05:43:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 05:43:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:07] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-10 05:43:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 05:43:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 05:43:07] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-06-10 05:43:07] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 05:43:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 05:43:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:07] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/146 places, 234/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/146 places, 234/360 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-01 finished in 628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!X(G((F(p1)&&p0))) U !(p2 U p3))))))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 340
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 340
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 134 transition count 324
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 130 transition count 310
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 130 transition count 310
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 126 transition count 302
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 122 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 122 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 118 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 118 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 114 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 114 transition count 278
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 111 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 111 transition count 272
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 111 transition count 268
Applied a total of 74 rules in 36 ms. Remains 111 /146 variables (removed 35) and now considering 268/360 (removed 92) transitions.
[2022-06-10 05:43:07] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-10 05:43:08] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 05:43:08] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2022-06-10 05:43:08] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 05:43:08] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:08] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/146 places, 268/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/146 places, 268/360 transitions.
Stuttering acceptance computed with spot in 344 ms :[p3, (AND p0 p1 p3), p3, (AND p0 p1 p3)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(OR p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={1} source=1 dest: 3}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={1, 2} source=1 dest: 3}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1, 2} source=2 dest: 2}, { cond=p3, acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND p3 p0 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s75 1)), p2:(AND (GEQ s0 1) (GEQ s35 1)), p0:(AND (GEQ s1 1) (GEQ s75 1)), p1:(AND (GEQ s4 1) (GEQ s102 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1267 reset in 411 ms.
Product exploration explored 100000 steps with 1267 reset in 322 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 p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0 p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 834 ms. Reduced automaton from 4 states, 16 edges and 4 AP to 4 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 198 ms :[p3, (AND p0 p1 p3), p3, (AND p0 p1 p3)]
Incomplete random walk after 10017 steps, including 8 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 05:43:10] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 05:43:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 05:43:10] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0 p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1))))), (G (NOT (AND p1 p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (G (NOT (AND p1 p0 p3))), (G (NOT (AND (NOT p1) p0 (NOT p3)))), (G (NOT (AND p1 p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 p3)), (F p3), (F (OR p2 p3)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 22 factoid took 1529 ms. Reduced automaton from 4 states, 16 edges and 4 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[p3, p3]
Stuttering acceptance computed with spot in 75 ms :[p3, p3]
Support contains 4 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 268/268 transitions.
Applied a total of 0 rules in 16 ms. Remains 111 /111 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2022-06-10 05:43:12] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 05:43:12] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 05:43:12] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2022-06-10 05:43:12] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 05:43:12] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:43:13] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 268/268 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 : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (OR (AND (NOT p0) p2) p3))), (X (OR (NOT p0) p3)), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) p2) p3)))), (X (X (OR (NOT p0) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 318 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[p3, p3]
Incomplete random walk after 10016 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 05:43:13] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 111 cols
[2022-06-10 05:43:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:43:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (OR (AND (NOT p0) p2) p3))), (X (OR (NOT p0) p3)), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) p2) p3)))), (X (X (OR (NOT p0) p3))), (G (OR (NOT p0) p3))]
False Knowledge obtained : [(F p3), (F (AND p2 (NOT p0) (NOT p3))), (F (OR (AND p2 (NOT p0)) p3))]
Knowledge based reduction with 10 factoid took 357 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[p3, p3]
Stuttering acceptance computed with spot in 62 ms :[p3, p3]
Stuttering acceptance computed with spot in 86 ms :[p3, p3]
Product exploration explored 100000 steps with 1278 reset in 262 ms.
Product exploration explored 100000 steps with 1271 reset in 255 ms.
Built C files in :
/tmp/ltsmin9334529291604329647
[2022-06-10 05:43:14] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2022-06-10 05:43:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:14] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2022-06-10 05:43:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:14] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2022-06-10 05:43:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:14] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9334529291604329647
Running compilation step : cd /tmp/ltsmin9334529291604329647;'/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 523 ms.
Running link step : cd /tmp/ltsmin9334529291604329647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9334529291604329647;'/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/stateBased2227045854404427421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 268/268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 108 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 101 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 100 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 99 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 99 transition count 240
Applied a total of 24 rules in 39 ms. Remains 99 /111 variables (removed 12) and now considering 240/268 (removed 28) transitions.
[2022-06-10 05:43:29] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2022-06-10 05:43:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-10 05:43:29] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2022-06-10 05:43:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 05:43:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-10 05:43:30] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:43:30] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2022-06-10 05:43:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:43:30] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/111 places, 240/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/111 places, 240/268 transitions.
Built C files in :
/tmp/ltsmin12326070024222295888
[2022-06-10 05:43:30] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-06-10 05:43:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:30] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-06-10 05:43:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:30] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-06-10 05:43:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:43:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12326070024222295888
Running compilation step : cd /tmp/ltsmin12326070024222295888;'/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 431 ms.
Running link step : cd /tmp/ltsmin12326070024222295888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12326070024222295888;'/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/stateBased5696433270769160529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 05:43:45] [INFO ] Flatten gal took : 14 ms
[2022-06-10 05:43:45] [INFO ] Flatten gal took : 14 ms
[2022-06-10 05:43:45] [INFO ] Time to serialize gal into /tmp/LTL15391783439002342084.gal : 2 ms
[2022-06-10 05:43:45] [INFO ] Time to serialize properties into /tmp/LTL16466243088646084038.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/LTL15391783439002342084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16466243088646084038.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/LTL1539178...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G((!(X(G(((F("((s4>=1)&&(l260>=1))"))&&("(s1>=1)"))&&("(l123>=1)")))))U(!(("((s0>=1)&&(l53>=1))")U("((s1>=1)&&(l123>=1))"))))))...157
Formula 0 simplified : !GFG(!XG("(l123>=1)" & "(s1>=1)" & F"((s4>=1)&&(l260>=1))") U !("((s0>=1)&&(l53>=1))" U "((s1>=1)&&(l123>=1))"))
Detected timeout of ITS tools.
[2022-06-10 05:44:00] [INFO ] Flatten gal took : 15 ms
[2022-06-10 05:44:00] [INFO ] Applying decomposition
[2022-06-10 05:44:00] [INFO ] Flatten gal took : 12 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/graph17878888099973568850.txt' '-o' '/tmp/graph17878888099973568850.bin' '-w' '/tmp/graph17878888099973568850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17878888099973568850.bin' '-l' '-1' '-v' '-w' '/tmp/graph17878888099973568850.weights' '-q' '0' '-e' '0.001'
[2022-06-10 05:44:00] [INFO ] Decomposing Gal with order
[2022-06-10 05:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 05:44:00] [INFO ] Removed a total of 444 redundant transitions.
[2022-06-10 05:44:00] [INFO ] Flatten gal took : 26 ms
[2022-06-10 05:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 9 ms.
[2022-06-10 05:44:00] [INFO ] Time to serialize gal into /tmp/LTL14397460630948748128.gal : 3 ms
[2022-06-10 05:44:00] [INFO ] Time to serialize properties into /tmp/LTL3717834725085020955.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/LTL14397460630948748128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3717834725085020955.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/LTL1439746...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G((!(X(G(((F("((i8.u0.s4>=1)&&(i10.u30.l260>=1))"))&&("(i4.u1.s1>=1)"))&&("(i8.u19.l123>=1)")))))U(!(("((i8.u0.s0>=1)&&(i3.u12....210
Formula 0 simplified : !GFG(!XG("(i4.u1.s1>=1)" & "(i8.u19.l123>=1)" & F"((i8.u0.s4>=1)&&(i10.u30.l260>=1))") U !("((i8.u0.s0>=1)&&(i3.u12.l53>=1))" U "((i...188
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2380653011044410000
[2022-06-10 05:44:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2380653011044410000
Running compilation step : cd /tmp/ltsmin2380653011044410000;'/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 384 ms.
Running link step : cd /tmp/ltsmin2380653011044410000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2380653011044410000;'/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' '[](<>([]((!X([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))) U !((LTLAPp2==true) U (LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b032-LTLFireability-03 finished in 82904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 141 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 141 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 141 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 136 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 108 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 105 transition count 256
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 105 transition count 254
Applied a total of 86 rules in 34 ms. Remains 105 /146 variables (removed 41) and now considering 254/360 (removed 106) transitions.
[2022-06-10 05:44:30] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 105 cols
[2022-06-10 05:44:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:44:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-06-10 05:44:30] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 105 cols
[2022-06-10 05:44:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 05:44:31] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-06-10 05:44:31] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 105 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/146 places, 254/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/146 places, 254/360 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s81 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-04 finished in 427 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 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 141 transition count 350
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 141 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 141 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 136 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 128 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 128 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 124 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 124 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 120 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 120 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 106 transition count 260
Applied a total of 82 rules in 17 ms. Remains 106 /146 variables (removed 40) and now considering 260/360 (removed 100) transitions.
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 05:44:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 05:44:31] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/146 places, 260/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/146 places, 260/360 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-06 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 s0 1) (GEQ s94 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-b032-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-06 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))&&p1&&(G(!p0)||p2)))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 346
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 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 134 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 125 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 125 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 121 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 121 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 117 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 117 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 113 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 113 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 109 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 109 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 106 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 106 transition count 260
Applied a total of 82 rules in 19 ms. Remains 106 /146 variables (removed 40) and now considering 260/360 (removed 100) transitions.
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 05:44:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-10 05:44:31] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2022-06-10 05:44:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:44:32] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/146 places, 260/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/146 places, 260/360 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (OR (NOT p1) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s103 1)), p2:(OR (LT s3 1) (LT s25 1)), p1:(OR (LT s1 1) (LT s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1173 reset in 262 ms.
Product exploration explored 100000 steps with 1211 reset in 304 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 p0 p2 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (NOT p1)))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 394 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8735 steps, including 4 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1091 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (NOT p1)))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 648 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 260/260 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 256
Applied a total of 4 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 256/260 (removed 4) transitions.
[2022-06-10 05:44:34] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 05:44:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:44:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 05:44:34] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 05:44:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 05:44:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2022-06-10 05:44:34] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:44:34] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 05:44:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:34] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/106 places, 256/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 256/260 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8226 steps, including 12 resets, run visited all 1 properties in 11 ms. (steps per millisecond=747 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1193 reset in 268 ms.
Stack based approach found an accepted trace after 39822 steps with 478 reset with depth 42 and stack size 42 in 101 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-11 finished in 3704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 346
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 140 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 135 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 135 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 131 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 131 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 127 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 123 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 123 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 119 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 111 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 111 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 107 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 104 transition count 254
Applied a total of 86 rules in 11 ms. Remains 104 /146 variables (removed 42) and now considering 254/360 (removed 106) transitions.
[2022-06-10 05:44:35] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 05:44:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:44:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 05:44:35] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 05:44:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 05:44:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-10 05:44:35] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 05:44:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:44:35] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/146 places, 254/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/146 places, 254/360 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s83 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][false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-13 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((X(p1) U p2)))&&p0)))'
Support contains 3 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 360/360 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 142 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 138 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 135 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 135 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 132 transition count 318
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 132 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 123 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 120 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 120 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 118 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 117 transition count 284
Iterating global reduction 1 with 1 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
Applied a total of 64 rules in 16 ms. Remains 115 /146 variables (removed 31) and now considering 280/360 (removed 80) transitions.
[2022-06-10 05:44:35] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2022-06-10 05:44:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-06-10 05:44:35] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2022-06-10 05:44:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 05:44:36] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-10 05:44:36] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2022-06-10 05:44:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:44:36] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/146 places, 280/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/146 places, 280/360 transitions.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s94 1) (GEQ s96 1)), p2:(AND (GEQ s0 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-14 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!X(G((F(p1)&&p0))) U !(p2 U p3))))))'
[2022-06-10 05:44:36] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin194719602674617393
[2022-06-10 05:44:36] [INFO ] Computing symmetric may disable matrix : 360 transitions.
[2022-06-10 05:44:36] [INFO ] Applying decomposition
[2022-06-10 05:44:36] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:44:36] [INFO ] Computing symmetric may enable matrix : 360 transitions.
[2022-06-10 05:44:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 05:44:36] [INFO ] Flatten gal took : 15 ms
[2022-06-10 05:44:36] [INFO ] Computing Do-Not-Accords matrix : 360 transitions.
[2022-06-10 05:44:36] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13909062626924636164.txt' '-o' '/tmp/graph13909062626924636164.bin' '-w' '/tmp/graph13909062626924636164.weights'
[2022-06-10 05:44:36] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin194719602674617393
Running compilation step : cd /tmp/ltsmin194719602674617393;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13909062626924636164.bin' '-l' '-1' '-v' '-w' '/tmp/graph13909062626924636164.weights' '-q' '0' '-e' '0.001'
[2022-06-10 05:44:36] [INFO ] Decomposing Gal with order
[2022-06-10 05:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 05:44:36] [INFO ] Removed a total of 604 redundant transitions.
[2022-06-10 05:44:36] [INFO ] Flatten gal took : 30 ms
[2022-06-10 05:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 14 ms.
[2022-06-10 05:44:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12816085607479957937.gal : 3 ms
[2022-06-10 05:44:36] [INFO ] Time to serialize properties into /tmp/LTLFireability11602165175846025281.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/LTLFireability12816085607479957937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11602165175846025281.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...269
Read 1 LTL properties
Checking formula 0 : !((G(F(G((!(X(G(((F("((i0.u0.s4>=1)&&(i11.u41.l260>=1))"))&&("(i1.u1.s1>=1)"))&&("(i0.u18.l123>=1)")))))U(!(("((i0.u0.s0>=1)&&(i2.u9.l...209
Formula 0 simplified : !GFG(!XG("(i0.u18.l123>=1)" & "(i1.u1.s1>=1)" & F"((i0.u0.s4>=1)&&(i11.u41.l260>=1))") U !("((i0.u0.s0>=1)&&(i2.u9.l53>=1))" U "((i1...187
Compilation finished in 734 ms.
Running link step : cd /tmp/ltsmin194719602674617393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin194719602674617393;'/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' '[](<>([]((!X([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))) U !((LTLAPp2==true) U (LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 1463 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 131504 ms.

BK_STOP 1654839879166

--------------------
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-b032"
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-b032, 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-165472282300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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