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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:53 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-b032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679553879657

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 06:44:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 06:44:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:44:41] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-23 06:44:41] [INFO ] Transformed 306 places.
[2023-03-23 06:44:41] [INFO ] Transformed 840 transitions.
[2023-03-23 06:44:41] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 36 place count 186 transition count 488
Iterating global reduction 1 with 27 rules applied. Total rules applied 63 place count 186 transition count 488
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 91 place count 186 transition count 460
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 173 transition count 434
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 173 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 173 transition count 430
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 127 place count 167 transition count 418
Iterating global reduction 3 with 6 rules applied. Total rules applied 133 place count 167 transition count 418
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 163 transition count 402
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 163 transition count 402
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 159 transition count 394
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 159 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 157 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 156 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 156 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 155 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 155 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 154 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 154 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 153 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 153 transition count 376
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 152 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 152 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 151 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 151 transition count 372
Applied a total of 165 rules in 88 ms. Remains 151 /222 variables (removed 71) and now considering 372/648 (removed 276) transitions.
[2023-03-23 06:44:41] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
// Phase 1: matrix 256 rows 151 cols
[2023-03-23 06:44:41] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-23 06:44:41] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-23 06:44:41] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-23 06:44:41] [INFO ] Invariant cache hit.
[2023-03-23 06:44:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-23 06:44:42] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-23 06:44:42] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-23 06:44:42] [INFO ] Invariant cache hit.
[2023-03-23 06:44:42] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/222 places, 372/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 151/222 places, 372/648 transitions.
Support contains 14 out of 151 places after structural reductions.
[2023-03-23 06:44:42] [INFO ] Flatten gal took : 47 ms
[2023-03-23 06:44:42] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:44:42] [INFO ] Input system was already deterministic with 372 transitions.
Incomplete random walk after 10016 steps, including 7 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 06:44:42] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-23 06:44:42] [INFO ] Invariant cache hit.
[2023-03-23 06:44:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 06:44:42] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 06:44:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-23 06:44:43] [INFO ] After 27ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:44:43] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:44:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 06:44:43] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:44:43] [INFO ] After 24ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:44:43] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 06:44:43] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 605 edges and 151 vertex of which 126 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 126 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 119 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 119 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 119 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 113 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 113 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 108 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 108 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 103 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 103 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 98 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 98 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 94 transition count 238
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 94 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 91 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 91 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 88 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 88 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 87 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 87 transition count 224
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 87 transition count 218
Applied a total of 135 rules in 68 ms. Remains 87 /151 variables (removed 64) and now considering 218/372 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 87/151 places, 218/372 transitions.
Finished random walk after 3913 steps, including 1 resets, run visited all 2 properties in 36 ms. (steps per millisecond=108 )
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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' '!((p0 U X((p1||G(((p2&&X(p3)) U X(p4)))))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 360
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 147 transition count 358
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 144 transition count 350
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 144 transition count 350
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 141 transition count 340
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 141 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 138 transition count 332
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 138 transition count 332
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 326
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 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 127 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 127 transition count 310
Applied a total of 50 rules in 60 ms. Remains 127 /151 variables (removed 24) and now considering 310/372 (removed 62) transitions.
[2023-03-23 06:44:43] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-23 06:44:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 06:44:43] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-23 06:44:43] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:43] [INFO ] Invariant cache hit.
[2023-03-23 06:44:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 06:44:43] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-23 06:44:43] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:43] [INFO ] Invariant cache hit.
[2023-03-23 06:44:43] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/151 places, 310/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 127/151 places, 310/372 transitions.
Stuttering acceptance computed with spot in 648 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 10}], [{ cond=(NOT p4), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p4)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p4)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p4)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p4)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p4) p3), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p4)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p4)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(GT 2 s54), p1:(LEQ 1 s111), p2:(LEQ s93 0), p4:(LEQ s99 s118), p3:(LEQ 2 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25084 reset in 309 ms.
Product exploration explored 100000 steps with 25090 reset in 239 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 683 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/127 stabilizing places and 64/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p4 (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p4) p3)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4))))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1) p2))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 1698 ms. Reduced automaton from 11 states, 33 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 06:44:47] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:47] [INFO ] Invariant cache hit.
[2023-03-23 06:44:47] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 06:44:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 06:44:47] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 06:44:47] [INFO ] After 26ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:47] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 06:44:47] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 310/310 transitions.
Graph (complete) has 513 edges and 127 vertex of which 103 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 103 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 103 transition count 254
Applied a total of 57 rules in 16 ms. Remains 103 /127 variables (removed 24) and now considering 254/310 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/127 places, 254/310 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 506319 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 506319 steps, saw 315178 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 06:44:50] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
// Phase 1: matrix 162 rows 103 cols
[2023-03-23 06:44:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 06:44:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 06:44:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:51] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 06:44:51] [INFO ] After 28ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:51] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 06:44:51] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/103 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-23 06:44:51] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:44:51] [INFO ] Invariant cache hit.
[2023-03-23 06:44:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-23 06:44:51] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:44:51] [INFO ] Invariant cache hit.
[2023-03-23 06:44:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 06:44:51] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-23 06:44:51] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 06:44:51] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:44:51] [INFO ] Invariant cache hit.
[2023-03-23 06:44:51] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 103/103 places, 254/254 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 103 transition count 154
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 108 place count 95 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 108 place count 95 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 152 place count 73 transition count 132
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 58 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 188 place count 52 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 46 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 46 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 40 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 40 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 224 place count 40 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 36 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 36 transition count 76
Applied a total of 233 rules in 19 ms. Remains 36 /103 variables (removed 67) and now considering 76/254 (removed 178) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 76 rows 36 cols
[2023-03-23 06:44:51] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 06:44:51] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 06:44:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 06:44:51] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 06:44:51] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 06:44:51] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-23 06:44:51] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1) p2 p4 (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p4) p3)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4))))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1) p2))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p4)), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) p2 (NOT p4))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p4))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) p2 p0 (NOT p4))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0 (NOT p4))), (F (AND (NOT p1) p0 (NOT p4))), (F (NOT (AND (NOT p1) p2))), (F p1), (F (AND (NOT p1) (NOT p0) (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) p0 (NOT p4))), (F (AND p3 p2 (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)))]
Knowledge based reduction with 30 factoid took 2295 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-23 06:44:54] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-23 06:44:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:44:54] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-23 06:44:54] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:54] [INFO ] Invariant cache hit.
[2023-03-23 06:44:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 06:44:55] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-23 06:44:55] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:55] [INFO ] Invariant cache hit.
[2023-03-23 06:44:55] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 127/127 places, 310/310 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 683 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/127 stabilizing places and 64/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0 p4 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1062 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 06:44:56] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:44:56] [INFO ] Invariant cache hit.
[2023-03-23 06:44:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 06:44:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 06:44:56] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 06:44:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 06:44:57] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 06:44:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 06:44:57] [INFO ] After 71ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 06:44:57] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-23 06:44:57] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 54 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 310/310 transitions.
Graph (complete) has 513 edges and 127 vertex of which 103 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 103 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 103 transition count 254
Applied a total of 57 rules in 12 ms. Remains 103 /127 variables (removed 24) and now considering 254/310 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 103/127 places, 254/310 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 06:44:57] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
// Phase 1: matrix 162 rows 103 cols
[2023-03-23 06:44:57] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 06:44:57] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:44:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 06:44:57] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:44:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 06:44:57] [INFO ] After 14ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:44:57] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 06:44:57] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 678303 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678303 steps, saw 422228 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 06:45:00] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:45:00] [INFO ] Invariant cache hit.
[2023-03-23 06:45:00] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:45:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 06:45:00] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:45:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 06:45:00] [INFO ] After 13ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:45:00] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 06:45:00] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-23 06:45:01] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:45:01] [INFO ] Invariant cache hit.
[2023-03-23 06:45:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-23 06:45:01] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:45:01] [INFO ] Invariant cache hit.
[2023-03-23 06:45:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 06:45:01] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-23 06:45:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 06:45:01] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-23 06:45:01] [INFO ] Invariant cache hit.
[2023-03-23 06:45:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 103/103 places, 254/254 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 103 transition count 154
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 108 place count 95 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 108 place count 95 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 152 place count 73 transition count 132
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 58 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 188 place count 52 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 46 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 46 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 40 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 40 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 224 place count 40 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 36 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 36 transition count 76
Applied a total of 233 rules in 11 ms. Remains 36 /103 variables (removed 67) and now considering 76/254 (removed 178) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 76 rows 36 cols
[2023-03-23 06:45:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 06:45:01] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 06:45:01] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:45:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 06:45:01] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:45:01] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 06:45:01] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2 p0 p4 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p4)), (F (AND p3 (NOT p2) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (AND (NOT p1) p2 (NOT p4))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (AND (NOT p1) p2 p0 (NOT p4))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0 (NOT p4))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) p0 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0) (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))), (F (AND (NOT p1) (NOT p3) p0 (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)))]
Knowledge based reduction with 21 factoid took 1746 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 475 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Product exploration explored 100000 steps with 25100 reset in 190 ms.
Product exploration explored 100000 steps with 25047 reset in 195 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 127 transition count 304
Applied a total of 6 rules in 34 ms. Remains 127 /127 variables (removed 0) and now considering 304/310 (removed 6) transitions.
[2023-03-23 06:45:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 06:45:05] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
// Phase 1: matrix 209 rows 127 cols
[2023-03-23 06:45:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 06:45:05] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 304/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 127/127 places, 304/310 transitions.
Built C files in :
/tmp/ltsmin12189765604627267261
[2023-03-23 06:45:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12189765604627267261
Running compilation step : cd /tmp/ltsmin12189765604627267261;'/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 543 ms.
Running link step : cd /tmp/ltsmin12189765604627267261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12189765604627267261;'/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' '--hoa' '/tmp/stateBased3175075766565451032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-23 06:45:20] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-23 06:45:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:45:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-23 06:45:20] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:45:20] [INFO ] Invariant cache hit.
[2023-03-23 06:45:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 06:45:21] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-23 06:45:21] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-23 06:45:21] [INFO ] Invariant cache hit.
[2023-03-23 06:45:21] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 127/127 places, 310/310 transitions.
Built C files in :
/tmp/ltsmin16246079471145301201
[2023-03-23 06:45:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16246079471145301201
Running compilation step : cd /tmp/ltsmin16246079471145301201;'/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 415 ms.
Running link step : cd /tmp/ltsmin16246079471145301201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16246079471145301201;'/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' '--hoa' '/tmp/stateBased5668002861294478167.hoa' '--buchi-type=spotba'
LTSmin run took 525 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b032-LTLCardinality-03 finished in 38725 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(F((p0||X(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 145 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 356
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 141 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 141 transition count 346
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 138 transition count 336
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 138 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 132 transition count 320
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 129 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 126 transition count 304
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 123 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 121 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 120 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 118 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 118 transition count 288
Applied a total of 67 rules in 27 ms. Remains 118 /151 variables (removed 33) and now considering 288/372 (removed 84) transitions.
[2023-03-23 06:45:22] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
// Phase 1: matrix 197 rows 118 cols
[2023-03-23 06:45:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:45:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-23 06:45:22] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-23 06:45:22] [INFO ] Invariant cache hit.
[2023-03-23 06:45:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 06:45:22] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-23 06:45:22] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-23 06:45:22] [INFO ] Invariant cache hit.
[2023-03-23 06:45:22] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/151 places, 288/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 118/151 places, 288/372 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s95), p1:(LEQ s98 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 7441 steps, including 5 resets, run visited all 1 properties in 14 ms. (steps per millisecond=531 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-23 06:45:23] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-23 06:45:23] [INFO ] Invariant cache hit.
[2023-03-23 06:45:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 06:45:23] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-23 06:45:23] [INFO ] Invariant cache hit.
[2023-03-23 06:45:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 06:45:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-23 06:45:23] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-23 06:45:23] [INFO ] Invariant cache hit.
[2023-03-23 06:45:23] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 118/118 places, 288/288 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4389 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=487 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 136 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 282
Applied a total of 6 rules in 18 ms. Remains 118 /118 variables (removed 0) and now considering 282/288 (removed 6) transitions.
[2023-03-23 06:45:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 06:45:25] [INFO ] Flow matrix only has 194 transitions (discarded 88 similar events)
// Phase 1: matrix 194 rows 118 cols
[2023-03-23 06:45:25] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 06:45:25] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 282/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 118/118 places, 282/288 transitions.
Built C files in :
/tmp/ltsmin4316923980092485084
[2023-03-23 06:45:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4316923980092485084
Running compilation step : cd /tmp/ltsmin4316923980092485084;'/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 398 ms.
Running link step : cd /tmp/ltsmin4316923980092485084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4316923980092485084;'/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' '--hoa' '/tmp/stateBased17818586499499471423.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b032-LTLCardinality-06 finished in 3899 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(G(p0)))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 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 17 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 137 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 137 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 131 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 125 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 110 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 106 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 106 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 104 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 104 transition count 254
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 104 transition count 252
Applied a total of 97 rules in 56 ms. Remains 104 /151 variables (removed 47) and now considering 252/372 (removed 120) transitions.
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2023-03-23 06:45:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:45:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 06:45:26] [INFO ] Invariant cache hit.
[2023-03-23 06:45:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 06:45:26] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-23 06:45:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 06:45:26] [INFO ] Invariant cache hit.
[2023-03-23 06:45:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/151 places, 252/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 104/151 places, 252/372 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s83)], 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 40 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-07 finished in 390 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(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 144 transition count 354
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 138 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 138 transition count 338
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 132 transition count 318
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 126 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 120 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 61 place count 120 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 114 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 78 place count 109 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 83 place count 109 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 87 place count 105 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 91 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 94 place count 102 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 97 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 98 place count 101 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 100 place count 100 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 99 transition count 240
Applied a total of 105 rules in 32 ms. Remains 99 /151 variables (removed 52) and now considering 240/372 (removed 132) transitions.
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2023-03-23 06:45:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:45:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-23 06:45:26] [INFO ] Invariant cache hit.
[2023-03-23 06:45:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-23 06:45:26] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-23 06:45:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-23 06:45:26] [INFO ] Invariant cache hit.
[2023-03-23 06:45:26] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/151 places, 240/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 99/151 places, 240/372 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s91 s73)], 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 41 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-08 finished in 365 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)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 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 15 place count 144 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 139 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 139 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 134 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 124 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 106 transition count 260
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 106 transition count 256
Applied a total of 95 rules in 45 ms. Remains 106 /151 variables (removed 45) and now considering 256/372 (removed 116) transitions.
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-23 06:45:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 06:45:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-23 06:45:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-23 06:45:26] [INFO ] Invariant cache hit.
[2023-03-23 06:45:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 06:45:27] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-23 06:45:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 06:45:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-23 06:45:27] [INFO ] Invariant cache hit.
[2023-03-23 06:45:27] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 256/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 106/151 places, 256/372 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s100 s94)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-13 finished in 385 ms.
All properties solved by simple procedures.
Total runtime 46034 ms.

BK_STOP 1679553929798

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-b032"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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