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-167840343800156.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-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343800156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:18 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 199K 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-40b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678498585794

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 01:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 01:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:36:28] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-11 01:36:28] [INFO ] Transformed 796 places.
[2023-03-11 01:36:28] [INFO ] Transformed 837 transitions.
[2023-03-11 01:36:28] [INFO ] Found NUPN structural information;
[2023-03-11 01:36:28] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 296 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 4 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 83 place count 713 transition count 755
Iterating global reduction 1 with 82 rules applied. Total rules applied 165 place count 713 transition count 755
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 201 place count 677 transition count 719
Iterating global reduction 1 with 36 rules applied. Total rules applied 237 place count 677 transition count 719
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 270 place count 677 transition count 686
Applied a total of 270 rules in 223 ms. Remains 677 /796 variables (removed 119) and now considering 686/837 (removed 151) transitions.
// Phase 1: matrix 686 rows 677 cols
[2023-03-11 01:36:29] [INFO ] Computed 41 place invariants in 49 ms
[2023-03-11 01:36:29] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-11 01:36:29] [INFO ] Invariant cache hit.
[2023-03-11 01:36:30] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2023-03-11 01:36:30] [INFO ] Invariant cache hit.
[2023-03-11 01:36:31] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 677/796 places, 686/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2256 ms. Remains : 677/796 places, 686/837 transitions.
Support contains 31 out of 677 places after structural reductions.
[2023-03-11 01:36:31] [INFO ] Flatten gal took : 133 ms
[2023-03-11 01:36:31] [INFO ] Flatten gal took : 54 ms
[2023-03-11 01:36:31] [INFO ] Input system was already deterministic with 686 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 32) seen :18
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 01:36:33] [INFO ] Invariant cache hit.
[2023-03-11 01:36:33] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 41 ms returned sat
[2023-03-11 01:36:33] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 01:36:34] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-11 01:36:35] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-11 01:36:36] [INFO ] After 2002ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-11 01:36:36] [INFO ] After 3084ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 154 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Parikh walk visited 12 properties in 114 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 126 stabilizing places and 126 stable transitions
Graph (complete) has 1055 edges and 677 vertex of which 633 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.26 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 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 676
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 672
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 664 transition count 669
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 664 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 664 transition count 666
Applied a total of 33 rules in 145 ms. Remains 664 /677 variables (removed 13) and now considering 666/686 (removed 20) transitions.
// Phase 1: matrix 666 rows 664 cols
[2023-03-11 01:36:37] [INFO ] Computed 41 place invariants in 10 ms
[2023-03-11 01:36:38] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-11 01:36:38] [INFO ] Invariant cache hit.
[2023-03-11 01:36:38] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-11 01:36:38] [INFO ] Invariant cache hit.
[2023-03-11 01:36:39] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/677 places, 666/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1505 ms. Remains : 664/677 places, 666/686 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-00 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 s245 1) (EQ s651 1) (EQ s662 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 329 steps with 0 reset in 13 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-00 finished in 1871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)&&!p1)) U p0) U (p2 U p0)))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 677
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 666 transition count 671
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 666 transition count 671
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 666 transition count 669
Applied a total of 28 rules in 192 ms. Remains 666 /677 variables (removed 11) and now considering 669/686 (removed 17) transitions.
// Phase 1: matrix 669 rows 666 cols
[2023-03-11 01:36:39] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-11 01:36:39] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-11 01:36:39] [INFO ] Invariant cache hit.
[2023-03-11 01:36:40] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2023-03-11 01:36:40] [INFO ] Invariant cache hit.
[2023-03-11 01:36:41] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/677 places, 669/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1968 ms. Remains : 666/677 places, 669/686 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (OR (NOT p0) p1), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s606 1), p2:(EQ s529 1), p1:(OR (EQ s529 1) (NEQ s606 1))], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-01 finished in 2335 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&&X((p1||F(G(p2))))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 677
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 673
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 665 transition count 670
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 665 transition count 670
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 665 transition count 667
Applied a total of 31 rules in 159 ms. Remains 665 /677 variables (removed 12) and now considering 667/686 (removed 19) transitions.
// Phase 1: matrix 667 rows 665 cols
[2023-03-11 01:36:41] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 01:36:42] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-11 01:36:42] [INFO ] Invariant cache hit.
[2023-03-11 01:36:43] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2023-03-11 01:36:43] [INFO ] Invariant cache hit.
[2023-03-11 01:36:43] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/677 places, 667/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1880 ms. Remains : 665/677 places, 667/686 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s174 1), p1:(EQ s374 1), p2:(EQ s552 0)], 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 293 reset in 572 ms.
Product exploration explored 100000 steps with 297 reset in 562 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1036 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.17 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/665 stabilizing places and 124/667 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1127 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 9) seen :7
Finished Best-First random walk after 2537 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=362 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND p0 (NOT p2))), (F (AND p0 p2)), (F p0), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 16 factoid took 1210 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
[2023-03-11 01:36:48] [INFO ] Invariant cache hit.
[2023-03-11 01:36:49] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-11 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:36:49] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-11 01:36:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:36:50] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 19 ms returned sat
[2023-03-11 01:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:36:50] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2023-03-11 01:36:50] [INFO ] Computed and/alt/rep : 661/867/661 causal constraints (skipped 5 transitions) in 64 ms.
[2023-03-11 01:36:59] [INFO ] Added : 639 causal constraints over 128 iterations in 8738 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 667/667 transitions.
Applied a total of 0 rules in 39 ms. Remains 665 /665 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-11 01:36:59] [INFO ] Invariant cache hit.
[2023-03-11 01:36:59] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 01:36:59] [INFO ] Invariant cache hit.
[2023-03-11 01:37:00] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-11 01:37:00] [INFO ] Invariant cache hit.
[2023-03-11 01:37:01] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1958 ms. Remains : 665/665 places, 667/667 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1036 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.18 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/665 stabilizing places and 124/667 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 951 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 30 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :7
Finished Best-First random walk after 1945 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=324 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND p0 (NOT p2))), (F (AND p0 p2)), (F p0), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 16 factoid took 1088 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
[2023-03-11 01:37:04] [INFO ] Invariant cache hit.
[2023-03-11 01:37:05] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-11 01:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:37:05] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-11 01:37:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:37:06] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 37 ms returned sat
[2023-03-11 01:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:37:06] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2023-03-11 01:37:07] [INFO ] Computed and/alt/rep : 661/867/661 causal constraints (skipped 5 transitions) in 43 ms.
[2023-03-11 01:37:15] [INFO ] Added : 639 causal constraints over 128 iterations in 8992 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 298 reset in 316 ms.
Product exploration explored 100000 steps with 298 reset in 345 ms.
Built C files in :
/tmp/ltsmin2235011369730910034
[2023-03-11 01:37:17] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2235011369730910034
Running compilation step : cd /tmp/ltsmin2235011369730910034;'/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 1944 ms.
Running link step : cd /tmp/ltsmin2235011369730910034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2235011369730910034;'/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/stateBased13419400768220255308.hoa' '--buchi-type=spotba'
LTSmin run took 419 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-03 finished in 37770 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&&G(p1)))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 677
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 677
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 668 transition count 674
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 665 transition count 671
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 665 transition count 671
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 665 transition count 668
Applied a total of 30 rules in 106 ms. Remains 665 /677 variables (removed 12) and now considering 668/686 (removed 18) transitions.
// Phase 1: matrix 668 rows 665 cols
[2023-03-11 01:37:19] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-11 01:37:19] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 01:37:19] [INFO ] Invariant cache hit.
[2023-03-11 01:37:20] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-11 01:37:20] [INFO ] Invariant cache hit.
[2023-03-11 01:37:21] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/677 places, 668/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 665/677 places, 668/686 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s108 0), p1:(EQ s283 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 294 reset in 249 ms.
Product exploration explored 100000 steps with 295 reset in 322 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1037 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 256 ms. (steps per millisecond=39 ) 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 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Finished probabilistic random walk after 171430 steps, run visited all 3 properties in 1889 ms. (steps per millisecond=90 )
Probabilistic random walk after 171430 steps, saw 97747 distinct states, run finished after 1889 ms. (steps per millisecond=90 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 668/668 transitions.
Applied a total of 0 rules in 35 ms. Remains 665 /665 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2023-03-11 01:37:25] [INFO ] Invariant cache hit.
[2023-03-11 01:37:25] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-11 01:37:25] [INFO ] Invariant cache hit.
[2023-03-11 01:37:26] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
[2023-03-11 01:37:26] [INFO ] Invariant cache hit.
[2023-03-11 01:37:27] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2001 ms. Remains : 665/665 places, 668/668 transitions.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1037 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.10 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 01:37:28] [INFO ] Invariant cache hit.
[2023-03-11 01:37:28] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 01:37:28] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-11 01:37:29] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 01:37:29] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-11 01:37:29] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 295 reset in 177 ms.
Product exploration explored 100000 steps with 295 reset in 204 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 668/668 transitions.
Graph (trivial) has 540 edges and 665 vertex of which 6 / 665 are part of one of the 1 SCC in 14 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1031 edges and 660 vertex of which 616 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 616 transition count 659
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 44 Pre rules applied. Total rules applied 322 place count 616 transition count 662
Deduced a syphon composed of 364 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 366 place count 616 transition count 662
Discarding 238 places :
Symmetric choice reduction at 1 with 238 rule applications. Total rules 604 place count 378 transition count 424
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 238 rules applied. Total rules applied 842 place count 378 transition count 424
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 881 place count 339 transition count 385
Deduced a syphon composed of 126 places in 2 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 920 place count 339 transition count 385
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 1044 place count 339 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1046 place count 339 transition count 384
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 1131 place count 254 transition count 298
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 85 rules applied. Total rules applied 1216 place count 254 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1217 place count 254 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1218 place count 253 transition count 297
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1219 place count 253 transition count 297
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 1258 place count 253 transition count 414
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1335 place count 176 transition count 260
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1412 place count 176 transition count 260
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1523 place count 65 transition count 75
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 1634 place count 65 transition count 75
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1634 rules in 232 ms. Remains 65 /665 variables (removed 600) and now considering 75/668 (removed 593) transitions.
[2023-03-11 01:37:30] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 75 rows 65 cols
[2023-03-11 01:37:30] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-11 01:37:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/665 places, 75/668 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 65/665 places, 75/668 transitions.
Built C files in :
/tmp/ltsmin3278175871759793568
[2023-03-11 01:37:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3278175871759793568
Running compilation step : cd /tmp/ltsmin3278175871759793568;'/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 1549 ms.
Running link step : cd /tmp/ltsmin3278175871759793568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3278175871759793568;'/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/stateBased1803728830123449529.hoa' '--buchi-type=spotba'
LTSmin run took 3951 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-04 finished in 16816 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) U p1)) U (p2||G(p3))))'
Support contains 6 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Graph (trivial) has 556 edges and 677 vertex of which 6 / 677 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 1049 edges and 672 vertex of which 628 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 627 transition count 350
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 337 rules applied. Total rules applied 665 place count 301 transition count 339
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 669 place count 297 transition count 339
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 669 place count 297 transition count 256
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 835 place count 214 transition count 256
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 874 place count 175 transition count 217
Iterating global reduction 3 with 39 rules applied. Total rules applied 913 place count 175 transition count 217
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 1149 place count 57 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1150 place count 57 transition count 98
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1187 place count 20 transition count 25
Iterating global reduction 4 with 37 rules applied. Total rules applied 1224 place count 20 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 1228 place count 18 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1229 place count 18 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1230 place count 17 transition count 23
Applied a total of 1230 rules in 44 ms. Remains 17 /677 variables (removed 660) and now considering 23/686 (removed 663) transitions.
[2023-03-11 01:37:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2023-03-11 01:37:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 01:37:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 01:37:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-11 01:37:36] [INFO ] Invariant cache hit.
[2023-03-11 01:37:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 01:37:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 01:37:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 01:37:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-11 01:37:36] [INFO ] Invariant cache hit.
[2023-03-11 01:37:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/677 places, 23/686 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 17/677 places, 23/686 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p3) p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s5 1) (NOT (AND (EQ s8 1) (EQ s14 1) (EQ s16 1)))), p3:(AND (EQ s10 1) (EQ s14 1) (EQ s16 1)), p1:(EQ s1 1), p0:(AND (EQ s8 1) (EQ s14 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-06 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 676
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 672
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 664 transition count 669
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 664 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 664 transition count 666
Applied a total of 33 rules in 54 ms. Remains 664 /677 variables (removed 13) and now considering 666/686 (removed 20) transitions.
// Phase 1: matrix 666 rows 664 cols
[2023-03-11 01:37:36] [INFO ] Computed 41 place invariants in 7 ms
[2023-03-11 01:37:37] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-11 01:37:37] [INFO ] Invariant cache hit.
[2023-03-11 01:37:37] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2023-03-11 01:37:37] [INFO ] Invariant cache hit.
[2023-03-11 01:37:38] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/677 places, 666/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1647 ms. Remains : 664/677 places, 666/686 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-07 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:(NEQ s172 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 287 steps with 0 reset in 6 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-07 finished in 1836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 676
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 672
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 664 transition count 669
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 664 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 664 transition count 666
Applied a total of 33 rules in 83 ms. Remains 664 /677 variables (removed 13) and now considering 666/686 (removed 20) transitions.
[2023-03-11 01:37:38] [INFO ] Invariant cache hit.
[2023-03-11 01:37:39] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-11 01:37:39] [INFO ] Invariant cache hit.
[2023-03-11 01:37:39] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2023-03-11 01:37:39] [INFO ] Invariant cache hit.
[2023-03-11 01:37:40] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/677 places, 666/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1498 ms. Remains : 664/677 places, 666/686 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s6 1), p0:(NEQ s589 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-08 finished in 1719 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) U G(p1))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 677
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 666 transition count 671
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 666 transition count 671
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 666 transition count 669
Applied a total of 28 rules in 52 ms. Remains 666 /677 variables (removed 11) and now considering 669/686 (removed 17) transitions.
// Phase 1: matrix 669 rows 666 cols
[2023-03-11 01:37:40] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-11 01:37:40] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-11 01:37:40] [INFO ] Invariant cache hit.
[2023-03-11 01:37:41] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-11 01:37:41] [INFO ] Invariant cache hit.
[2023-03-11 01:37:42] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/677 places, 669/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1869 ms. Remains : 666/677 places, 669/686 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s310 1), p0:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-09 finished in 2024 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((G((p0||F(p1)))||(p2&&F(!p1)))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 669 transition count 678
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 669 transition count 678
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 669 transition count 675
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 666 transition count 672
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 666 transition count 672
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 666 transition count 669
Applied a total of 28 rules in 83 ms. Remains 666 /677 variables (removed 11) and now considering 669/686 (removed 17) transitions.
// Phase 1: matrix 669 rows 666 cols
[2023-03-11 01:37:42] [INFO ] Computed 41 place invariants in 7 ms
[2023-03-11 01:37:42] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-11 01:37:42] [INFO ] Invariant cache hit.
[2023-03-11 01:37:43] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2023-03-11 01:37:43] [INFO ] Invariant cache hit.
[2023-03-11 01:37:44] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/677 places, 669/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2022 ms. Remains : 666/677 places, 669/686 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s433 1), p1:(EQ s630 1), p2:(NEQ s145 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 50000 reset in 620 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-40b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-11 finished in 3671 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))&&F((p1||X((p2||X(F(p3))))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 669 transition count 678
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 669 transition count 678
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 669 transition count 675
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 666 transition count 672
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 666 transition count 672
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 666 transition count 669
Applied a total of 28 rules in 56 ms. Remains 666 /677 variables (removed 11) and now considering 669/686 (removed 17) transitions.
// Phase 1: matrix 669 rows 666 cols
[2023-03-11 01:37:46] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-11 01:37:46] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-11 01:37:46] [INFO ] Invariant cache hit.
[2023-03-11 01:37:47] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-11 01:37:47] [INFO ] Invariant cache hit.
[2023-03-11 01:37:47] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/677 places, 669/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1919 ms. Remains : 666/677 places, 669/686 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s268 1), p0:(EQ s268 0), p2:(EQ s98 1), p3:(EQ s642 0)], nbAcceptance=0, 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 28759 reset in 501 ms.
Product exploration explored 100000 steps with 28865 reset in 378 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (AND (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 26 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2023-03-11 01:37:50] [INFO ] Invariant cache hit.
[2023-03-11 01:37:50] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-11 01:37:50] [INFO ] Invariant cache hit.
[2023-03-11 01:37:51] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-11 01:37:51] [INFO ] Invariant cache hit.
[2023-03-11 01:37:51] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1787 ms. Remains : 666/666 places, 669/669 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (AND (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 20101 reset in 267 ms.
Product exploration explored 100000 steps with 20072 reset in 280 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Graph (trivial) has 541 edges and 666 vertex of which 6 / 666 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 1032 edges and 661 vertex of which 617 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 318 rules applied. Total rules applied 320 place count 617 transition count 660
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 320 place count 617 transition count 663
Deduced a syphon composed of 361 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 363 place count 617 transition count 663
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 598 place count 382 transition count 428
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 235 rules applied. Total rules applied 833 place count 382 transition count 428
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 872 place count 343 transition count 389
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 911 place count 343 transition count 389
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 1 with 125 rules applied. Total rules applied 1036 place count 343 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1038 place count 343 transition count 388
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 1124 place count 257 transition count 301
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 1210 place count 257 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1211 place count 257 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1212 place count 256 transition count 300
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1213 place count 256 transition count 300
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 1253 place count 256 transition count 419
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1331 place count 178 transition count 263
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1409 place count 178 transition count 263
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1520 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 1631 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1631 rules in 122 ms. Remains 67 /666 variables (removed 599) and now considering 78/669 (removed 591) transitions.
[2023-03-11 01:37:53] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 78 rows 67 cols
[2023-03-11 01:37:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 01:37:53] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/666 places, 78/669 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 67/666 places, 78/669 transitions.
Built C files in :
/tmp/ltsmin9880360921442324665
[2023-03-11 01:37:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9880360921442324665
Running compilation step : cd /tmp/ltsmin9880360921442324665;'/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 1606 ms.
Running link step : cd /tmp/ltsmin9880360921442324665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9880360921442324665;'/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/stateBased12236696325700141694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 23 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
// Phase 1: matrix 669 rows 666 cols
[2023-03-11 01:38:08] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 01:38:09] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-11 01:38:09] [INFO ] Invariant cache hit.
[2023-03-11 01:38:10] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2023-03-11 01:38:10] [INFO ] Invariant cache hit.
[2023-03-11 01:38:10] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1857 ms. Remains : 666/666 places, 669/669 transitions.
Built C files in :
/tmp/ltsmin13188609633613772147
[2023-03-11 01:38:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13188609633613772147
Running compilation step : cd /tmp/ltsmin13188609633613772147;'/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 1719 ms.
Running link step : cd /tmp/ltsmin13188609633613772147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13188609633613772147;'/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/stateBased4046756829340701646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 01:38:26] [INFO ] Flatten gal took : 65 ms
[2023-03-11 01:38:26] [INFO ] Flatten gal took : 58 ms
[2023-03-11 01:38:26] [INFO ] Time to serialize gal into /tmp/LTL17134175720729777298.gal : 13 ms
[2023-03-11 01:38:26] [INFO ] Time to serialize properties into /tmp/LTL8522452223332226289.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/LTL17134175720729777298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3195910677120549260.hoa' '-atoms' '/tmp/LTL8522452223332226289.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/LTL8522452223332226289.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3195910677120549260.hoa
Detected timeout of ITS tools.
[2023-03-11 01:38:41] [INFO ] Flatten gal took : 35 ms
[2023-03-11 01:38:41] [INFO ] Flatten gal took : 34 ms
[2023-03-11 01:38:41] [INFO ] Time to serialize gal into /tmp/LTL7912558441435736224.gal : 5 ms
[2023-03-11 01:38:41] [INFO ] Time to serialize properties into /tmp/LTL17085205490608926879.ltl : 2 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/LTL7912558441435736224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17085205490608926879.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 : !(((X(F("(p313==0)")))&&(F(("(p313==1)")||(X(("(p109==1)")||(X(F("(p761==0)")))))))))
Formula 0 simplified : XG!"(p313==0)" | G(!"(p313==1)" & X(!"(p109==1)" & XG!"(p761==0)"))
Detected timeout of ITS tools.
[2023-03-11 01:38:56] [INFO ] Flatten gal took : 33 ms
[2023-03-11 01:38:56] [INFO ] Applying decomposition
[2023-03-11 01:38:56] [INFO ] Flatten gal took : 29 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/graph13334327927914281413.txt' '-o' '/tmp/graph13334327927914281413.bin' '-w' '/tmp/graph13334327927914281413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13334327927914281413.bin' '-l' '-1' '-v' '-w' '/tmp/graph13334327927914281413.weights' '-q' '0' '-e' '0.001'
[2023-03-11 01:38:56] [INFO ] Decomposing Gal with order
[2023-03-11 01:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 01:38:56] [INFO ] Removed a total of 211 redundant transitions.
[2023-03-11 01:38:56] [INFO ] Flatten gal took : 126 ms
[2023-03-11 01:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2023-03-11 01:38:56] [INFO ] Time to serialize gal into /tmp/LTL11445295389057631591.gal : 21 ms
[2023-03-11 01:38:56] [INFO ] Time to serialize properties into /tmp/LTL15504955426759542026.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/LTL11445295389057631591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15504955426759542026.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...256
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i16.u119.p313==0)")))&&(F(("(i16.u119.p313==1)")||(X(("(i5.u43.p109==1)")||(X(F("(i41.u276.p761==0)")))))))))
Formula 0 simplified : XG!"(i16.u119.p313==0)" | G(!"(i16.u119.p313==1)" & X(!"(i5.u43.p109==1)" & XG!"(i41.u276.p761==0)"))
Reverse transition relation is NOT exact ! Due to transitions t604, i1.t542, i1.t535, i2.t599, i2.t590, i3.i1.t584, i3.i1.i2.t577, i4.t570, i4.t563, i5.t55...1127
Computing Next relation with stutter on 2.43153e+19 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
417 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,4.2714,103484,1,0,198409,334,6085,147913,151,602,763473
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-12 finished in 75575 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(p1)&&F(p2))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Graph (trivial) has 558 edges and 677 vertex of which 6 / 677 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 1049 edges and 672 vertex of which 628 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 627 transition count 352
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 335 rules applied. Total rules applied 661 place count 303 transition count 341
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 667 place count 299 transition count 339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 669 place count 297 transition count 339
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 669 place count 297 transition count 256
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 835 place count 214 transition count 256
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 875 place count 174 transition count 216
Iterating global reduction 4 with 40 rules applied. Total rules applied 915 place count 174 transition count 216
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1159 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1160 place count 52 transition count 93
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1198 place count 14 transition count 18
Iterating global reduction 5 with 38 rules applied. Total rules applied 1236 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1238 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1239 place count 12 transition count 16
Applied a total of 1239 rules in 37 ms. Remains 12 /677 variables (removed 665) and now considering 16/686 (removed 670) transitions.
// Phase 1: matrix 16 rows 12 cols
[2023-03-11 01:39:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 01:39:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 01:39:01] [INFO ] Invariant cache hit.
[2023-03-11 01:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 01:39:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-11 01:39:01] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 01:39:01] [INFO ] Invariant cache hit.
[2023-03-11 01:39:01] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/677 places, 16/686 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 12/677 places, 16/686 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s8 1), p1:(EQ s6 1), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-13 finished in 436 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(G(p0))||((F(p1) U p2) U X(X(!p1)))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 686/686 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 669 transition count 678
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 669 transition count 678
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 669 transition count 675
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 667 transition count 673
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 667 transition count 673
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 667 transition count 671
Applied a total of 25 rules in 53 ms. Remains 667 /677 variables (removed 10) and now considering 671/686 (removed 15) transitions.
// Phase 1: matrix 671 rows 667 cols
[2023-03-11 01:39:02] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-11 01:39:02] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-11 01:39:02] [INFO ] Invariant cache hit.
[2023-03-11 01:39:03] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-03-11 01:39:03] [INFO ] Invariant cache hit.
[2023-03-11 01:39:03] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 667/677 places, 671/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1914 ms. Remains : 667/677 places, 671/686 transitions.
Stuttering acceptance computed with spot in 734 ms :[(AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1), p1, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p0), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(EQ s583 1), p0:(EQ s379 1), p1:(EQ s49 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 461 ms.
Product exploration explored 100000 steps with 33333 reset in 388 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1040 edges and 667 vertex of which 623 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-40b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-15 finished in 3999 ms.
All properties solved by simple procedures.
Total runtime 157718 ms.

BK_STOP 1678498747171

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-40b, 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-smll-167840343800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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