Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625500368.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPUForwardProgress-PT-32b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625500368
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 160K May 18 16:42 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 GPUForwardProgress-PT-32b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555192135

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:53:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:53:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:53:13] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-24 12:53:13] [INFO ] Transformed 644 places.
[2024-05-24 12:53:13] [INFO ] Transformed 677 transitions.
[2024-05-24 12:53:13] [INFO ] Found NUPN structural information;
[2024-05-24 12:53:13] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 63 place count 581 transition count 615
Iterating global reduction 1 with 62 rules applied. Total rules applied 125 place count 581 transition count 615
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 153 place count 553 transition count 587
Iterating global reduction 1 with 28 rules applied. Total rules applied 181 place count 553 transition count 587
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 206 place count 553 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 552 transition count 561
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 552 transition count 561
Applied a total of 208 rules in 160 ms. Remains 552 /644 variables (removed 92) and now considering 561/677 (removed 116) transitions.
// Phase 1: matrix 561 rows 552 cols
[2024-05-24 12:53:14] [INFO ] Computed 33 invariants in 19 ms
[2024-05-24 12:53:14] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-24 12:53:14] [INFO ] Invariant cache hit.
[2024-05-24 12:53:15] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-24 12:53:15] [INFO ] Invariant cache hit.
[2024-05-24 12:53:15] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 552/644 places, 561/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1328 ms. Remains : 552/644 places, 561/677 transitions.
Support contains 28 out of 552 places after structural reductions.
[2024-05-24 12:53:15] [INFO ] Flatten gal took : 64 ms
[2024-05-24 12:53:15] [INFO ] Flatten gal took : 31 ms
[2024-05-24 12:53:15] [INFO ] Input system was already deterministic with 561 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2024-05-24 12:53:16] [INFO ] Invariant cache hit.
[2024-05-24 12:53:16] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-24 12:53:17] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 17 ms returned sat
[2024-05-24 12:53:17] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-24 12:53:18] [INFO ] After 861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 269 ms.
[2024-05-24 12:53:18] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 178 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 10 properties in 28 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Graph (complete) has 858 edges and 552 vertex of which 516 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 456 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 510 transition count 282
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 547 place count 241 transition count 275
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 549 place count 240 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 239 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 550 place count 239 transition count 207
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 684 place count 172 transition count 207
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 716 place count 140 transition count 175
Iterating global reduction 4 with 32 rules applied. Total rules applied 748 place count 140 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 140 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 749 place count 140 transition count 173
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 943 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 944 place count 43 transition count 76
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 975 place count 12 transition count 15
Iterating global reduction 6 with 31 rules applied. Total rules applied 1006 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1008 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1009 place count 10 transition count 13
Applied a total of 1009 rules in 56 ms. Remains 10 /552 variables (removed 542) and now considering 13/561 (removed 548) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 12:53:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:53:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 12:53:18] [INFO ] Invariant cache hit.
[2024-05-24 12:53:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 12:53:18] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:53:18] [INFO ] Invariant cache hit.
[2024-05-24 12:53:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/552 places, 13/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 10/552 places, 13/561 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1), p1:(EQ s5 0)], nbAcceptance=2, 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 141 steps with 12 reset in 6 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F((p1&&X((p1 U (p2||G(p1))))))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 537 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 537 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 537 transition count 540
Applied a total of 36 rules in 75 ms. Remains 537 /552 variables (removed 15) and now considering 540/561 (removed 21) transitions.
// Phase 1: matrix 540 rows 537 cols
[2024-05-24 12:53:19] [INFO ] Computed 33 invariants in 4 ms
[2024-05-24 12:53:19] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-24 12:53:19] [INFO ] Invariant cache hit.
[2024-05-24 12:53:19] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-24 12:53:19] [INFO ] Invariant cache hit.
[2024-05-24 12:53:19] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 540/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 537/552 places, 540/561 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s507 1) (NEQ s210 1)), p2:(NEQ s210 1), p0:(EQ s365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 6 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-01 finished in 986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1012 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 8 transition count 11
Applied a total of 1013 rules in 39 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:53:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:53:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:53:20] [INFO ] Invariant cache hit.
[2024-05-24 12:53:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 12:53:20] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:53:20] [INFO ] Invariant cache hit.
[2024-05-24 12:53:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 47 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-24 12:53:20] [INFO ] Computed 33 invariants in 3 ms
[2024-05-24 12:53:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-24 12:53:20] [INFO ] Invariant cache hit.
[2024-05-24 12:53:20] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-24 12:53:20] [INFO ] Invariant cache hit.
[2024-05-24 12:53:20] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s475 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1843 steps with 6 reset in 16 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 537 transition count 545
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 537 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 537 transition count 539
Applied a total of 37 rules in 41 ms. Remains 537 /552 variables (removed 15) and now considering 539/561 (removed 22) transitions.
// Phase 1: matrix 539 rows 537 cols
[2024-05-24 12:53:21] [INFO ] Computed 33 invariants in 3 ms
[2024-05-24 12:53:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-24 12:53:21] [INFO ] Invariant cache hit.
[2024-05-24 12:53:21] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-24 12:53:21] [INFO ] Invariant cache hit.
[2024-05-24 12:53:21] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 539/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 537/552 places, 539/561 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s377 1) (EQ s489 1) (EQ s524 1) (EQ s535 1)), p0:(EQ s377 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1322 reset in 247 ms.
Product exploration explored 100000 steps with 1311 reset in 236 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Graph (complete) has 836 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/537 stabilizing places and 100/539 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:53:22] [INFO ] Invariant cache hit.
[2024-05-24 12:53:23] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 22 ms returned sat
[2024-05-24 12:53:23] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:53:23] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2024-05-24 12:53:23] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:23] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-24 12:53:23] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
[2024-05-24 12:53:24] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-05 finished in 3401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 43 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 12:53:24] [INFO ] Computed 33 invariants in 6 ms
[2024-05-24 12:53:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-24 12:53:24] [INFO ] Invariant cache hit.
[2024-05-24 12:53:25] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-24 12:53:25] [INFO ] Invariant cache hit.
[2024-05-24 12:53:25] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s281 0) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 32605 steps with 118 reset in 64 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1012 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 8 transition count 11
Applied a total of 1013 rules in 32 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:53:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:53:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:53:25] [INFO ] Invariant cache hit.
[2024-05-24 12:53:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:53:25] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:53:25] [INFO ] Invariant cache hit.
[2024-05-24 12:53:25] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s4 0), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-07 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 38 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-24 12:53:25] [INFO ] Computed 33 invariants in 4 ms
[2024-05-24 12:53:25] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-24 12:53:25] [INFO ] Invariant cache hit.
[2024-05-24 12:53:26] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-24 12:53:26] [INFO ] Invariant cache hit.
[2024-05-24 12:53:26] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 145 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 : GPUForwardProgress-PT-32b-LTLFireability-09 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:(EQ s335 1), p1:(EQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-09 finished in 855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||F(p1)))&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 41 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 12:53:26] [INFO ] Computed 33 invariants in 4 ms
[2024-05-24 12:53:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-24 12:53:26] [INFO ] Invariant cache hit.
[2024-05-24 12:53:27] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-24 12:53:27] [INFO ] Invariant cache hit.
[2024-05-24 12:53:27] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), p0, p0, (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s196 1), p0:(EQ s431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1103 reset in 176 ms.
Product exploration explored 100000 steps with 1103 reset in 188 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 197 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=197 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2024-05-24 12:53:28] [INFO ] Invariant cache hit.
[2024-05-24 12:53:28] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 12:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:28] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-24 12:53:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:53:28] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 12:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:29] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-24 12:53:29] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 50 ms.
[2024-05-24 12:53:32] [INFO ] Added : 511 causal constraints over 103 iterations in 3683 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 538 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 438 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 256 transitions
Trivial Post-agglo rules discarded 256 transitions
Performed 256 trivial Post agglomeration. Transition count delta: 256
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 496 transition count 275
Reduce places removed 256 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 257 rules applied. Total rules applied 515 place count 240 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 516 place count 239 transition count 274
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 516 place count 239 transition count 208
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 648 place count 173 transition count 208
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 679 place count 142 transition count 177
Iterating global reduction 3 with 31 rules applied. Total rules applied 710 place count 142 transition count 177
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 906 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 907 place count 44 transition count 78
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 937 place count 14 transition count 19
Iterating global reduction 4 with 30 rules applied. Total rules applied 967 place count 14 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 971 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 972 place count 11 transition count 17
Applied a total of 972 rules in 30 ms. Remains 11 /538 variables (removed 527) and now considering 17/541 (removed 524) transitions.
[2024-05-24 12:53:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2024-05-24 12:53:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:53:32] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 12:53:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-24 12:53:32] [INFO ] Invariant cache hit.
[2024-05-24 12:53:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 12:53:32] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:53:32] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-24 12:53:32] [INFO ] Invariant cache hit.
[2024-05-24 12:53:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/538 places, 17/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 11/538 places, 17/541 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
[2024-05-24 12:53:33] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-24 12:53:33] [INFO ] Invariant cache hit.
[2024-05-24 12:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:53:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:33] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:53:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:53:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:53:33] [INFO ] Computed and/alt/rep : 10/26/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:53:33] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 6793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&X(F(!p1)))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 46 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 12:53:33] [INFO ] Computed 33 invariants in 5 ms
[2024-05-24 12:53:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-24 12:53:33] [INFO ] Invariant cache hit.
[2024-05-24 12:53:33] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-24 12:53:33] [INFO ] Invariant cache hit.
[2024-05-24 12:53:34] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s252 1) (EQ s525 1) (EQ s536 1)), p1:(OR (AND (EQ s252 1) (EQ s525 1) (EQ s536 1)) (NEQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 372 reset in 168 ms.
Product exploration explored 100000 steps with 370 reset in 277 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND p0 p1), (AND p1 p0), (AND p0 p1), false, false]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) 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 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:53:35] [INFO ] Invariant cache hit.
[2024-05-24 12:53:35] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2024-05-24 12:53:35] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-24 12:53:35] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-24 12:53:35] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 12:53:35] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-24 12:53:35] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 831 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 497 transition count 272
Reduce places removed 258 places and 0 transitions.
Iterating post reduction 1 with 258 rules applied. Total rules applied 519 place count 239 transition count 272
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 519 place count 239 transition count 207
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 649 place count 174 transition count 207
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 682 place count 141 transition count 174
Iterating global reduction 2 with 33 rules applied. Total rules applied 715 place count 141 transition count 174
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 911 place count 43 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 912 place count 43 transition count 75
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 941 place count 14 transition count 17
Iterating global reduction 3 with 29 rules applied. Total rules applied 970 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 972 place count 13 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 974 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 975 place count 11 transition count 15
Applied a total of 975 rules in 18 ms. Remains 11 /538 variables (removed 527) and now considering 15/541 (removed 526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 11/538 places, 15/541 transitions.
Finished random walk after 59 steps, including 6 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 199 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 200 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 496 transition count 274
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 1 with 257 rules applied. Total rules applied 516 place count 239 transition count 274
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 516 place count 239 transition count 209
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 646 place count 174 transition count 209
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 677 place count 143 transition count 178
Iterating global reduction 2 with 31 rules applied. Total rules applied 708 place count 143 transition count 178
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 904 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 905 place count 45 transition count 79
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 935 place count 15 transition count 20
Iterating global reduction 3 with 30 rules applied. Total rules applied 965 place count 15 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 969 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 970 place count 12 transition count 18
Applied a total of 970 rules in 21 ms. Remains 12 /538 variables (removed 526) and now considering 18/541 (removed 523) transitions.
[2024-05-24 12:53:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2024-05-24 12:53:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:53:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:53:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 12:53:36] [INFO ] Invariant cache hit.
[2024-05-24 12:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:53:36] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:53:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 12:53:36] [INFO ] Invariant cache hit.
[2024-05-24 12:53:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/538 places, 18/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 12/538 places, 18/541 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 827 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:53:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 12:53:36] [INFO ] Invariant cache hit.
[2024-05-24 12:53:36] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 239 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 365 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 181 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 12531 reset in 175 ms.
Product exploration explored 100000 steps with 12622 reset in 164 ms.
Built C files in :
/tmp/ltsmin5746582258941149478
[2024-05-24 12:53:38] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-24 12:53:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:53:38] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-24 12:53:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:53:38] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-24 12:53:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:53:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5746582258941149478
Running compilation step : cd /tmp/ltsmin5746582258941149478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin5746582258941149478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5746582258941149478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7146765704835182583.hoa' '--buchi-type=spotba'
LTSmin run took 1212 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 6340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(p1) U (p2||X(F((p2&&F(p3)))))))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 30 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 12:53:39] [INFO ] Computed 33 invariants in 8 ms
[2024-05-24 12:53:39] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-24 12:53:39] [INFO ] Invariant cache hit.
[2024-05-24 12:53:40] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-24 12:53:40] [INFO ] Invariant cache hit.
[2024-05-24 12:53:40] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s223 1), p0:(EQ s416 1), p3:(NEQ s470 1), p2:(EQ s316 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 850 reset in 144 ms.
Product exploration explored 100000 steps with 860 reset in 173 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/538 stabilizing places and 99/541 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 126 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 728 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 12:53:42] [INFO ] Invariant cache hit.
[2024-05-24 12:53:42] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2024-05-24 12:53:42] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 12:53:42] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-24 12:53:43] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 12:53:43] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-05-24 12:53:43] [INFO ] After 1012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 67 ms.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 435 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 831 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 497 transition count 275
Reduce places removed 254 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 514 place count 243 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 516 place count 241 transition count 273
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 516 place count 241 transition count 208
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 646 place count 176 transition count 208
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 679 place count 143 transition count 175
Iterating global reduction 3 with 33 rules applied. Total rules applied 712 place count 143 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 712 place count 143 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 714 place count 142 transition count 174
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 906 place count 46 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 124 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 908 place count 45 transition count 77
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 910 place count 45 transition count 75
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 938 place count 17 transition count 19
Iterating global reduction 5 with 28 rules applied. Total rules applied 966 place count 17 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 971 place count 14 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 21 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 974 place count 13 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 975 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 976 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 981 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 983 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 983 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 985 place count 8 transition count 8
Applied a total of 985 rules in 19 ms. Remains 8 /538 variables (removed 530) and now considering 8/541 (removed 533) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 8/538 places, 8/541 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :8
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND p0 (NOT p1) p2 p3)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 (NOT p2))), (F (AND p0 p1 p2 p3)), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 p2 p3)), (F (AND p0 p1 p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 12 factoid took 826 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 749 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 731 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-24 12:53:46] [INFO ] Invariant cache hit.
[2024-05-24 12:53:46] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 12:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:46] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-05-24 12:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:53:46] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-24 12:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:46] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-24 12:53:47] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 28 ms.
[2024-05-24 12:53:50] [INFO ] Added : 511 causal constraints over 103 iterations in 3550 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 435 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 496 transition count 278
Reduce places removed 253 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 255 rules applied. Total rules applied 510 place count 243 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 512 place count 241 transition count 276
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 512 place count 241 transition count 210
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 644 place count 175 transition count 210
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 675 place count 144 transition count 179
Iterating global reduction 3 with 31 rules applied. Total rules applied 706 place count 144 transition count 179
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 898 place count 48 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 48 transition count 82
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 928 place count 19 transition count 25
Iterating global reduction 4 with 29 rules applied. Total rules applied 957 place count 19 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 961 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 962 place count 16 transition count 23
Applied a total of 962 rules in 24 ms. Remains 16 /538 variables (removed 522) and now considering 23/541 (removed 518) transitions.
[2024-05-24 12:53:50] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-05-24 12:53:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:53:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:53:50] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 12:53:50] [INFO ] Invariant cache hit.
[2024-05-24 12:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 12:53:50] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 12:53:50] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 12:53:50] [INFO ] Invariant cache hit.
[2024-05-24 12:53:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/538 places, 23/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 16/538 places, 23/541 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/16 stabilizing places and 4/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 29 factoid took 870 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 703 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Finished random walk after 2317 steps, including 167 resets, run visited all 20 properties in 31 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND p0 (NOT p1) p2 p3)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 p1 p2 p3)), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND (NOT p0) p1 p2 p3)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 29 factoid took 1923 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 780 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 724 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-24 12:53:55] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 12:53:55] [INFO ] Invariant cache hit.
[2024-05-24 12:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:53:55] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 12:53:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:53:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:53:55] [INFO ] Computed and/alt/rep : 18/44/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:53:55] [INFO ] Added : 14 causal constraints over 4 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 752 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 16896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 39 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-24 12:53:56] [INFO ] Computed 33 invariants in 5 ms
[2024-05-24 12:53:56] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-24 12:53:56] [INFO ] Invariant cache hit.
[2024-05-24 12:53:57] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-24 12:53:57] [INFO ] Invariant cache hit.
[2024-05-24 12:53:57] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s184 1), p0:(EQ s34 1), p1:(EQ s148 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(p0)||X(F(p1)))))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 47 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-24 12:53:57] [INFO ] Computed 33 invariants in 6 ms
[2024-05-24 12:53:57] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-24 12:53:57] [INFO ] Invariant cache hit.
[2024-05-24 12:53:58] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-24 12:53:58] [INFO ] Invariant cache hit.
[2024-05-24 12:53:58] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s421 1), p1:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 493 reset in 149 ms.
Product exploration explored 100000 steps with 494 reset in 145 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 252 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=126 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-24 12:53:59] [INFO ] Invariant cache hit.
[2024-05-24 12:53:59] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-24 12:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:00] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-24 12:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:54:00] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-24 12:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:00] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-24 12:54:00] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-24 12:54:03] [INFO ] Added : 445 causal constraints over 89 iterations in 2971 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 9 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-24 12:54:03] [INFO ] Invariant cache hit.
[2024-05-24 12:54:03] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-24 12:54:03] [INFO ] Invariant cache hit.
[2024-05-24 12:54:04] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-24 12:54:04] [INFO ] Invariant cache hit.
[2024-05-24 12:54:04] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 536/536 places, 538/538 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 184 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-24 12:54:05] [INFO ] Invariant cache hit.
[2024-05-24 12:54:05] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 12:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:05] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-24 12:54:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:54:05] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-24 12:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:06] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-05-24 12:54:06] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-24 12:54:09] [INFO ] Added : 445 causal constraints over 89 iterations in 2978 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 491 reset in 142 ms.
Product exploration explored 100000 steps with 489 reset in 153 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Graph (trivial) has 436 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 829 edges and 531 vertex of which 495 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 495 transition count 529
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 259 place count 495 transition count 531
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 292 place count 495 transition count 531
Discarding 189 places :
Symmetric choice reduction at 1 with 189 rule applications. Total rules 481 place count 306 transition count 342
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 670 place count 306 transition count 342
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 701 place count 275 transition count 311
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 732 place count 275 transition count 311
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 832 place count 275 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 834 place count 275 transition count 310
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 904 place count 205 transition count 239
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 974 place count 205 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 975 place count 205 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 976 place count 204 transition count 238
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 977 place count 204 transition count 238
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 1009 place count 204 transition count 333
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1071 place count 142 transition count 209
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 1133 place count 142 transition count 209
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1223 place count 52 transition count 59
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 1313 place count 52 transition count 59
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1313 rules in 78 ms. Remains 52 /536 variables (removed 484) and now considering 59/538 (removed 479) transitions.
[2024-05-24 12:54:10] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 59 rows 52 cols
[2024-05-24 12:54:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:54:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/536 places, 59/538 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 52/536 places, 59/538 transitions.
Built C files in :
/tmp/ltsmin3155266923707591865
[2024-05-24 12:54:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3155266923707591865
Running compilation step : cd /tmp/ltsmin3155266923707591865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 762 ms.
Running link step : cd /tmp/ltsmin3155266923707591865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3155266923707591865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18145749352063143807.hoa' '--buchi-type=spotba'
LTSmin run took 390 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 13973 ms.
All properties solved by simple procedures.
Total runtime 57870 ms.

BK_STOP 1716555252630

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is GPUForwardProgress-PT-32b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625500368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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