About the Execution of ITS-Tools for GPUForwardProgress-PT-32b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1780.651 | 100403.00 | 211062.00 | 769.50 | FTFFFTFFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r197-smll-167840343800123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPUForwardProgress-PT-32b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343800123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 160K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678485322893
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 21:55:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 21:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:55:26] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-10 21:55:26] [INFO ] Transformed 644 places.
[2023-03-10 21:55:26] [INFO ] Transformed 677 transitions.
[2023-03-10 21:55:26] [INFO ] Found NUPN structural information;
[2023-03-10 21:55:26] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 66 place count 578 transition count 612
Iterating global reduction 1 with 65 rules applied. Total rules applied 131 place count 578 transition count 612
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 162 place count 547 transition count 581
Iterating global reduction 1 with 31 rules applied. Total rules applied 193 place count 547 transition count 581
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 221 place count 547 transition count 553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 222 place count 546 transition count 552
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 546 transition count 552
Applied a total of 223 rules in 237 ms. Remains 546 /644 variables (removed 98) and now considering 552/677 (removed 125) transitions.
// Phase 1: matrix 552 rows 546 cols
[2023-03-10 21:55:26] [INFO ] Computed 33 place invariants in 32 ms
[2023-03-10 21:55:27] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-10 21:55:27] [INFO ] Invariant cache hit.
[2023-03-10 21:55:27] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-10 21:55:27] [INFO ] Invariant cache hit.
[2023-03-10 21:55:28] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 546/644 places, 552/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1891 ms. Remains : 546/644 places, 552/677 transitions.
Support contains 20 out of 546 places after structural reductions.
[2023-03-10 21:55:28] [INFO ] Flatten gal took : 108 ms
[2023-03-10 21:55:28] [INFO ] Flatten gal took : 48 ms
[2023-03-10 21:55:28] [INFO ] Input system was already deterministic with 552 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:55:29] [INFO ] Invariant cache hit.
[2023-03-10 21:55:29] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 27 ms returned sat
[2023-03-10 21:55:30] [INFO ] After 317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-10 21:55:30] [INFO ] After 412ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-10 21:55:30] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-10 21:55:30] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 42 ms returned sat
[2023-03-10 21:55:31] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:55:31] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-10 21:55:31] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 147 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 12 ms.
Computed a total of 103 stabilizing places and 103 stable transitions
Graph (complete) has 849 edges and 546 vertex of which 510 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.32 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Graph (trivial) has 451 edges and 546 vertex of which 6 / 546 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 843 edges and 541 vertex of which 505 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 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 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 504 transition count 278
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 269 rules applied. Total rules applied 535 place count 240 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 537 place count 238 transition count 273
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 537 place count 238 transition count 206
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 671 place count 171 transition count 206
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 702 place count 140 transition count 175
Iterating global reduction 3 with 31 rules applied. Total rules applied 733 place count 140 transition count 175
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 929 place count 42 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 930 place count 42 transition count 76
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 961 place count 11 transition count 15
Iterating global reduction 4 with 31 rules applied. Total rules applied 992 place count 11 transition count 15
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 996 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 997 place count 8 transition count 13
Applied a total of 997 rules in 104 ms. Remains 8 /546 variables (removed 538) and now considering 13/552 (removed 539) transitions.
[2023-03-10 21:55:31] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 21:55:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 21:55:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 21:55:31] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 21:55:31] [INFO ] Invariant cache hit.
[2023-03-10 21:55:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:55:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-10 21:55:31] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-10 21:55:31] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 21:55:31] [INFO ] Invariant cache hit.
[2023-03-10 21:55:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/546 places, 13/552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 8/546 places, 13/552 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-00 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 538 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 538 transition count 544
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 538 transition count 542
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 536 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 536 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 536 transition count 538
Applied a total of 24 rules in 140 ms. Remains 536 /546 variables (removed 10) and now considering 538/552 (removed 14) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-10 21:55:32] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-10 21:55:32] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-10 21:55:32] [INFO ] Invariant cache hit.
[2023-03-10 21:55:33] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
[2023-03-10 21:55:33] [INFO ] Invariant cache hit.
[2023-03-10 21:55:34] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/546 places, 538/552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 536/546 places, 538/552 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s346 0) (EQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1109 ms.
Product exploration explored 100000 steps with 50000 reset in 858 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.8 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-01 finished in 3973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(!p1||X(F((!p1&&F(p0))))))))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Graph (trivial) has 448 edges and 546 vertex of which 6 / 546 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 843 edges and 541 vertex of which 505 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 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 504 transition count 280
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 268 rules applied. Total rules applied 532 place count 242 transition count 274
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 536 place count 240 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 538 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 538 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 4 with 136 rules applied. Total rules applied 674 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 705 place count 139 transition count 173
Iterating global reduction 4 with 31 rules applied. Total rules applied 736 place count 139 transition count 173
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 924 place count 45 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 925 place count 45 transition count 78
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 956 place count 14 transition count 17
Iterating global reduction 5 with 31 rules applied. Total rules applied 987 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 5 with 2 rules applied. Total rules applied 989 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 990 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 991 place count 12 transition count 15
Applied a total of 991 rules in 49 ms. Remains 12 /546 variables (removed 534) and now considering 15/552 (removed 537) transitions.
// Phase 1: matrix 15 rows 12 cols
[2023-03-10 21:55:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 21:55:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 21:55:36] [INFO ] Invariant cache hit.
[2023-03-10 21:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:55:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 21:55:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 21:55:36] [INFO ] Invariant cache hit.
[2023-03-10 21:55:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/546 places, 15/552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 12/546 places, 15/552 transitions.
Stuttering acceptance computed with spot in 376 ms :[true, (NOT p1), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s8 1), p0:(OR (EQ s6 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-02 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((X((!p2 U (p3||G(!p2))))&&p1)))))'
Support contains 5 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 540 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 540 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 540 transition count 545
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 538 transition count 543
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 538 transition count 543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 538 transition count 541
Applied a total of 19 rules in 107 ms. Remains 538 /546 variables (removed 8) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:55:36] [INFO ] Computed 33 place invariants in 11 ms
[2023-03-10 21:55:37] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-10 21:55:37] [INFO ] Invariant cache hit.
[2023-03-10 21:55:37] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2023-03-10 21:55:37] [INFO ] Invariant cache hit.
[2023-03-10 21:55:38] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/546 places, 541/552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1869 ms. Remains : 538/546 places, 541/552 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s152 0) (EQ s108 1)), p1:(AND (NEQ s359 0) (NEQ s501 1)), p3:(NEQ s194 1), p2:(OR (EQ s359 0) (EQ s501 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 825 reset in 404 ms.
Stuttering criterion allowed to conclude after 76906 steps with 646 reset in 301 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-04 finished in 2872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(F(p1)))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 539 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 539 transition count 545
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 539 transition count 543
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 538 transition count 542
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 538 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 538 transition count 541
Applied a total of 19 rules in 51 ms. Remains 538 /546 variables (removed 8) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:55:39] [INFO ] Computed 33 place invariants in 7 ms
[2023-03-10 21:55:39] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-10 21:55:39] [INFO ] Invariant cache hit.
[2023-03-10 21:55:40] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2023-03-10 21:55:40] [INFO ] Invariant cache hit.
[2023-03-10 21:55:41] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/546 places, 541/552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1411 ms. Remains : 538/546 places, 541/552 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s446 0) (EQ s108 1)), p1:(AND (EQ s94 0) (EQ s378 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1166 reset in 266 ms.
Product exploration explored 100000 steps with 1180 reset in 657 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.16 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3340 steps, including 11 resets, run visited all 2 properties in 22 ms. (steps per millisecond=151 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2023-03-10 21:55:42] [INFO ] Invariant cache hit.
[2023-03-10 21:55:43] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-10 21:55:43] [INFO ] Invariant cache hit.
[2023-03-10 21:55:43] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-10 21:55:43] [INFO ] Invariant cache hit.
[2023-03-10 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1458 ms. Remains : 538/538 places, 541/541 transitions.
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.11 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:55:44] [INFO ] Invariant cache hit.
[2023-03-10 21:55:44] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:55:45] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 34 ms returned sat
[2023-03-10 21:55:45] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:55:45] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 21:55:45] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 434 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 9 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.2 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 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 516 place count 241 transition count 209
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 644 place count 177 transition count 209
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 677 place count 144 transition count 176
Iterating global reduction 3 with 33 rules applied. Total rules applied 710 place count 144 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 710 place count 144 transition count 175
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 712 place count 143 transition count 175
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 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.1 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 1 transitions
Reduce isomorphic transitions removed 1 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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 973 place count 13 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 974 place count 13 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 975 place count 13 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 976 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 977 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 980 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 981 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 981 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 983 place count 9 transition count 10
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 10 with 2 rules applied. Total rules applied 985 place count 8 transition count 9
Applied a total of 985 rules in 64 ms. Remains 8 /538 variables (removed 530) and now considering 9/541 (removed 532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 8/538 places, 9/541 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1179 reset in 276 ms.
Product exploration explored 100000 steps with 1179 reset in 296 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 434 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.4 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 497 transition count 532
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 257 place count 497 transition count 534
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 289 place count 497 transition count 534
Discarding 187 places :
Symmetric choice reduction at 1 with 187 rule applications. Total rules 476 place count 310 transition count 347
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 187 rules applied. Total rules applied 663 place count 310 transition count 347
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 693 place count 280 transition count 317
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 723 place count 280 transition count 317
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 825 place count 280 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 827 place count 280 transition count 317
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 897 place count 210 transition count 246
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 967 place count 210 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 968 place count 210 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 969 place count 209 transition count 245
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 970 place count 209 transition count 245
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 1001 place count 209 transition count 338
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 1060 place count 150 transition count 220
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1119 place count 150 transition count 220
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 1203 place count 66 transition count 80
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 84 rules applied. Total rules applied 1287 place count 66 transition count 80
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 1287 rules in 190 ms. Remains 66 /538 variables (removed 472) and now considering 80/541 (removed 461) transitions.
[2023-03-10 21:55:47] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2023-03-10 21:55:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 21:55:47] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/538 places, 80/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 66/538 places, 80/541 transitions.
Built C files in :
/tmp/ltsmin6097436661246270437
[2023-03-10 21:55:47] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6097436661246270437
Running compilation step : cd /tmp/ltsmin6097436661246270437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1490 ms.
Running link step : cd /tmp/ltsmin6097436661246270437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6097436661246270437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased139607869716901272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 20 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:56:02] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-10 21:56:02] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-10 21:56:02] [INFO ] Invariant cache hit.
[2023-03-10 21:56:03] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-10 21:56:03] [INFO ] Invariant cache hit.
[2023-03-10 21:56:03] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1306 ms. Remains : 538/538 places, 541/541 transitions.
Built C files in :
/tmp/ltsmin7920957041570500570
[2023-03-10 21:56:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7920957041570500570
Running compilation step : cd /tmp/ltsmin7920957041570500570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1433 ms.
Running link step : cd /tmp/ltsmin7920957041570500570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7920957041570500570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased514535385289476724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 21:56:19] [INFO ] Flatten gal took : 32 ms
[2023-03-10 21:56:19] [INFO ] Flatten gal took : 32 ms
[2023-03-10 21:56:19] [INFO ] Time to serialize gal into /tmp/LTL14119689132358326859.gal : 9 ms
[2023-03-10 21:56:19] [INFO ] Time to serialize properties into /tmp/LTL3991419738595655957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14119689132358326859.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5410056115707501737.hoa' '-atoms' '/tmp/LTL3991419738595655957.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3991419738595655957.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5410056115707501737.hoa
Detected timeout of ITS tools.
[2023-03-10 21:56:34] [INFO ] Flatten gal took : 29 ms
[2023-03-10 21:56:34] [INFO ] Flatten gal took : 26 ms
[2023-03-10 21:56:34] [INFO ] Time to serialize gal into /tmp/LTL10336443409295986814.gal : 4 ms
[2023-03-10 21:56:34] [INFO ] Time to serialize properties into /tmp/LTL2201064713112600959.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10336443409295986814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2201064713112600959.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p525==0)||(p120==1))"))||(X(F("((p106==0)&&(p444==1))"))))))
Formula 0 simplified : G(F!"((p525==0)||(p120==1))" & XG!"((p106==0)&&(p444==1))")
Detected timeout of ITS tools.
[2023-03-10 21:56:49] [INFO ] Flatten gal took : 26 ms
[2023-03-10 21:56:49] [INFO ] Applying decomposition
[2023-03-10 21:56:49] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13622326890860266170.txt' '-o' '/tmp/graph13622326890860266170.bin' '-w' '/tmp/graph13622326890860266170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13622326890860266170.bin' '-l' '-1' '-v' '-w' '/tmp/graph13622326890860266170.weights' '-q' '0' '-e' '0.001'
[2023-03-10 21:56:49] [INFO ] Decomposing Gal with order
[2023-03-10 21:56:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 21:56:49] [INFO ] Removed a total of 167 redundant transitions.
[2023-03-10 21:56:49] [INFO ] Flatten gal took : 103 ms
[2023-03-10 21:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-10 21:56:49] [INFO ] Time to serialize gal into /tmp/LTL1711896608857147579.gal : 13 ms
[2023-03-10 21:56:49] [INFO ] Time to serialize properties into /tmp/LTL901687881163251075.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1711896608857147579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL901687881163251075.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("((i28.u189.p525==0)||(i6.u47.p120==1))"))||(X(F("((i6.u42.p106==0)&&(i23.u160.p444==1))"))))))
Formula 0 simplified : G(F!"((i28.u189.p525==0)||(i6.u47.p120==1))" & XG!"((i6.u42.p106==0)&&(i23.u160.p444==1))")
Reverse transition relation is NOT exact ! Due to transitions t486, i0.t193, i0.t186, i2.t481, i2.t474, i3.t468, i3.t461, i4.t454, i4.t446, i5.t439, i5.u36...944
Computing Next relation with stutter on 3.70604e+15 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
873 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.7965,209272,1,0,379094,284,4949,510191,148,592,1268997
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-06 finished in 80242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Graph (trivial) has 447 edges and 546 vertex of which 6 / 546 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 843 edges and 541 vertex of which 505 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 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 504 transition count 280
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 266 rules applied. Total rules applied 530 place count 242 transition count 276
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 532 place count 241 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 533 place count 240 transition count 275
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 533 place count 240 transition count 208
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 667 place count 173 transition count 208
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 698 place count 142 transition count 177
Iterating global reduction 4 with 31 rules applied. Total rules applied 729 place count 142 transition count 177
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 4 with 192 rules applied. Total rules applied 921 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 922 place count 46 transition count 80
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 951 place count 17 transition count 23
Iterating global reduction 5 with 29 rules applied. Total rules applied 980 place count 17 transition count 23
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 5 with 4 rules applied. Total rules applied 984 place count 15 transition count 22
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 987 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 988 place count 14 transition count 21
Applied a total of 988 rules in 39 ms. Remains 14 /546 variables (removed 532) and now considering 21/552 (removed 531) transitions.
[2023-03-10 21:56:59] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 14 cols
[2023-03-10 21:56:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 21:57:00] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 21:57:00] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2023-03-10 21:57:00] [INFO ] Invariant cache hit.
[2023-03-10 21:57:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:57:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-10 21:57:00] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 21:57:00] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2023-03-10 21:57:00] [INFO ] Invariant cache hit.
[2023-03-10 21:57:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/546 places, 21/552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 14/546 places, 21/552 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s7 0) (NEQ s8 1)), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-08 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 552/552 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 539 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 539 transition count 545
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 539 transition count 543
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 537 transition count 541
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 537 transition count 541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 537 transition count 539
Applied a total of 22 rules in 82 ms. Remains 537 /546 variables (removed 9) and now considering 539/552 (removed 13) transitions.
// Phase 1: matrix 539 rows 537 cols
[2023-03-10 21:57:00] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-10 21:57:00] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-10 21:57:00] [INFO ] Invariant cache hit.
[2023-03-10 21:57:01] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2023-03-10 21:57:01] [INFO ] Invariant cache hit.
[2023-03-10 21:57:02] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/546 places, 539/552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1623 ms. Remains : 537/546 places, 539/552 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s229 0) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 8754 steps with 51 reset in 20 ms.
FORMULA GPUForwardProgress-PT-32b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLCardinality-10 finished in 1772 ms.
All properties solved by simple procedures.
Total runtime 96387 ms.
BK_STOP 1678485423296
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-167840343800123"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;