Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 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-b016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679550260982

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 05:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 05:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:44:22] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-23 05:44:22] [INFO ] Transformed 306 places.
[2023-03-23 05:44:22] [INFO ] Transformed 840 transitions.
[2023-03-23 05:44:22] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 534
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 534
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 187 transition count 476
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 176 transition count 454
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 176 transition count 454
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 176 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 171 transition count 428
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 171 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 168 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 168 transition count 416
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 165 transition count 410
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 165 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 163 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 163 transition count 402
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 161 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 161 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 159 transition count 390
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 159 transition count 390
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 155 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 155 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 153 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 153 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 151 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 151 transition count 374
Applied a total of 206 rules in 90 ms. Remains 151 /222 variables (removed 71) and now considering 374/648 (removed 274) transitions.
[2023-03-23 05:44:22] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
// Phase 1: matrix 254 rows 151 cols
[2023-03-23 05:44:22] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 05:44:23] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-23 05:44:23] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-23 05:44:23] [INFO ] Invariant cache hit.
[2023-03-23 05:44:23] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-23 05:44:23] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2023-03-23 05:44:23] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-23 05:44:23] [INFO ] Invariant cache hit.
[2023-03-23 05:44:23] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/222 places, 374/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1212 ms. Remains : 151/222 places, 374/648 transitions.
Support contains 21 out of 151 places after structural reductions.
[2023-03-23 05:44:24] [INFO ] Flatten gal took : 53 ms
[2023-03-23 05:44:24] [INFO ] Flatten gal took : 24 ms
[2023-03-23 05:44:24] [INFO ] Input system was already deterministic with 374 transitions.
Support contains 20 out of 151 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 6 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:44:24] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-23 05:44:24] [INFO ] Invariant cache hit.
[2023-03-23 05:44:24] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-23 05:44:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 05:44:24] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 05:44:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-23 05:44:24] [INFO ] After 29ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:24] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-23 05:44:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 30 ms returned sat
[2023-03-23 05:44:25] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:25] [INFO ] After 48ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:25] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-23 05:44:25] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 145 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 145 transition count 362
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 145 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 140 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 140 transition count 350
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 138 transition count 342
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 138 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 136 transition count 338
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 136 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 134 transition count 330
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 134 transition count 330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 132 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 126 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 126 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 124 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 124 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 122 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 122 transition count 302
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 122 transition count 294
Applied a total of 68 rules in 111 ms. Remains 122 /151 variables (removed 29) and now considering 294/374 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 122/151 places, 294/374 transitions.
Finished random walk after 9148 steps, including 11 resets, run visited all 3 properties in 79 ms. (steps per millisecond=115 )
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 142 transition count 350
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 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 20 place count 142 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 134 transition count 330
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 109 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 105 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 101 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 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 112 place count 97 transition count 234
Applied a total of 112 rules in 92 ms. Remains 97 /151 variables (removed 54) and now considering 234/374 (removed 140) transitions.
[2023-03-23 05:44:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 05:44:26] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 05:44:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-23 05:44:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 05:44:26] [INFO ] Invariant cache hit.
[2023-03-23 05:44:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 05:44:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-23 05:44:26] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 05:44:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 05:44:26] [INFO ] Invariant cache hit.
[2023-03-23 05:44:26] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/151 places, 234/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 97/151 places, 234/374 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 6 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-03 finished in 638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 63 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-23 05:44:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-23 05:44:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:44:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 05:44:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:27] [INFO ] Invariant cache hit.
[2023-03-23 05:44:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:44:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-23 05:44:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-23 05:44:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:27] [INFO ] Invariant cache hit.
[2023-03-23 05:44:27] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s87 1)), p0:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 565 reset in 325 ms.
Product exploration explored 100000 steps with 609 reset in 300 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10012 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Finished Best-First random walk after 3270 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=163 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-23 05:44:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:28] [INFO ] Invariant cache hit.
[2023-03-23 05:44:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-23 05:44:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:28] [INFO ] Invariant cache hit.
[2023-03-23 05:44:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:44:28] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-23 05:44:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 05:44:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:28] [INFO ] Invariant cache hit.
[2023-03-23 05:44:29] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 106/106 places, 254/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 05:44:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:29] [INFO ] Invariant cache hit.
[2023-03-23 05:44:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 05:44:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 05:44:29] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:44:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:44:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:44:29] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:44:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:44:29] [INFO ] After 13ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:44:29] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-23 05:44:29] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 106/106 places, 254/254 transitions.
Incomplete random walk after 10008 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished Best-First random walk after 6510 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1302 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 584 reset in 272 ms.
Product exploration explored 100000 steps with 544 reset in 279 ms.
Built C files in :
/tmp/ltsmin4327745528926767131
[2023-03-23 05:44:30] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2023-03-23 05:44:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:30] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2023-03-23 05:44:30] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:30] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2023-03-23 05:44:30] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:30] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4327745528926767131
Running compilation step : cd /tmp/ltsmin4327745528926767131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin4327745528926767131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4327745528926767131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2234393838542505157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-23 05:44:45] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:45] [INFO ] Invariant cache hit.
[2023-03-23 05:44:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-23 05:44:46] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:46] [INFO ] Invariant cache hit.
[2023-03-23 05:44:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:44:46] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-23 05:44:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 05:44:46] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:44:46] [INFO ] Invariant cache hit.
[2023-03-23 05:44:46] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 106/106 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin8120009899733290218
[2023-03-23 05:44:46] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2023-03-23 05:44:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:46] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2023-03-23 05:44:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:46] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2023-03-23 05:44:46] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8120009899733290218
Running compilation step : cd /tmp/ltsmin8120009899733290218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 472 ms.
Running link step : cd /tmp/ltsmin8120009899733290218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8120009899733290218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13079603551625359636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 05:45:01] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:45:01] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:45:01] [INFO ] Time to serialize gal into /tmp/LTL2825006224350667947.gal : 3 ms
[2023-03-23 05:45:01] [INFO ] Time to serialize properties into /tmp/LTL14050713135530670079.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2825006224350667947.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5359367257846209379.hoa' '-atoms' '/tmp/LTL14050713135530670079.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14050713135530670079.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5359367257846209379.hoa
Detected timeout of ITS tools.
[2023-03-23 05:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-23 05:45:16] [INFO ] Flatten gal took : 11 ms
[2023-03-23 05:45:16] [INFO ] Time to serialize gal into /tmp/LTL13282533764394614381.gal : 2 ms
[2023-03-23 05:45:16] [INFO ] Time to serialize properties into /tmp/LTL10812600813047145100.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13282533764394614381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10812600813047145100.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l183<1))"))||("((s1>=1)&&(l40>=1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l183<1))" & FG!"((s1>=1)&&(l40>=1))")
Detected timeout of ITS tools.
[2023-03-23 05:45:31] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:45:31] [INFO ] Applying decomposition
[2023-03-23 05:45:31] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9446601363397592438.txt' '-o' '/tmp/graph9446601363397592438.bin' '-w' '/tmp/graph9446601363397592438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9446601363397592438.bin' '-l' '-1' '-v' '-w' '/tmp/graph9446601363397592438.weights' '-q' '0' '-e' '0.001'
[2023-03-23 05:45:31] [INFO ] Decomposing Gal with order
[2023-03-23 05:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 05:45:31] [INFO ] Removed a total of 420 redundant transitions.
[2023-03-23 05:45:31] [INFO ] Flatten gal took : 46 ms
[2023-03-23 05:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 15 ms.
[2023-03-23 05:45:31] [INFO ] Time to serialize gal into /tmp/LTL9383000283863584336.gal : 4 ms
[2023-03-23 05:45:31] [INFO ] Time to serialize properties into /tmp/LTL15614245940627752034.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9383000283863584336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15614245940627752034.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i8.u0.s0<1)||(i10.i2.u27.l183<1))"))||("((i3.u1.s1>=1)&&(i1.u5.l40>=1))")))))
Formula 0 simplified : G(F!"((i8.u0.s0<1)||(i10.i2.u27.l183<1))" & FG!"((i3.u1.s1>=1)&&(i1.u5.l40>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3515110155849647333
[2023-03-23 05:45:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3515110155849647333
Running compilation step : cd /tmp/ltsmin3515110155849647333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin3515110155849647333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3515110155849647333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b016-LTLFireability-06 finished in 95080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 32 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:46:02] [INFO ] Invariant cache hit.
[2023-03-23 05:46:02] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:46:02] [INFO ] Invariant cache hit.
[2023-03-23 05:46:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:46:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-23 05:46:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 05:46:02] [INFO ] Invariant cache hit.
[2023-03-23 05:46:02] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s87 1) (OR (LT s0 1) (LT s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-07 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0||X(F(p1))))&&G(p2)))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 322
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 288
Applied a total of 70 rules in 16 ms. Remains 117 /151 variables (removed 34) and now considering 288/374 (removed 86) transitions.
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
// Phase 1: matrix 196 rows 117 cols
[2023-03-23 05:46:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:46:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-23 05:46:02] [INFO ] Invariant cache hit.
[2023-03-23 05:46:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 05:46:02] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-23 05:46:02] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-23 05:46:02] [INFO ] Invariant cache hit.
[2023-03-23 05:46:03] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 288/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 117/151 places, 288/374 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p2:(AND (GEQ s0 1) (GEQ s100 1)), p0:(AND (GEQ s5 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-08 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)&&(G(p2)||p1)))&&X(p3))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 145 transition count 358
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 145 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 140 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 140 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 137 transition count 334
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 137 transition count 334
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 134 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 132 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 126 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 124 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 122 transition count 298
Applied a total of 60 rules in 15 ms. Remains 122 /151 variables (removed 29) and now considering 298/374 (removed 76) transitions.
[2023-03-23 05:46:03] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
// Phase 1: matrix 202 rows 122 cols
[2023-03-23 05:46:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 05:46:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-23 05:46:03] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-23 05:46:03] [INFO ] Invariant cache hit.
[2023-03-23 05:46:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 05:46:03] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-23 05:46:03] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-23 05:46:03] [INFO ] Invariant cache hit.
[2023-03-23 05:46:03] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/151 places, 298/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 122/151 places, 298/374 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 1}, { cond=p0, acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s95 1)), p1:(OR (LT s0 1) (LT s103 1)), p2:(OR (LT s0 1) (LT s103 1)), p3:(OR (LT s1 1) (LT s102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 918 reset in 332 ms.
Stack based approach found an accepted trace after 45151 steps with 498 reset with depth 335 and stack size 335 in 174 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-09 finished in 1203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 354
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 286
Applied a total of 70 rules in 16 ms. Remains 117 /151 variables (removed 34) and now considering 286/374 (removed 88) transitions.
[2023-03-23 05:46:04] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2023-03-23 05:46:04] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:46:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-23 05:46:04] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-23 05:46:04] [INFO ] Invariant cache hit.
[2023-03-23 05:46:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 05:46:04] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-23 05:46:04] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-23 05:46:04] [INFO ] Invariant cache hit.
[2023-03-23 05:46:05] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 286/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 117/151 places, 286/374 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s4 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-10 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 128 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 124 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 124 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 106 transition count 260
Applied a total of 92 rules in 21 ms. Remains 106 /151 variables (removed 45) and now considering 260/374 (removed 114) transitions.
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2023-03-23 05:46:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:46:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-23 05:46:05] [INFO ] Invariant cache hit.
[2023-03-23 05:46:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:46:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-23 05:46:05] [INFO ] Invariant cache hit.
[2023-03-23 05:46:05] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/151 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 106/151 places, 260/374 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s94 1)), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-11 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 135 transition count 334
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 135 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 130 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 125 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 115 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 110 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 106 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 106 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 102 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 100 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 99 transition count 242
Applied a total of 104 rules in 22 ms. Remains 99 /151 variables (removed 52) and now considering 242/374 (removed 132) transitions.
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2023-03-23 05:46:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:46:05] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-23 05:46:05] [INFO ] Invariant cache hit.
[2023-03-23 05:46:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-23 05:46:05] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-23 05:46:05] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-23 05:46:05] [INFO ] Invariant cache hit.
[2023-03-23 05:46:06] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/151 places, 242/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 99/151 places, 242/374 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s73 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]]
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Product exploration explored 100000 steps with 50000 reset in 184 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b016-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLFireability-15 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-23 05:46:06] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4668112635556634174
[2023-03-23 05:46:06] [INFO ] Computing symmetric may disable matrix : 374 transitions.
[2023-03-23 05:46:06] [INFO ] Applying decomposition
[2023-03-23 05:46:06] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:46:06] [INFO ] Computing symmetric may enable matrix : 374 transitions.
[2023-03-23 05:46:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:46:06] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:46:06] [INFO ] Computing Do-Not-Accords matrix : 374 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14448983641448349963.txt' '-o' '/tmp/graph14448983641448349963.bin' '-w' '/tmp/graph14448983641448349963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14448983641448349963.bin' '-l' '-1' '-v' '-w' '/tmp/graph14448983641448349963.weights' '-q' '0' '-e' '0.001'
[2023-03-23 05:46:06] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:46:06] [INFO ] Decomposing Gal with order
[2023-03-23 05:46:06] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4668112635556634174
[2023-03-23 05:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin4668112635556634174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 05:46:06] [INFO ] Removed a total of 633 redundant transitions.
[2023-03-23 05:46:06] [INFO ] Flatten gal took : 29 ms
[2023-03-23 05:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 11 ms.
[2023-03-23 05:46:07] [INFO ] Time to serialize gal into /tmp/LTLFireability5238840180072994077.gal : 4 ms
[2023-03-23 05:46:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3016492590041508098.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5238840180072994077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3016492590041508098.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i2.u1.s1>=1)&&(i1.u4.l40>=1))")||(G("((i10.i0.u0.s0<1)||(i11.i0.u39.l183<1))"))))))
Formula 0 simplified : G(F!"((i10.i0.u0.s0<1)||(i11.i0.u39.l183<1))" & FG!"((i2.u1.s1>=1)&&(i1.u4.l40>=1))")
Compilation finished in 734 ms.
Running link step : cd /tmp/ltsmin4668112635556634174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4668112635556634174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: Initializing POR dependencies: labels 376, guards 374
pins2lts-mc-linux64( 5/ 8), 0.054: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.054: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.922: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.922: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.922: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.163: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 1.173: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.210: There are 377 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.210: State length is 152, there are 380 groups
pins2lts-mc-linux64( 0/ 8), 1.210: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.210: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.210: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.210: Visible groups: 0 / 380, labels: 2 / 377
pins2lts-mc-linux64( 0/ 8), 1.210: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.210: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.430: [Blue] ~120 levels ~960 states ~3640 transitions
pins2lts-mc-linux64( 0/ 8), 1.520: [Blue] ~184 levels ~1920 states ~6768 transitions
pins2lts-mc-linux64( 0/ 8), 1.673: [Blue] ~314 levels ~3840 states ~12536 transitions
pins2lts-mc-linux64( 0/ 8), 2.387: [Blue] ~572 levels ~7680 states ~24184 transitions
pins2lts-mc-linux64( 0/ 8), 2.981: [Blue] ~1092 levels ~15360 states ~47448 transitions
pins2lts-mc-linux64( 0/ 8), 3.710: [Blue] ~2132 levels ~30720 states ~94120 transitions
pins2lts-mc-linux64( 0/ 8), 4.930: [Blue] ~4208 levels ~61440 states ~187256 transitions
pins2lts-mc-linux64( 0/ 8), 7.076: [Blue] ~8363 levels ~122880 states ~373560 transitions
pins2lts-mc-linux64( 0/ 8), 18.981: [Blue] ~16672 levels ~245760 states ~746200 transitions
pins2lts-mc-linux64( 0/ 8), 38.664: [Blue] ~33292 levels ~491520 states ~1491592 transitions
pins2lts-mc-linux64( 0/ 8), 58.526: [Blue] ~66530 levels ~983040 states ~2982232 transitions
pins2lts-mc-linux64( 0/ 8), 91.467: [Blue] ~133006 levels ~1966080 states ~5963608 transitions
pins2lts-mc-linux64( 0/ 8), 155.405: [Blue] ~265958 levels ~3932160 states ~11926264 transitions
pins2lts-mc-linux64( 0/ 8), 290.602: [Blue] ~531862 levels ~7864320 states ~23851704 transitions
pins2lts-mc-linux64( 5/ 8), 474.596: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 474.717:
pins2lts-mc-linux64( 0/ 8), 474.717: Explored 8333688 states 37479241 transitions, fanout: 4.497
pins2lts-mc-linux64( 0/ 8), 474.717: Total exploration time 473.490 sec (473.370 sec minimum, 473.424 sec on average)
pins2lts-mc-linux64( 0/ 8), 474.717: States per second: 17601, Transitions per second: 79155
pins2lts-mc-linux64( 0/ 8), 474.717:
pins2lts-mc-linux64( 0/ 8), 474.717: State space has 35127037 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 474.717: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 474.717: blue states: 8333688 (23.72%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 474.717: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 474.717: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 474.717:
pins2lts-mc-linux64( 0/ 8), 474.717: Total memory used for local state coloring: 115.1MB
pins2lts-mc-linux64( 0/ 8), 474.717:
pins2lts-mc-linux64( 0/ 8), 474.717: Queue width: 8B, total height: 7544775, memory: 57.56MB
pins2lts-mc-linux64( 0/ 8), 474.717: Tree memory: 524.0MB, 15.6 B/state, compr.: 2.6%
pins2lts-mc-linux64( 0/ 8), 474.717: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 474.717: Stored 376 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 474.717: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 474.717: Est. total memory use: 581.6MB (~1081.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4668112635556634174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4668112635556634174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 06:06:41] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:06:41] [INFO ] Time to serialize gal into /tmp/LTLFireability5128207551617739816.gal : 2 ms
[2023-03-23 06:06:41] [INFO ] Time to serialize properties into /tmp/LTLFireability14651999260359702032.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5128207551617739816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14651999260359702032.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1>=1)&&(l40>=1))")||(G("((s0<1)||(l183<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l183<1))" & FG!"((s1>=1)&&(l40>=1))")
Detected timeout of ITS tools.
[2023-03-23 06:27:18] [INFO ] Flatten gal took : 337 ms
[2023-03-23 06:27:19] [INFO ] Input system was already deterministic with 374 transitions.
[2023-03-23 06:27:19] [INFO ] Transformed 151 places.
[2023-03-23 06:27:19] [INFO ] Transformed 374 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 06:27:19] [INFO ] Time to serialize gal into /tmp/LTLFireability1998709459379662601.gal : 8 ms
[2023-03-23 06:27:19] [INFO ] Time to serialize properties into /tmp/LTLFireability6080339235122832131.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1998709459379662601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6080339235122832131.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((s1>=1)&&(l40>=1))")||(G("((s0<1)||(l183<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l183<1))" & FG!"((s1>=1)&&(l40>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 159840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14882300 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-b016"
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-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b016, 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 r165-tall-167838850800684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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