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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:11 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 141K 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-28b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678480746776

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-28b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 20:39:10] [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-10 20:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:39:10] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-10 20:39:10] [INFO ] Transformed 568 places.
[2023-03-10 20:39:10] [INFO ] Transformed 597 transitions.
[2023-03-10 20:39:10] [INFO ] Found NUPN structural information;
[2023-03-10 20:39:10] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 60 place count 508 transition count 538
Iterating global reduction 1 with 59 rules applied. Total rules applied 119 place count 508 transition count 538
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 147 place count 480 transition count 510
Iterating global reduction 1 with 28 rules applied. Total rules applied 175 place count 480 transition count 510
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 200 place count 480 transition count 485
Applied a total of 200 rules in 241 ms. Remains 480 /568 variables (removed 88) and now considering 485/597 (removed 112) transitions.
// Phase 1: matrix 485 rows 480 cols
[2023-03-10 20:39:11] [INFO ] Computed 29 place invariants in 40 ms
[2023-03-10 20:39:12] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-10 20:39:12] [INFO ] Invariant cache hit.
[2023-03-10 20:39:12] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2023-03-10 20:39:12] [INFO ] Invariant cache hit.
[2023-03-10 20:39:13] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 480/568 places, 485/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 480/568 places, 485/597 transitions.
Support contains 25 out of 480 places after structural reductions.
[2023-03-10 20:39:13] [INFO ] Flatten gal took : 130 ms
[2023-03-10 20:39:13] [INFO ] Flatten gal took : 58 ms
[2023-03-10 20:39:14] [INFO ] Input system was already deterministic with 485 transitions.
Support contains 24 out of 480 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 23) seen :14
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-10 20:39:15] [INFO ] Invariant cache hit.
[2023-03-10 20:39:15] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 36 ms returned sat
[2023-03-10 20:39:15] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 20:39:15] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-10 20:39:16] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 20:39:17] [INFO ] After 1202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-10 20:39:17] [INFO ] After 1997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 8 properties in 72 ms.
Computed a total of 90 stabilizing places and 90 stable transitions
Graph (complete) has 746 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.31 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Graph (trivial) has 397 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 740 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 231 place count 442 transition count 246
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 465 place count 213 transition count 241
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 468 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 469 place count 210 transition count 240
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 469 place count 210 transition count 181
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 587 place count 151 transition count 181
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 615 place count 123 transition count 153
Iterating global reduction 4 with 28 rules applied. Total rules applied 643 place count 123 transition count 153
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 817 place count 36 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 818 place count 36 transition count 65
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 845 place count 9 transition count 12
Iterating global reduction 5 with 27 rules applied. Total rules applied 872 place count 9 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 874 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 875 place count 7 transition count 10
Applied a total of 875 rules in 105 ms. Remains 7 /480 variables (removed 473) and now considering 10/485 (removed 475) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-10 20:39:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 20:39:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-10 20:39:18] [INFO ] Invariant cache hit.
[2023-03-10 20:39:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 20:39:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-10 20:39:18] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-10 20:39:18] [INFO ] Invariant cache hit.
[2023-03-10 20:39:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/480 places, 10/485 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 7/480 places, 10/485 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 475 transition count 480
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 475 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 475 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 474 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 474 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 474 transition count 477
Applied a total of 14 rules in 117 ms. Remains 474 /480 variables (removed 6) and now considering 477/485 (removed 8) transitions.
// Phase 1: matrix 477 rows 474 cols
[2023-03-10 20:39:18] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-10 20:39:19] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-10 20:39:19] [INFO ] Invariant cache hit.
[2023-03-10 20:39:19] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2023-03-10 20:39:19] [INFO ] Invariant cache hit.
[2023-03-10 20:39:20] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/480 places, 477/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 474/480 places, 477/485 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s299 1), p0:(EQ s232 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1178 reset in 544 ms.
Product exploration explored 100000 steps with 1181 reset in 276 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.7 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/474 stabilizing places and 88/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-10 20:39:22] [INFO ] Invariant cache hit.
[2023-03-10 20:39:23] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-10 20:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:23] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-10 20:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:39:24] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-10 20:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:24] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-10 20:39:24] [INFO ] Computed and/alt/rep : 471/618/471 causal constraints (skipped 5 transitions) in 73 ms.
[2023-03-10 20:39:29] [INFO ] Added : 445 causal constraints over 89 iterations in 5282 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 474 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 21 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-03-10 20:39:30] [INFO ] Invariant cache hit.
[2023-03-10 20:39:30] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-10 20:39:30] [INFO ] Invariant cache hit.
[2023-03-10 20:39:30] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-10 20:39:31] [INFO ] Invariant cache hit.
[2023-03-10 20:39:31] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1698 ms. Remains : 474/474 places, 477/477 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.13 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/474 stabilizing places and 88/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=108 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-10 20:39:32] [INFO ] Invariant cache hit.
[2023-03-10 20:39:33] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 24 ms returned sat
[2023-03-10 20:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:33] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-10 20:39:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:39:34] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-10 20:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:34] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-10 20:39:34] [INFO ] Computed and/alt/rep : 471/618/471 causal constraints (skipped 5 transitions) in 47 ms.
[2023-03-10 20:39:39] [INFO ] Added : 445 causal constraints over 89 iterations in 4982 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1194 reset in 303 ms.
Product exploration explored 100000 steps with 1198 reset in 308 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 388 edges and 474 vertex of which 6 / 474 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 732 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.7 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 437 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 228 place count 437 transition count 467
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 228 place count 437 transition count 469
Deduced a syphon composed of 257 places in 2 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 260 place count 437 transition count 469
Discarding 167 places :
Symmetric choice reduction at 2 with 167 rule applications. Total rules 427 place count 270 transition count 302
Deduced a syphon composed of 117 places in 2 ms
Iterating global reduction 2 with 167 rules applied. Total rules applied 594 place count 270 transition count 302
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 621 place count 243 transition count 275
Deduced a syphon composed of 90 places in 2 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 648 place count 243 transition count 275
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 737 place count 243 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 739 place count 243 transition count 274
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 801 place count 181 transition count 211
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 3 with 62 rules applied. Total rules applied 863 place count 181 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 864 place count 181 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 865 place count 180 transition count 210
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 866 place count 180 transition count 210
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 3 with 28 rules applied. Total rules applied 894 place count 180 transition count 294
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 949 place count 125 transition count 184
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 3 with 55 rules applied. Total rules applied 1004 place count 125 transition count 184
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 1085 place count 44 transition count 49
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 81 rules applied. Total rules applied 1166 place count 44 transition count 49
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1166 rules in 179 ms. Remains 44 /474 variables (removed 430) and now considering 49/477 (removed 428) transitions.
[2023-03-10 20:39:40] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 49 rows 44 cols
[2023-03-10 20:39:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 20:39:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/474 places, 49/477 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 44/474 places, 49/477 transitions.
Built C files in :
/tmp/ltsmin9311830099803044817
[2023-03-10 20:39:41] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9311830099803044817
Running compilation step : cd /tmp/ltsmin9311830099803044817;'/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 1522 ms.
Running link step : cd /tmp/ltsmin9311830099803044817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9311830099803044817;'/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/stateBased6039384147264324060.hoa' '--buchi-type=spotba'
LTSmin run took 760 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-02 finished in 24542 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(G(p1))))))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 473 transition count 478
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 473 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 473 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 472 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 472 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 472 transition count 474
Applied a total of 19 rules in 60 ms. Remains 472 /480 variables (removed 8) and now considering 474/485 (removed 11) transitions.
// Phase 1: matrix 474 rows 472 cols
[2023-03-10 20:39:43] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-10 20:39:43] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 20:39:43] [INFO ] Invariant cache hit.
[2023-03-10 20:39:44] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-10 20:39:44] [INFO ] Invariant cache hit.
[2023-03-10 20:39:44] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/480 places, 474/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 472/480 places, 474/485 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s119 0), p1:(EQ s111 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 1550 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)))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 473 transition count 478
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 473 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 473 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 472 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 472 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 472 transition count 474
Applied a total of 19 rules in 45 ms. Remains 472 /480 variables (removed 8) and now considering 474/485 (removed 11) transitions.
[2023-03-10 20:39:44] [INFO ] Invariant cache hit.
[2023-03-10 20:39:45] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-10 20:39:45] [INFO ] Invariant cache hit.
[2023-03-10 20:39:45] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2023-03-10 20:39:45] [INFO ] Invariant cache hit.
[2023-03-10 20:39:46] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/480 places, 474/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1605 ms. Remains : 472/480 places, 474/485 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s274 1) (EQ s459 1) (EQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-04 finished in 1749 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 X(G(p1)))))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 474 transition count 479
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 474 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 474 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 473 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 473 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 473 transition count 475
Applied a total of 17 rules in 36 ms. Remains 473 /480 variables (removed 7) and now considering 475/485 (removed 10) transitions.
// Phase 1: matrix 475 rows 473 cols
[2023-03-10 20:39:46] [INFO ] Computed 29 place invariants in 5 ms
[2023-03-10 20:39:46] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-10 20:39:46] [INFO ] Invariant cache hit.
[2023-03-10 20:39:47] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-10 20:39:47] [INFO ] Invariant cache hit.
[2023-03-10 20:39:48] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/480 places, 475/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1575 ms. Remains : 473/480 places, 475/485 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-05 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=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s449 1), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1085 reset in 254 ms.
Product exploration explored 100000 steps with 1062 reset in 324 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 736 edges and 473 vertex of which 441 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.10 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/473 stabilizing places and 88/475 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 520 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 183 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 6 factoid took 620 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-10 20:39:50] [INFO ] Invariant cache hit.
[2023-03-10 20:39:51] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-10 20:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:51] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-10 20:39:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:39:52] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 24 ms returned sat
[2023-03-10 20:39:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:39:52] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-10 20:39:52] [INFO ] Computed and/alt/rep : 469/616/469 causal constraints (skipped 5 transitions) in 48 ms.
[2023-03-10 20:39:56] [INFO ] Added : 294 causal constraints over 60 iterations in 4055 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 475/475 transitions.
Applied a total of 0 rules in 15 ms. Remains 473 /473 variables (removed 0) and now considering 475/475 (removed 0) transitions.
[2023-03-10 20:39:56] [INFO ] Invariant cache hit.
[2023-03-10 20:39:57] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-10 20:39:57] [INFO ] Invariant cache hit.
[2023-03-10 20:39:57] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2023-03-10 20:39:57] [INFO ] Invariant cache hit.
[2023-03-10 20:39:58] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1643 ms. Remains : 473/473 places, 475/475 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 736 edges and 473 vertex of which 441 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.9 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/473 stabilizing places and 88/475 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 199 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 6 factoid took 589 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-10 20:40:00] [INFO ] Invariant cache hit.
[2023-03-10 20:40:00] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-10 20:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:01] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-03-10 20:40:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:40:01] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-10 20:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:02] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-10 20:40:02] [INFO ] Computed and/alt/rep : 469/616/469 causal constraints (skipped 5 transitions) in 31 ms.
[2023-03-10 20:40:06] [INFO ] Added : 294 causal constraints over 60 iterations in 4093 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1026 reset in 242 ms.
Product exploration explored 100000 steps with 1025 reset in 276 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 475/475 transitions.
Graph (trivial) has 387 edges and 473 vertex of which 6 / 473 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 730 edges and 468 vertex of which 436 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 436 transition count 466
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 227 place count 436 transition count 468
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 257 place count 436 transition count 468
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 424 place count 269 transition count 301
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 591 place count 269 transition count 301
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 618 place count 242 transition count 274
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 645 place count 242 transition count 274
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 733 place count 242 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 242 transition count 273
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 798 place count 179 transition count 209
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 861 place count 179 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 862 place count 179 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 178 transition count 208
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 178 transition count 208
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 892 place count 178 transition count 292
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 947 place count 123 transition count 182
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 1002 place count 123 transition count 182
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 1083 place count 42 transition count 47
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 1164 place count 42 transition count 47
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 1164 rules in 98 ms. Remains 42 /473 variables (removed 431) and now considering 47/475 (removed 428) transitions.
[2023-03-10 20:40:07] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 47 rows 42 cols
[2023-03-10 20:40:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 20:40:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/473 places, 47/475 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 42/473 places, 47/475 transitions.
Built C files in :
/tmp/ltsmin10774126113007191915
[2023-03-10 20:40:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10774126113007191915
Running compilation step : cd /tmp/ltsmin10774126113007191915;'/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 1529 ms.
Running link step : cd /tmp/ltsmin10774126113007191915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10774126113007191915;'/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/stateBased2558017663251728299.hoa' '--buchi-type=spotba'
LTSmin run took 400 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-05 finished in 22834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Graph (trivial) has 398 edges and 480 vertex of which 6 / 480 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 740 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 232 place count 442 transition count 245
Reduce places removed 230 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 235 rules applied. Total rules applied 467 place count 212 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 469 place count 210 transition count 240
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 469 place count 210 transition count 180
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 589 place count 150 transition count 180
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 617 place count 122 transition count 152
Iterating global reduction 3 with 28 rules applied. Total rules applied 645 place count 122 transition count 152
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 815 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 37 transition count 66
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 844 place count 9 transition count 11
Iterating global reduction 4 with 28 rules applied. Total rules applied 872 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 874 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 875 place count 7 transition count 9
Applied a total of 875 rules in 47 ms. Remains 7 /480 variables (removed 473) and now considering 9/485 (removed 476) transitions.
// Phase 1: matrix 9 rows 7 cols
[2023-03-10 20:40:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 20:40:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 20:40:09] [INFO ] Invariant cache hit.
[2023-03-10 20:40:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 20:40:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-10 20:40:09] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 20:40:09] [INFO ] Invariant cache hit.
[2023-03-10 20:40:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/480 places, 9/485 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 7/480 places, 9/485 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-06 finished in 270 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(p0)||G(p1)))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Graph (trivial) has 391 edges and 480 vertex of which 6 / 480 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 740 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 442 transition count 249
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 230 rules applied. Total rules applied 458 place count 216 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 460 place count 214 transition count 245
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 460 place count 214 transition count 187
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 576 place count 156 transition count 187
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 605 place count 127 transition count 158
Iterating global reduction 3 with 29 rules applied. Total rules applied 634 place count 127 transition count 158
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 806 place count 41 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 807 place count 41 transition count 71
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 833 place count 15 transition count 20
Iterating global reduction 4 with 26 rules applied. Total rules applied 859 place count 15 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 863 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 864 place count 12 transition count 18
Applied a total of 864 rules in 42 ms. Remains 12 /480 variables (removed 468) and now considering 18/485 (removed 467) transitions.
[2023-03-10 20:40:09] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2023-03-10 20:40:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 20:40:10] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-10 20:40:10] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 20:40:10] [INFO ] Invariant cache hit.
[2023-03-10 20:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 20:40:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-10 20:40:10] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 20:40:10] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 20:40:10] [INFO ] Invariant cache hit.
[2023-03-10 20:40:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/480 places, 18/485 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 12/480 places, 18/485 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s3 0), p0:(OR (EQ s6 0) (EQ s9 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 63 steps with 4 reset in 8 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Graph (trivial) has 395 edges and 480 vertex of which 6 / 480 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 740 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 230 place count 442 transition count 247
Reduce places removed 228 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 233 rules applied. Total rules applied 463 place count 214 transition count 242
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 467 place count 211 transition count 241
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 467 place count 211 transition count 181
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 587 place count 151 transition count 181
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 615 place count 123 transition count 153
Iterating global reduction 4 with 28 rules applied. Total rules applied 643 place count 123 transition count 153
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 815 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 816 place count 37 transition count 66
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 843 place count 10 transition count 13
Iterating global reduction 5 with 27 rules applied. Total rules applied 870 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 872 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 873 place count 8 transition count 11
Applied a total of 873 rules in 36 ms. Remains 8 /480 variables (removed 472) and now considering 11/485 (removed 474) transitions.
// Phase 1: matrix 11 rows 8 cols
[2023-03-10 20:40:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 20:40:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 20:40:10] [INFO ] Invariant cache hit.
[2023-03-10 20:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 20:40:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-10 20:40:10] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 20:40:10] [INFO ] Invariant cache hit.
[2023-03-10 20:40:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/480 places, 11/485 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 8/480 places, 11/485 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 267 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(((!p0&&X(p1))||G(p1))))))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 474 transition count 479
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 474 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 474 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 473 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 473 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 473 transition count 476
Applied a total of 16 rules in 37 ms. Remains 473 /480 variables (removed 7) and now considering 476/485 (removed 9) transitions.
// Phase 1: matrix 476 rows 473 cols
[2023-03-10 20:40:10] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-10 20:40:10] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-10 20:40:10] [INFO ] Invariant cache hit.
[2023-03-10 20:40:11] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-10 20:40:11] [INFO ] Invariant cache hit.
[2023-03-10 20:40:11] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/480 places, 476/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1374 ms. Remains : 473/480 places, 476/485 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s121 1), p1:(NEQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 1614 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((X(F(p0)) U (p1&&G((p2&&F(p3))))))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 475 transition count 480
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 475 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 475 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 474 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 474 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 474 transition count 477
Applied a total of 14 rules in 50 ms. Remains 474 /480 variables (removed 6) and now considering 477/485 (removed 8) transitions.
// Phase 1: matrix 477 rows 474 cols
[2023-03-10 20:40:12] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-10 20:40:12] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-10 20:40:12] [INFO ] Invariant cache hit.
[2023-03-10 20:40:13] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2023-03-10 20:40:13] [INFO ] Invariant cache hit.
[2023-03-10 20:40:13] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/480 places, 477/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1643 ms. Remains : 474/480 places, 477/485 transitions.
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s462 1), p2:(OR (EQ s298 1) (EQ s232 1)), p3:(EQ s209 1), p0:(EQ s298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1201 steps with 10 reset in 8 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-11 finished in 2155 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))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 474 transition count 479
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 474 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 474 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 473 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 473 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 473 transition count 475
Applied a total of 17 rules in 49 ms. Remains 473 /480 variables (removed 7) and now considering 475/485 (removed 10) transitions.
// Phase 1: matrix 475 rows 473 cols
[2023-03-10 20:40:14] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-10 20:40:14] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-10 20:40:14] [INFO ] Invariant cache hit.
[2023-03-10 20:40:15] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-10 20:40:15] [INFO ] Invariant cache hit.
[2023-03-10 20:40:15] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/480 places, 475/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1422 ms. Remains : 473/480 places, 475/485 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s128 0) (EQ s460 0) (EQ s471 0)), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 601 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 736 edges and 473 vertex of which 441 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/473 stabilizing places and 88/475 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 3184 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(F(p0))&&F(p1))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 473 transition count 478
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 473 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 473 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 472 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 472 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 472 transition count 474
Applied a total of 19 rules in 28 ms. Remains 472 /480 variables (removed 8) and now considering 474/485 (removed 11) transitions.
// Phase 1: matrix 474 rows 472 cols
[2023-03-10 20:40:17] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-10 20:40:17] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 20:40:17] [INFO ] Invariant cache hit.
[2023-03-10 20:40:18] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-10 20:40:18] [INFO ] Invariant cache hit.
[2023-03-10 20:40:18] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/480 places, 474/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 472/480 places, 474/485 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s416 1), p1:(AND (EQ s94 1) (EQ s459 1) (EQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 1581 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 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 485/485 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 473 transition count 478
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 473 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 473 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 472 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 472 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 472 transition count 474
Applied a total of 19 rules in 30 ms. Remains 472 /480 variables (removed 8) and now considering 474/485 (removed 11) transitions.
[2023-03-10 20:40:19] [INFO ] Invariant cache hit.
[2023-03-10 20:40:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 20:40:19] [INFO ] Invariant cache hit.
[2023-03-10 20:40:19] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-10 20:40:19] [INFO ] Invariant cache hit.
[2023-03-10 20:40:20] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/480 places, 474/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1440 ms. Remains : 472/480 places, 474/485 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s464 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 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 1627 ms.
All properties solved by simple procedures.
Total runtime 70389 ms.

BK_STOP 1678480821980

--------------------
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-28b"
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-28b, 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-167840343800108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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