About the Execution of 2023-gold for ShieldIIPt-PT-040A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16209.020 | 1763685.00 | 2720535.00 | 93212.40 | TFFFFFTTFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700193.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 22:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 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 ShieldIIPt-PT-040A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716953952298
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 03:39:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:39:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:39:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-29 03:39:14] [INFO ] Transformed 763 places.
[2024-05-29 03:39:14] [INFO ] Transformed 563 transitions.
[2024-05-29 03:39:14] [INFO ] Found NUPN structural information;
[2024-05-29 03:39:14] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 73 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-29 03:39:14] [INFO ] Computed 361 invariants in 26 ms
[2024-05-29 03:39:15] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-29 03:39:15] [INFO ] Invariant cache hit.
[2024-05-29 03:39:16] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2024-05-29 03:39:16] [INFO ] Invariant cache hit.
[2024-05-29 03:39:16] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1982 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 57 out of 763 places after structural reductions.
[2024-05-29 03:39:16] [INFO ] Flatten gal took : 121 ms
[2024-05-29 03:39:16] [INFO ] Flatten gal took : 63 ms
[2024-05-29 03:39:17] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 54 out of 763 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-29 03:39:17] [INFO ] Invariant cache hit.
[2024-05-29 03:39:18] [INFO ] [Real]Absence check using 361 positive place invariants in 61 ms returned sat
[2024-05-29 03:39:18] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-29 03:39:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 55 ms returned sat
[2024-05-29 03:39:21] [INFO ] After 1956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-29 03:39:23] [INFO ] After 3871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1551 ms.
[2024-05-29 03:39:24] [INFO ] After 6194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 2 properties in 2077 ms.
Support contains 42 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 79 place count 761 transition count 560
Applied a total of 79 rules in 174 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 560 rows 761 cols
[2024-05-29 03:39:27] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 03:39:28] [INFO ] [Real]Absence check using 361 positive place invariants in 60 ms returned sat
[2024-05-29 03:39:28] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 03:39:28] [INFO ] [Nat]Absence check using 361 positive place invariants in 56 ms returned sat
[2024-05-29 03:39:29] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 03:39:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 03:39:29] [INFO ] After 428ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:39:29] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 300 ms.
[2024-05-29 03:39:30] [INFO ] After 1977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 548 ms.
Support contains 14 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 75 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Finished probabilistic random walk after 63874 steps, run visited all 6 properties in 1115 ms. (steps per millisecond=57 )
Probabilistic random walk after 63874 steps, saw 62202 distinct states, run finished after 1116 ms. (steps per millisecond=57 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U p2)||F(p3)) U (G((p0||(p1 U p2)||F(p3)))||((p0||(p1 U p2)||F(p3))&&X(X(!p2))))))'
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 17 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-29 03:39:32] [INFO ] Computed 361 invariants in 3 ms
[2024-05-29 03:39:33] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-29 03:39:33] [INFO ] Invariant cache hit.
[2024-05-29 03:39:34] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2024-05-29 03:39:34] [INFO ] Invariant cache hit.
[2024-05-29 03:39:34] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1804 ms. Remains : 763/763 places, 562/562 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), false, (AND (NOT p3) p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s90 1) (EQ s105 1)), p2:(EQ s151 1), p3:(NEQ s455 1), p1:(AND (EQ s615 1) (EQ s617 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2368 ms.
Product exploration explored 100000 steps with 50000 reset in 2243 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X p3), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLFireability-00 finished in 6952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 47 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-29 03:39:39] [INFO ] Computed 361 invariants in 10 ms
[2024-05-29 03:39:40] [INFO ] Implicit Places using invariants in 497 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 501 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 39 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-29 03:39:40] [INFO ] Computed 359 invariants in 10 ms
[2024-05-29 03:39:40] [INFO ] Implicit Places using invariants in 477 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 28 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-29 03:39:40] [INFO ] Computed 358 invariants in 6 ms
[2024-05-29 03:39:41] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-29 03:39:41] [INFO ] Invariant cache hit.
[2024-05-29 03:39:42] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2434 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 533 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s559 1) (EQ s570 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]]
Product exploration explored 100000 steps with 8 reset in 675 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-01 finished in 3660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U (p1||G(p0)))))))'
Support contains 1 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 762 transition count 560
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 760 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 757 transition count 558
Applied a total of 8 rules in 43 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
// Phase 1: matrix 558 rows 757 cols
[2024-05-29 03:39:43] [INFO ] Computed 359 invariants in 1 ms
[2024-05-29 03:39:43] [INFO ] Implicit Places using invariants in 404 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 405 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/763 places, 558/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 755 transition count 557
Applied a total of 2 rules in 46 ms. Remains 755 /756 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 755 cols
[2024-05-29 03:39:44] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 03:39:44] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-29 03:39:44] [INFO ] Invariant cache hit.
[2024-05-29 03:39:45] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/763 places, 557/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1726 ms. Remains : 755/763 places, 557/562 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s566 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 665 ms.
Stack based approach found an accepted trace after 2661 steps with 0 reset with depth 2662 and stack size 2320 in 26 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-02 finished in 2480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U (!X(p1) U p2)))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-29 03:39:46] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 03:39:46] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 03:39:46] [INFO ] Invariant cache hit.
[2024-05-29 03:39:47] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2024-05-29 03:39:47] [INFO ] Invariant cache hit.
[2024-05-29 03:39:47] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s284 1) (AND (EQ s384 1) (EQ s397 1))), p0:(AND (EQ s299 1) (EQ s314 1)), p1:(EQ s284 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 698 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-03 finished in 2707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:39:48] [INFO ] Invariant cache hit.
[2024-05-29 03:39:49] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 03:39:49] [INFO ] Invariant cache hit.
[2024-05-29 03:39:50] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-05-29 03:39:50] [INFO ] Invariant cache hit.
[2024-05-29 03:39:50] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1709 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s355 1) (EQ s361 1) (EQ s363 1)), p1:(NEQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-04 finished in 1930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:39:50] [INFO ] Invariant cache hit.
[2024-05-29 03:39:51] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-29 03:39:51] [INFO ] Invariant cache hit.
[2024-05-29 03:39:51] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2024-05-29 03:39:51] [INFO ] Invariant cache hit.
[2024-05-29 03:39:52] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1761 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s348 0) (EQ s357 0)), p0:(AND (EQ s564 1) (EQ s570 1) (EQ s572 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-05 finished in 1955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:39:52] [INFO ] Invariant cache hit.
[2024-05-29 03:39:53] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 03:39:53] [INFO ] Invariant cache hit.
[2024-05-29 03:39:53] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-05-29 03:39:53] [INFO ] Invariant cache hit.
[2024-05-29 03:39:54] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1801 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s381 1), p1:(OR (NEQ s425 1) (NEQ s427 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 0 reset in 709 ms.
Stack based approach found an accepted trace after 13405 steps with 0 reset with depth 13406 and stack size 10563 in 125 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-08 finished in 2778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((p1 U p2)))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:39:55] [INFO ] Invariant cache hit.
[2024-05-29 03:39:55] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 03:39:55] [INFO ] Invariant cache hit.
[2024-05-29 03:39:56] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2024-05-29 03:39:56] [INFO ] Invariant cache hit.
[2024-05-29 03:39:57] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1788 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) 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=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s312 1) (EQ s323 1)), p1:(OR (AND (EQ s239 1) (EQ s243 1) (EQ s249 1)) (AND (EQ s235 1) (EQ s237 1))), p0:(OR (EQ s312 0) (EQ s323 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 682 ms.
Product exploration explored 100000 steps with 0 reset in 914 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 103 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8025 steps, run visited all 1 properties in 74 ms. (steps per millisecond=108 )
Probabilistic random walk after 8025 steps, saw 7782 distinct states, run finished after 75 ms. (steps per millisecond=107 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
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 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 38 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-29 03:39:59] [INFO ] Computed 361 invariants in 3 ms
[2024-05-29 03:40:00] [INFO ] Implicit Places using invariants in 436 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 437 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-29 03:40:00] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 03:40:00] [INFO ] Implicit Places using invariants in 427 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 428 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 23 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-29 03:40:00] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 03:40:01] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-29 03:40:01] [INFO ] Invariant cache hit.
[2024-05-29 03:40:01] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2247 ms. Remains : 756/763 places, 558/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7693 steps, run visited all 1 properties in 71 ms. (steps per millisecond=108 )
Probabilistic random walk after 7693 steps, saw 7439 distinct states, run finished after 72 ms. (steps per millisecond=106 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 672 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Built C files in :
/tmp/ltsmin5487951902949649477
[2024-05-29 03:40:04] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-29 03:40:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:04] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-29 03:40:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:04] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-29 03:40:04] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:04] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5487951902949649477
Running compilation step : cd /tmp/ltsmin5487951902949649477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1430 ms.
Running link step : cd /tmp/ltsmin5487951902949649477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5487951902949649477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16622875228747466331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 19 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-29 03:40:19] [INFO ] Invariant cache hit.
[2024-05-29 03:40:19] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-29 03:40:19] [INFO ] Invariant cache hit.
[2024-05-29 03:40:20] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-05-29 03:40:20] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 03:40:20] [INFO ] Invariant cache hit.
[2024-05-29 03:40:21] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1846 ms. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin4954538145934670632
[2024-05-29 03:40:21] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-29 03:40:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:21] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-29 03:40:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:21] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-29 03:40:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:21] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4954538145934670632
Running compilation step : cd /tmp/ltsmin4954538145934670632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1298 ms.
Running link step : cd /tmp/ltsmin4954538145934670632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4954538145934670632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7278863143343662494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:40:36] [INFO ] Flatten gal took : 44 ms
[2024-05-29 03:40:36] [INFO ] Flatten gal took : 42 ms
[2024-05-29 03:40:36] [INFO ] Time to serialize gal into /tmp/LTL5685011826514283444.gal : 9 ms
[2024-05-29 03:40:36] [INFO ] Time to serialize properties into /tmp/LTL18284543768594542245.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5685011826514283444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15352476645375297558.hoa' '-atoms' '/tmp/LTL18284543768594542245.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18284543768594542245.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15352476645375297558.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
607 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.1591,129780,1,0,8,636254,24,0,19208,281864,24
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040A-LTLFireability-09 finished in 47899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p1&&X(!p0))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-29 03:40:43] [INFO ] Computed 361 invariants in 5 ms
[2024-05-29 03:40:43] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-29 03:40:43] [INFO ] Invariant cache hit.
[2024-05-29 03:40:44] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2024-05-29 03:40:44] [INFO ] Invariant cache hit.
[2024-05-29 03:40:45] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1815 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s293 1) (EQ s304 1)), p0:(AND (EQ s641 1) (EQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 86 reset in 685 ms.
Product exploration explored 100000 steps with 74 reset in 822 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:40:47] [INFO ] Invariant cache hit.
[2024-05-29 03:40:47] [INFO ] [Real]Absence check using 361 positive place invariants in 63 ms returned sat
[2024-05-29 03:40:47] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:40:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 59 ms returned sat
[2024-05-29 03:40:48] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:40:48] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 03:40:48] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 173 ms.
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 56 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6357 steps, run visited all 2 properties in 146 ms. (steps per millisecond=43 )
Probabilistic random walk after 6357 steps, saw 6115 distinct states, run finished after 146 ms. (steps per millisecond=43 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:40:49] [INFO ] Invariant cache hit.
[2024-05-29 03:40:50] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-29 03:40:50] [INFO ] Invariant cache hit.
[2024-05-29 03:40:51] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2024-05-29 03:40:51] [INFO ] Invariant cache hit.
[2024-05-29 03:40:51] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1756 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:40:52] [INFO ] Invariant cache hit.
[2024-05-29 03:40:52] [INFO ] [Real]Absence check using 361 positive place invariants in 59 ms returned sat
[2024-05-29 03:40:52] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:40:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 55 ms returned sat
[2024-05-29 03:40:53] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:40:53] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 03:40:53] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
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 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 38 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6357 steps, run visited all 2 properties in 84 ms. (steps per millisecond=75 )
Probabilistic random walk after 6357 steps, saw 6115 distinct states, run finished after 84 ms. (steps per millisecond=75 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 1116 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 68 reset in 676 ms.
Product exploration explored 100000 steps with 83 reset in 823 ms.
Built C files in :
/tmp/ltsmin13444236580695082662
[2024-05-29 03:40:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13444236580695082662
Running compilation step : cd /tmp/ltsmin13444236580695082662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 942 ms.
Running link step : cd /tmp/ltsmin13444236580695082662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13444236580695082662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5959917642520835329.hoa' '--buchi-type=spotba'
LTSmin run took 1345 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040A-LTLFireability-10 finished in 16412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((X(G(p2))||p1)))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:40:59] [INFO ] Invariant cache hit.
[2024-05-29 03:41:00] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-29 03:41:00] [INFO ] Invariant cache hit.
[2024-05-29 03:41:01] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2024-05-29 03:41:01] [INFO ] Invariant cache hit.
[2024-05-29 03:41:01] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1822 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s32 1) (EQ s38 1) (EQ s40 1)), p2:(AND (EQ s747 1) (EQ s756 1)), p1:(OR (EQ s99 0) (EQ s112 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 691 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-11 finished in 2735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (p1||G(!p0))))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:41:02] [INFO ] Invariant cache hit.
[2024-05-29 03:41:02] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 03:41:02] [INFO ] Invariant cache hit.
[2024-05-29 03:41:03] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2024-05-29 03:41:03] [INFO ] Invariant cache hit.
[2024-05-29 03:41:04] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1703 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 1852 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (NOT (AND (EQ s411 1) (EQ s436 1))) (NOT (AND (EQ s331 1) (EQ s342 1) (EQ s30 1) (EQ s34 1) (EQ s40 1)))), p0:(AND (EQ s331 1) (EQ s342 1) (EQ s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1623 ms.
Product exploration explored 100000 steps with 33333 reset in 1714 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLFireability-13 finished in 6939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 762 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 760 transition count 560
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 757 transition count 558
Applied a total of 8 rules in 37 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
// Phase 1: matrix 558 rows 757 cols
[2024-05-29 03:41:09] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 03:41:09] [INFO ] Implicit Places using invariants in 450 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 460 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/763 places, 558/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 755 transition count 557
Applied a total of 2 rules in 20 ms. Remains 755 /756 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 755 cols
[2024-05-29 03:41:09] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 03:41:10] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-29 03:41:10] [INFO ] Invariant cache hit.
[2024-05-29 03:41:11] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/763 places, 557/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1745 ms. Remains : 755/763 places, 557/562 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s367 0) (EQ s369 0)), p1:(OR (NEQ s367 1) (NEQ s369 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 676 ms.
Product exploration explored 100000 steps with 0 reset in 858 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6223 steps, run visited all 2 properties in 124 ms. (steps per millisecond=50 )
Probabilistic random walk after 6223 steps, saw 5996 distinct states, run finished after 125 ms. (steps per millisecond=49 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 18 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-29 03:41:13] [INFO ] Invariant cache hit.
[2024-05-29 03:41:14] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-29 03:41:14] [INFO ] Invariant cache hit.
[2024-05-29 03:41:15] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2024-05-29 03:41:15] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 03:41:15] [INFO ] Invariant cache hit.
[2024-05-29 03:41:15] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1724 ms. Remains : 755/755 places, 557/557 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6223 steps, run visited all 2 properties in 130 ms. (steps per millisecond=47 )
Probabilistic random walk after 6223 steps, saw 5996 distinct states, run finished after 132 ms. (steps per millisecond=47 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 656 ms.
Product exploration explored 100000 steps with 0 reset in 889 ms.
Built C files in :
/tmp/ltsmin14679672606800157674
[2024-05-29 03:41:19] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2024-05-29 03:41:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:19] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2024-05-29 03:41:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:19] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2024-05-29 03:41:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14679672606800157674
Running compilation step : cd /tmp/ltsmin14679672606800157674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1375 ms.
Running link step : cd /tmp/ltsmin14679672606800157674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14679672606800157674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4605290664074394357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 18 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-29 03:41:34] [INFO ] Invariant cache hit.
[2024-05-29 03:41:35] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-29 03:41:35] [INFO ] Invariant cache hit.
[2024-05-29 03:41:35] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2024-05-29 03:41:35] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 03:41:35] [INFO ] Invariant cache hit.
[2024-05-29 03:41:36] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1712 ms. Remains : 755/755 places, 557/557 transitions.
Built C files in :
/tmp/ltsmin11066430376557171493
[2024-05-29 03:41:36] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2024-05-29 03:41:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:36] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2024-05-29 03:41:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:36] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2024-05-29 03:41:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:41:36] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11066430376557171493
Running compilation step : cd /tmp/ltsmin11066430376557171493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1399 ms.
Running link step : cd /tmp/ltsmin11066430376557171493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11066430376557171493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1507612791626713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:41:51] [INFO ] Flatten gal took : 27 ms
[2024-05-29 03:41:51] [INFO ] Flatten gal took : 24 ms
[2024-05-29 03:41:51] [INFO ] Time to serialize gal into /tmp/LTL644145591399273381.gal : 4 ms
[2024-05-29 03:41:51] [INFO ] Time to serialize properties into /tmp/LTL3847280968796266314.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL644145591399273381.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12157317458566242582.hoa' '-atoms' '/tmp/LTL3847280968796266314.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3847280968796266314.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12157317458566242582.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
561 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.6793,199280,1,0,143,1.10419e+06,30,47,17918,991975,259
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040A-LTLFireability-14 finished in 48921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-29 03:41:58] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 03:41:58] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-29 03:41:58] [INFO ] Invariant cache hit.
[2024-05-29 03:41:59] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-29 03:41:59] [INFO ] Invariant cache hit.
[2024-05-29 03:42:00] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s32 0) (EQ s38 0) (EQ s40 0) (AND (EQ s255 1) (EQ s266 1))), p1:(AND (EQ s32 1) (EQ s38 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 675 ms.
Product exploration explored 100000 steps with 0 reset in 855 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 272318 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 272318 steps, saw 269239 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-29 03:42:05] [INFO ] Invariant cache hit.
[2024-05-29 03:42:05] [INFO ] [Real]Absence check using 361 positive place invariants in 52 ms returned sat
[2024-05-29 03:42:05] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:42:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2024-05-29 03:42:06] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:42:06] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 03:42:06] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
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 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 44 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67889 steps, run visited all 1 properties in 630 ms. (steps per millisecond=107 )
Probabilistic random walk after 67889 steps, saw 65621 distinct states, run finished after 631 ms. (steps per millisecond=107 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 273 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:42:07] [INFO ] Invariant cache hit.
[2024-05-29 03:42:08] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-29 03:42:08] [INFO ] Invariant cache hit.
[2024-05-29 03:42:09] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2024-05-29 03:42:09] [INFO ] Invariant cache hit.
[2024-05-29 03:42:09] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1868 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 263003 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 263003 steps, saw 260033 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-29 03:42:13] [INFO ] Invariant cache hit.
[2024-05-29 03:42:13] [INFO ] [Real]Absence check using 361 positive place invariants in 54 ms returned sat
[2024-05-29 03:42:14] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:42:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 62 ms returned sat
[2024-05-29 03:42:14] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:42:14] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-29 03:42:14] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 38 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67889 steps, run visited all 1 properties in 604 ms. (steps per millisecond=112 )
Probabilistic random walk after 67889 steps, saw 65621 distinct states, run finished after 607 ms. (steps per millisecond=111 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 715 ms.
Product exploration explored 100000 steps with 0 reset in 887 ms.
Built C files in :
/tmp/ltsmin12315689423401188937
[2024-05-29 03:42:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12315689423401188937
Running compilation step : cd /tmp/ltsmin12315689423401188937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 981 ms.
Running link step : cd /tmp/ltsmin12315689423401188937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12315689423401188937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14173178107537848561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 20 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 03:42:32] [INFO ] Invariant cache hit.
[2024-05-29 03:42:33] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-29 03:42:33] [INFO ] Invariant cache hit.
[2024-05-29 03:42:34] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2024-05-29 03:42:34] [INFO ] Invariant cache hit.
[2024-05-29 03:42:34] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1848 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin14835552772369291830
[2024-05-29 03:42:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14835552772369291830
Running compilation step : cd /tmp/ltsmin14835552772369291830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 949 ms.
Running link step : cd /tmp/ltsmin14835552772369291830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14835552772369291830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6584649175939354101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:42:49] [INFO ] Flatten gal took : 33 ms
[2024-05-29 03:42:50] [INFO ] Flatten gal took : 32 ms
[2024-05-29 03:42:50] [INFO ] Time to serialize gal into /tmp/LTL9510342289130612611.gal : 4 ms
[2024-05-29 03:42:50] [INFO ] Time to serialize properties into /tmp/LTL18278131219821659090.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9510342289130612611.gal' '-t' 'CGAL' '-hoa' '/tmp/aut500284297811731534.hoa' '-atoms' '/tmp/LTL18278131219821659090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL18278131219821659090.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut500284297811731534.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 03:43:05] [INFO ] Flatten gal took : 30 ms
[2024-05-29 03:43:05] [INFO ] Flatten gal took : 30 ms
[2024-05-29 03:43:05] [INFO ] Time to serialize gal into /tmp/LTL12179365025537336529.gal : 4 ms
[2024-05-29 03:43:05] [INFO ] Time to serialize properties into /tmp/LTL1272024359080780123.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12179365025537336529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1272024359080780123.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("((p32==0)||(p38==0))")||(("(p40==0)")||(X("(((p32==1)&&(p38==1))&&(p40==1))"))))||("((p255==1)&&(p266==1))"))))
Formula 0 simplified : F(!"((p32==0)||(p38==0))" & !"((p255==1)&&(p266==1))" & !"(p40==0)" & X!"(((p32==1)&&(p38==1))&&(p40==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 03:43:20] [INFO ] Flatten gal took : 33 ms
[2024-05-29 03:43:20] [INFO ] Applying decomposition
[2024-05-29 03:43:20] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13277602902249765799.txt' '-o' '/tmp/graph13277602902249765799.bin' '-w' '/tmp/graph13277602902249765799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13277602902249765799.bin' '-l' '-1' '-v' '-w' '/tmp/graph13277602902249765799.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:43:20] [INFO ] Decomposing Gal with order
[2024-05-29 03:43:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:43:20] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 03:43:20] [INFO ] Flatten gal took : 77 ms
[2024-05-29 03:43:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2024-05-29 03:43:20] [INFO ] Time to serialize gal into /tmp/LTL15647882444592554178.gal : 14 ms
[2024-05-29 03:43:20] [INFO ] Time to serialize properties into /tmp/LTL12069602149121080794.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15647882444592554178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12069602149121080794.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((("((i2.i1.i0.u12.p32==0)||(i2.i0.i3.u15.p38==0))")||(("(i2.i0.i0.u16.p40==0)")||(X("(((i2.i1.i0.u12.p32==1)&&(i2.i0.i3.u15.p38==...234
Formula 0 simplified : F(!"((i2.i1.i0.u12.p32==0)||(i2.i0.i3.u15.p38==0))" & !"((i7.u106.p255==1)&&(i7.u111.p266==1))" & !"(i2.i0.i0.u16.p40==0)" & X!"(((i...224
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7168942627858158431
[2024-05-29 03:43:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7168942627858158431
Running compilation step : cd /tmp/ltsmin7168942627858158431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 941 ms.
Running link step : cd /tmp/ltsmin7168942627858158431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7168942627858158431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-LTLFireability-15 finished in 112631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLFireability-15
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
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 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 50 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-29 03:43:51] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 03:43:51] [INFO ] Implicit Places using invariants in 502 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 503 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 17 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-29 03:43:51] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 03:43:52] [INFO ] Implicit Places using invariants in 469 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 25 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-29 03:43:52] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 03:43:52] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-29 03:43:52] [INFO ] Invariant cache hit.
[2024-05-29 03:43:53] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2415 ms. Remains : 756/763 places, 558/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s32 0) (EQ s38 0) (EQ s40 0) (AND (EQ s255 1) (EQ s266 1))), p1:(AND (EQ s32 1) (EQ s38 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 673 ms.
Product exploration explored 100000 steps with 0 reset in 824 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 283762 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 283762 steps, saw 280238 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-29 03:43:58] [INFO ] Invariant cache hit.
[2024-05-29 03:43:58] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 03:43:59] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:43:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2024-05-29 03:43:59] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:43:59] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 03:43:59] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 756 transition count 558
Applied a total of 79 rules in 40 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67870 steps, run visited all 1 properties in 662 ms. (steps per millisecond=102 )
Probabilistic random walk after 67870 steps, saw 65623 distinct states, run finished after 663 ms. (steps per millisecond=102 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 227 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-29 03:44:01] [INFO ] Invariant cache hit.
[2024-05-29 03:44:01] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-29 03:44:01] [INFO ] Invariant cache hit.
[2024-05-29 03:44:02] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-29 03:44:02] [INFO ] Invariant cache hit.
[2024-05-29 03:44:02] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1687 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 281362 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 281362 steps, saw 277868 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-29 03:44:06] [INFO ] Invariant cache hit.
[2024-05-29 03:44:06] [INFO ] [Real]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 03:44:07] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:44:07] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 03:44:07] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:44:07] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 03:44:07] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 756 transition count 558
Applied a total of 79 rules in 27 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67870 steps, run visited all 1 properties in 639 ms. (steps per millisecond=106 )
Probabilistic random walk after 67870 steps, saw 65623 distinct states, run finished after 640 ms. (steps per millisecond=106 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 669 ms.
Product exploration explored 100000 steps with 0 reset in 825 ms.
Built C files in :
/tmp/ltsmin5298955912651003484
[2024-05-29 03:44:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5298955912651003484
Running compilation step : cd /tmp/ltsmin5298955912651003484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin5298955912651003484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5298955912651003484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17020891559893985564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 17 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-29 03:44:26] [INFO ] Invariant cache hit.
[2024-05-29 03:44:26] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-29 03:44:26] [INFO ] Invariant cache hit.
[2024-05-29 03:44:27] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2024-05-29 03:44:27] [INFO ] Invariant cache hit.
[2024-05-29 03:44:27] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1737 ms. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin11672270636278014003
[2024-05-29 03:44:27] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11672270636278014003
Running compilation step : cd /tmp/ltsmin11672270636278014003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin11672270636278014003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11672270636278014003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4144325952221320118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:44:42] [INFO ] Flatten gal took : 27 ms
[2024-05-29 03:44:42] [INFO ] Flatten gal took : 28 ms
[2024-05-29 03:44:42] [INFO ] Time to serialize gal into /tmp/LTL9547696889260415623.gal : 3 ms
[2024-05-29 03:44:42] [INFO ] Time to serialize properties into /tmp/LTL561117157983047491.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9547696889260415623.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9770519580830296764.hoa' '-atoms' '/tmp/LTL561117157983047491.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL561117157983047491.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9770519580830296764.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 03:44:58] [INFO ] Flatten gal took : 27 ms
[2024-05-29 03:44:58] [INFO ] Flatten gal took : 26 ms
[2024-05-29 03:44:58] [INFO ] Time to serialize gal into /tmp/LTL18251760635174872344.gal : 3 ms
[2024-05-29 03:44:58] [INFO ] Time to serialize properties into /tmp/LTL6045881125410019521.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18251760635174872344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6045881125410019521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("((p32==0)||(p38==0))")||(("(p40==0)")||(X("(((p32==1)&&(p38==1))&&(p40==1))"))))||("((p255==1)&&(p266==1))"))))
Formula 0 simplified : F(!"((p32==0)||(p38==0))" & !"((p255==1)&&(p266==1))" & !"(p40==0)" & X!"(((p32==1)&&(p38==1))&&(p40==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 03:45:13] [INFO ] Flatten gal took : 27 ms
[2024-05-29 03:45:13] [INFO ] Applying decomposition
[2024-05-29 03:45:13] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9934437691959750371.txt' '-o' '/tmp/graph9934437691959750371.bin' '-w' '/tmp/graph9934437691959750371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9934437691959750371.bin' '-l' '-1' '-v' '-w' '/tmp/graph9934437691959750371.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:45:13] [INFO ] Decomposing Gal with order
[2024-05-29 03:45:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:45:13] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-29 03:45:13] [INFO ] Flatten gal took : 42 ms
[2024-05-29 03:45:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-29 03:45:13] [INFO ] Time to serialize gal into /tmp/LTL17515132872865914587.gal : 13 ms
[2024-05-29 03:45:13] [INFO ] Time to serialize properties into /tmp/LTL1449677167199624232.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17515132872865914587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1449677167199624232.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("((i1.i1.i2.u12.p32==0)||(i1.i0.i0.u15.p38==0))")||(("(i1.i0.i1.u16.p40==0)")||(X("(((i1.i1.i2.u12.p32==1)&&(i1.i0.i0.u15.p38==...234
Formula 0 simplified : F(!"((i1.i1.i2.u12.p32==0)||(i1.i0.i0.u15.p38==0))" & !"((i7.u106.p255==1)&&(i7.u111.p266==1))" & !"(i1.i0.i1.u16.p40==0)" & X!"(((i...224
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4085228437793265084
[2024-05-29 03:45:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4085228437793265084
Running compilation step : cd /tmp/ltsmin4085228437793265084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 953 ms.
Running link step : cd /tmp/ltsmin4085228437793265084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4085228437793265084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-LTLFireability-15 finished in 112640 ms.
[2024-05-29 03:45:43] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14163181023286089383
[2024-05-29 03:45:43] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2024-05-29 03:45:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:45:43] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2024-05-29 03:45:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:45:43] [INFO ] Applying decomposition
[2024-05-29 03:45:43] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2024-05-29 03:45:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:45:43] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14163181023286089383
Running compilation step : cd /tmp/ltsmin14163181023286089383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 03:45:43] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17662052684317349659.txt' '-o' '/tmp/graph17662052684317349659.bin' '-w' '/tmp/graph17662052684317349659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17662052684317349659.bin' '-l' '-1' '-v' '-w' '/tmp/graph17662052684317349659.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:45:43] [INFO ] Decomposing Gal with order
[2024-05-29 03:45:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:45:43] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 03:45:43] [INFO ] Flatten gal took : 67 ms
[2024-05-29 03:45:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-29 03:45:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10376945763119701495.gal : 8 ms
[2024-05-29 03:45:43] [INFO ] Time to serialize properties into /tmp/LTLFireability4261096819415060603.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10376945763119701495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4261096819415060603.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((i2.u12.p32==0)||(i2.u15.p38==0))||((i2.u16.p40==0)||((i8.i0.i1.u106.p255==1)&&(i8.i0.i2.u111.p266==1))))")||(X("(((i2.u12.p3...202
Formula 0 simplified : F(!"(((i2.u12.p32==0)||(i2.u15.p38==0))||((i2.u16.p40==0)||((i8.i0.i1.u106.p255==1)&&(i8.i0.i2.u111.p266==1))))" & X!"(((i2.u12.p32=...196
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1685 ms.
Running link step : cd /tmp/ltsmin14163181023286089383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14163181023286089383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.191: LTL layer: formula: []((X((LTLAPp1==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.191: "[]((X((LTLAPp1==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.191: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.384: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.826: DFS-FIFO for weak LTL, using special progress label 565
pins2lts-mc-linux64( 0/ 8), 0.826: There are 566 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.826: State length is 764, there are 568 groups
pins2lts-mc-linux64( 0/ 8), 0.826: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.826: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.826: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.826: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.735: ~1 levels ~960 states ~4352 transitions
pins2lts-mc-linux64( 1/ 8), 2.121: ~1 levels ~1920 states ~10048 transitions
pins2lts-mc-linux64( 1/ 8), 2.655: ~1 levels ~3840 states ~22336 transitions
pins2lts-mc-linux64( 1/ 8), 4.033: ~1 levels ~7680 states ~49368 transitions
pins2lts-mc-linux64( 1/ 8), 4.959: ~1 levels ~15360 states ~105168 transitions
pins2lts-mc-linux64( 1/ 8), 6.926: ~1 levels ~30720 states ~224968 transitions
pins2lts-mc-linux64( 2/ 8), 10.784: ~1 levels ~61440 states ~549976 transitions
pins2lts-mc-linux64( 7/ 8), 18.917: ~1 levels ~122880 states ~1021536 transitions
pins2lts-mc-linux64( 7/ 8), 31.339: ~1 levels ~245760 states ~2122768 transitions
pins2lts-mc-linux64( 7/ 8), 43.603: ~1 levels ~491520 states ~4447768 transitions
pins2lts-mc-linux64( 7/ 8), 58.028: ~1 levels ~983040 states ~9356768 transitions
pins2lts-mc-linux64( 7/ 8), 87.216: ~1 levels ~1966080 states ~19749392 transitions
pins2lts-mc-linux64( 7/ 8), 146.531: ~1 levels ~3932160 states ~41211200 transitions
pins2lts-mc-linux64( 2/ 8), 220.212: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 220.279:
pins2lts-mc-linux64( 0/ 8), 220.279: mean standard work distribution: 7.6% (states) 7.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 220.279:
pins2lts-mc-linux64( 0/ 8), 220.279: Explored 5842577 states 66442826 transitions, fanout: 11.372
pins2lts-mc-linux64( 0/ 8), 220.279: Total exploration time 219.440 sec (219.320 sec minimum, 219.371 sec on average)
pins2lts-mc-linux64( 0/ 8), 220.279: States per second: 26625, Transitions per second: 302784
pins2lts-mc-linux64( 0/ 8), 220.279:
pins2lts-mc-linux64( 0/ 8), 220.279: Progress states detected: 11371085
pins2lts-mc-linux64( 0/ 8), 220.279: Redundant explorations: -48.6194
pins2lts-mc-linux64( 0/ 8), 220.279:
pins2lts-mc-linux64( 0/ 8), 220.279: Queue width: 8B, total height: 9618404, memory: 73.38MB
pins2lts-mc-linux64( 0/ 8), 220.279: Tree memory: 342.8MB, 31.6 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 220.279: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 220.279: Stored 569 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 220.279: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 220.279: Est. total memory use: 416.1MB (~1097.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14163181023286089383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14163181023286089383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 04:07:58] [INFO ] Applying decomposition
[2024-05-29 04:07:59] [INFO ] Flatten gal took : 301 ms
[2024-05-29 04:08:01] [INFO ] Decomposing Gal with order
[2024-05-29 04:08:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:08:01] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-29 04:08:03] [INFO ] Flatten gal took : 1999 ms
[2024-05-29 04:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 110 ms.
[2024-05-29 04:08:03] [INFO ] Time to serialize gal into /tmp/LTLFireability16475102506435634598.gal : 106 ms
[2024-05-29 04:08:03] [INFO ] Time to serialize properties into /tmp/LTLFireability5671968264822257443.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16475102506435634598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5671968264822257443.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((u17.p32==0)||(u20.p38==0))||((u21.p40==0)||((i106.u135.p255==1)&&(u140.p266==1))))")||(X("(((u17.p32==1)&&(u20.p38==1))&&(u2...171
Formula 0 simplified : F(!"(((u17.p32==0)||(u20.p38==0))||((u21.p40==0)||((i106.u135.p255==1)&&(u140.p266==1))))" & X!"(((u17.p32==1)&&(u20.p38==1))&&(u21....165
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2401 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,24.1384,756104,1,0,1.62945e+06,1099,8917,2.76386e+06,45,805,2907226
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1759736 ms.
BK_STOP 1716955715983
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-040A, 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 r373-tall-171683788700193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A 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 '
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 ;