About the Execution of ITS-Tools for ShieldPPPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6706.731 | 788181.00 | 1973189.00 | 2041.50 | TTTFFTTFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800675.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800675
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 7.8K Feb 25 21:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 21:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 337K Mar 5 18:23 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 ShieldPPPt-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679220645699
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 10:10:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:10:49] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-19 10:10:49] [INFO ] Transformed 1253 places.
[2023-03-19 10:10:49] [INFO ] Transformed 903 transitions.
[2023-03-19 10:10:49] [INFO ] Found NUPN structural information;
[2023-03-19 10:10:49] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 181 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-19 10:10:49] [INFO ] Computed 551 place invariants in 15 ms
[2023-03-19 10:10:51] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-19 10:10:51] [INFO ] Invariant cache hit.
[2023-03-19 10:10:53] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 4086 ms to find 0 implicit places.
[2023-03-19 10:10:53] [INFO ] Invariant cache hit.
[2023-03-19 10:10:54] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5011 ms. Remains : 1253/1253 places, 902/902 transitions.
Support contains 22 out of 1253 places after structural reductions.
[2023-03-19 10:10:54] [INFO ] Flatten gal took : 161 ms
[2023-03-19 10:10:54] [INFO ] Flatten gal took : 71 ms
[2023-03-19 10:10:55] [INFO ] Input system was already deterministic with 902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 10:10:56] [INFO ] Invariant cache hit.
[2023-03-19 10:10:57] [INFO ] [Real]Absence check using 551 positive place invariants in 117 ms returned sat
[2023-03-19 10:10:58] [INFO ] After 1309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-19 10:10:58] [INFO ] After 1428ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:10:58] [INFO ] After 2306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:10:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 118 ms returned sat
[2023-03-19 10:11:00] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 10:11:01] [INFO ] After 1820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 602 ms.
[2023-03-19 10:11:02] [INFO ] After 3506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 478 ms.
Support contains 15 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 192 times.
Drop transitions removed 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 196 place count 1251 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 197 place count 1250 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 198 place count 1249 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 198 place count 1249 transition count 897
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 1247 transition count 897
Applied a total of 202 rules in 412 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 1247/1253 places, 897/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 897 rows 1247 cols
[2023-03-19 10:11:04] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:11:04] [INFO ] [Real]Absence check using 550 positive place invariants in 241 ms returned sat
[2023-03-19 10:11:06] [INFO ] After 2337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 10:11:07] [INFO ] [Nat]Absence check using 550 positive place invariants in 269 ms returned sat
[2023-03-19 10:11:08] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 10:11:08] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-19 10:11:08] [INFO ] After 483ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 10:11:08] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2023-03-19 10:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-19 10:11:09] [INFO ] After 1478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-03-19 10:11:09] [INFO ] After 3421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 261 ms.
Support contains 11 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 33 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1247/1247 places, 897/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 80568 steps, run timeout after 3004 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 4=1, 5=1}
Probabilistic random walk after 80568 steps, saw 77491 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :4
Running SMT prover for 2 properties.
[2023-03-19 10:11:14] [INFO ] Invariant cache hit.
[2023-03-19 10:11:14] [INFO ] [Real]Absence check using 550 positive place invariants in 141 ms returned sat
[2023-03-19 10:11:15] [INFO ] After 639ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 10:11:15] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-19 10:11:15] [INFO ] After 90ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 10:11:15] [INFO ] After 1317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 10:11:16] [INFO ] [Nat]Absence check using 550 positive place invariants in 199 ms returned sat
[2023-03-19 10:11:17] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 10:11:17] [INFO ] After 205ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 10:11:17] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-19 10:11:18] [INFO ] After 2340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 39 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1247/1247 places, 897/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Finished probabilistic random walk after 87200 steps, run visited all 2 properties in 1687 ms. (steps per millisecond=51 )
Probabilistic random walk after 87200 steps, saw 84021 distinct states, run finished after 1689 ms. (steps per millisecond=51 ) properties seen :2
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||X(F(p1))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 132 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-19 10:11:20] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-19 10:11:21] [INFO ] Implicit Places using invariants in 874 ms returned []
[2023-03-19 10:11:21] [INFO ] Invariant cache hit.
[2023-03-19 10:11:24] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 3460 ms to find 0 implicit places.
[2023-03-19 10:11:24] [INFO ] Invariant cache hit.
[2023-03-19 10:11:25] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4646 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s507 1) (OR (EQ s479 0) (EQ s731 1))), p1:(OR (EQ s479 0) (EQ s731 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2901 ms.
Product exploration explored 100000 steps with 50000 reset in 2833 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) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 1017 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-01 finished in 11903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 57 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-19 10:11:32] [INFO ] Invariant cache hit.
[2023-03-19 10:11:33] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2023-03-19 10:11:33] [INFO ] Invariant cache hit.
[2023-03-19 10:11:36] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 4015 ms to find 0 implicit places.
[2023-03-19 10:11:36] [INFO ] Invariant cache hit.
[2023-03-19 10:11:37] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4798 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s292 0) (EQ s824 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2725 ms.
Product exploration explored 100000 steps with 50000 reset in 2792 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-02 finished in 10580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-19 10:11:42] [INFO ] Invariant cache hit.
[2023-03-19 10:11:43] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2023-03-19 10:11:43] [INFO ] Invariant cache hit.
[2023-03-19 10:11:45] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
[2023-03-19 10:11:46] [INFO ] Invariant cache hit.
[2023-03-19 10:11:46] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3815 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-03 finished in 4006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-19 10:11:46] [INFO ] Invariant cache hit.
[2023-03-19 10:11:47] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-03-19 10:11:47] [INFO ] Invariant cache hit.
[2023-03-19 10:11:51] [INFO ] Implicit Places using invariants and state equation in 3542 ms returned []
Implicit Place search using SMT with State Equation took 4619 ms to find 0 implicit places.
[2023-03-19 10:11:51] [INFO ] Invariant cache hit.
[2023-03-19 10:11:52] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5552 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s508 0) (EQ s863 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-07 finished in 5786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(p1)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 25 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-19 10:11:52] [INFO ] Invariant cache hit.
[2023-03-19 10:11:53] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-19 10:11:53] [INFO ] Invariant cache hit.
[2023-03-19 10:11:56] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 3538 ms to find 0 implicit places.
[2023-03-19 10:11:56] [INFO ] Invariant cache hit.
[2023-03-19 10:11:57] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4419 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s288 0) (EQ s1137 1)), p1:(OR (EQ s912 0) (EQ s619 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 33386 reset in 2101 ms.
Product exploration explored 100000 steps with 33370 reset in 2241 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 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 706 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 151397 steps, run timeout after 3002 ms. (steps per millisecond=50 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 151397 steps, saw 150080 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-19 10:12:06] [INFO ] Invariant cache hit.
[2023-03-19 10:12:06] [INFO ] [Real]Absence check using 551 positive place invariants in 102 ms returned sat
[2023-03-19 10:12:07] [INFO ] After 888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 124 ms returned sat
[2023-03-19 10:12:08] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:08] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-19 10:12:08] [INFO ] After 1225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 200 place count 1251 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 201 place count 1250 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 202 place count 1249 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 202 place count 1249 transition count 897
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 206 place count 1247 transition count 897
Applied a total of 206 rules in 225 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 1247/1253 places, 897/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251131 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251131 steps, saw 240658 distinct states, run finished after 3004 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 1247 cols
[2023-03-19 10:12:11] [INFO ] Computed 550 place invariants in 21 ms
[2023-03-19 10:12:12] [INFO ] [Real]Absence check using 550 positive place invariants in 116 ms returned sat
[2023-03-19 10:12:12] [INFO ] After 483ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:12:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-19 10:12:12] [INFO ] After 100ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:12] [INFO ] After 1191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:13] [INFO ] [Nat]Absence check using 550 positive place invariants in 116 ms returned sat
[2023-03-19 10:12:13] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:13] [INFO ] After 110ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:13] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-19 10:12:14] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 63 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1247/1247 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 131 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2023-03-19 10:12:14] [INFO ] Invariant cache hit.
[2023-03-19 10:12:15] [INFO ] Implicit Places using invariants in 994 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 997 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1245/1247 places, 897/897 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1243 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 61 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2023-03-19 10:12:15] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-19 10:12:16] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-19 10:12:16] [INFO ] Invariant cache hit.
[2023-03-19 10:12:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 10:12:18] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1243/1247 places, 895/897 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4757 ms. Remains : 1243/1247 places, 895/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221684 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221684 steps, saw 212864 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:12:22] [INFO ] Invariant cache hit.
[2023-03-19 10:12:22] [INFO ] [Real]Absence check using 548 positive place invariants in 171 ms returned sat
[2023-03-19 10:12:23] [INFO ] After 1017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 101 ms returned sat
[2023-03-19 10:12:23] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:23] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 10:12:24] [INFO ] After 130ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:24] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-19 10:12:24] [INFO ] After 1292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 61 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1243/1243 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 36 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:12:24] [INFO ] Invariant cache hit.
[2023-03-19 10:12:25] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-19 10:12:25] [INFO ] Invariant cache hit.
[2023-03-19 10:12:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 10:12:28] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
[2023-03-19 10:12:28] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-19 10:12:28] [INFO ] Invariant cache hit.
[2023-03-19 10:12:28] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4343 ms. Remains : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 10:12:28] [INFO ] Invariant cache hit.
[2023-03-19 10:12:29] [INFO ] [Real]Absence check using 548 positive place invariants in 96 ms returned sat
[2023-03-19 10:12:29] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2023-03-19 10:12:30] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:30] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-19 10:12:30] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-19 10:12:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-19 10:12:31] [INFO ] After 1030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-19 10:12:31] [INFO ] After 1399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 852 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 314 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 70 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-19 10:12:32] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-19 10:12:33] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-19 10:12:33] [INFO ] Invariant cache hit.
[2023-03-19 10:12:35] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
[2023-03-19 10:12:35] [INFO ] Invariant cache hit.
[2023-03-19 10:12:38] [INFO ] Dead Transitions using invariants and state equation in 3536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6422 ms. Remains : 1253/1253 places, 902/902 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 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 769 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 106747 steps, run timeout after 3003 ms. (steps per millisecond=35 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 106747 steps, saw 105750 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-19 10:12:43] [INFO ] Invariant cache hit.
[2023-03-19 10:12:44] [INFO ] [Real]Absence check using 551 positive place invariants in 322 ms returned sat
[2023-03-19 10:12:45] [INFO ] After 1442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:12:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 555 ms returned sat
[2023-03-19 10:12:47] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:12:47] [INFO ] After 909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-19 10:12:47] [INFO ] After 1790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 700 steps, including 10 resets, run visited all 1 properties in 9 ms. (steps per millisecond=77 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 856 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33257 reset in 2303 ms.
Product exploration explored 100000 steps with 33538 reset in 2292 ms.
Built C files in :
/tmp/ltsmin18266099970509158425
[2023-03-19 10:12:53] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18266099970509158425
Running compilation step : cd /tmp/ltsmin18266099970509158425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1855 ms.
Running link step : cd /tmp/ltsmin18266099970509158425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin18266099970509158425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9541487454184677802.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 65 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2023-03-19 10:13:08] [INFO ] Invariant cache hit.
[2023-03-19 10:13:09] [INFO ] Implicit Places using invariants in 805 ms returned []
[2023-03-19 10:13:09] [INFO ] Invariant cache hit.
[2023-03-19 10:13:11] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2707 ms to find 0 implicit places.
[2023-03-19 10:13:11] [INFO ] Invariant cache hit.
[2023-03-19 10:13:12] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3439 ms. Remains : 1253/1253 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin12549856772339074929
[2023-03-19 10:13:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12549856772339074929
Running compilation step : cd /tmp/ltsmin12549856772339074929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1833 ms.
Running link step : cd /tmp/ltsmin12549856772339074929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12549856772339074929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7179093292490037847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 10:13:27] [INFO ] Flatten gal took : 53 ms
[2023-03-19 10:13:27] [INFO ] Flatten gal took : 51 ms
[2023-03-19 10:13:27] [INFO ] Time to serialize gal into /tmp/LTL1427528528855253009.gal : 11 ms
[2023-03-19 10:13:27] [INFO ] Time to serialize properties into /tmp/LTL15254064633791521975.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1427528528855253009.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2835422750935219157.hoa' '-atoms' '/tmp/LTL15254064633791521975.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15254064633791521975.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2835422750935219157.hoa
Detected timeout of ITS tools.
[2023-03-19 10:13:42] [INFO ] Flatten gal took : 62 ms
[2023-03-19 10:13:42] [INFO ] Flatten gal took : 45 ms
[2023-03-19 10:13:42] [INFO ] Time to serialize gal into /tmp/LTL4889447880956728522.gal : 5 ms
[2023-03-19 10:13:42] [INFO ] Time to serialize properties into /tmp/LTL13140178426666231233.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4889447880956728522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13140178426666231233.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((p288==0)||(p1137==1))"))U(X("((p912==0)||(p619==1))"))))))
Formula 0 simplified : GF("((p288==0)||(p1137==1))" R X!"((p912==0)||(p619==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 10:13:58] [INFO ] Flatten gal took : 130 ms
[2023-03-19 10:13:58] [INFO ] Applying decomposition
[2023-03-19 10:13:58] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11118727254969322244.txt' '-o' '/tmp/graph11118727254969322244.bin' '-w' '/tmp/graph11118727254969322244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11118727254969322244.bin' '-l' '-1' '-v' '-w' '/tmp/graph11118727254969322244.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:13:58] [INFO ] Decomposing Gal with order
[2023-03-19 10:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:13:58] [INFO ] Removed a total of 150 redundant transitions.
[2023-03-19 10:13:58] [INFO ] Flatten gal took : 116 ms
[2023-03-19 10:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 86 ms.
[2023-03-19 10:13:58] [INFO ] Time to serialize gal into /tmp/LTL9209444530736208593.gal : 19 ms
[2023-03-19 10:13:58] [INFO ] Time to serialize properties into /tmp/LTL1137843251782867998.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9209444530736208593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1137843251782867998.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((i5.u91.p288==0)||(i20.u363.p1137==1))"))U(X("((i16.u291.p912==0)||(i10.u196.p619==1))"))))))
Formula 0 simplified : GF("((i5.u91.p288==0)||(i20.u363.p1137==1))" R X!"((i16.u291.p912==0)||(i10.u196.p619==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin701652048038344859
[2023-03-19 10:14:13] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin701652048038344859
Running compilation step : cd /tmp/ltsmin701652048038344859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1808 ms.
Running link step : cd /tmp/ltsmin701652048038344859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin701652048038344859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((!(LTLAPp0==true) U X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-10 finished in 156374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 143 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2023-03-19 10:14:29] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 10:14:30] [INFO ] Implicit Places using invariants in 989 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 991 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 48 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2023-03-19 10:14:30] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-19 10:14:31] [INFO ] Implicit Places using invariants in 895 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 909 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 87 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2023-03-19 10:14:31] [INFO ] Computed 548 place invariants in 6 ms
[2023-03-19 10:14:32] [INFO ] Implicit Places using invariants in 931 ms returned []
[2023-03-19 10:14:32] [INFO ] Invariant cache hit.
[2023-03-19 10:14:33] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4976 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s359 0) (EQ s477 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 863 ms.
Product exploration explored 100000 steps with 0 reset in 991 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
[2023-03-19 10:14:36] [INFO ] Invariant cache hit.
[2023-03-19 10:14:37] [INFO ] [Real]Absence check using 548 positive place invariants in 264 ms returned sat
[2023-03-19 10:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:14:38] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-19 10:14:38] [INFO ] Computed and/alt/rep : 895/2787/895 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-19 10:14:38] [INFO ] Added : 0 causal constraints over 0 iterations in 253 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 54 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-19 10:14:38] [INFO ] Invariant cache hit.
[2023-03-19 10:14:39] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2023-03-19 10:14:39] [INFO ] Invariant cache hit.
[2023-03-19 10:14:41] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
[2023-03-19 10:14:41] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 10:14:41] [INFO ] Invariant cache hit.
[2023-03-19 10:14:42] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3595 ms. Remains : 1244/1244 places, 896/896 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
[2023-03-19 10:14:42] [INFO ] Invariant cache hit.
[2023-03-19 10:14:44] [INFO ] [Real]Absence check using 548 positive place invariants in 203 ms returned sat
[2023-03-19 10:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:14:44] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-19 10:14:44] [INFO ] Computed and/alt/rep : 895/2787/895 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-19 10:14:44] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 829 ms.
Product exploration explored 100000 steps with 0 reset in 1015 ms.
Built C files in :
/tmp/ltsmin877789450401676994
[2023-03-19 10:14:46] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2023-03-19 10:14:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:46] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2023-03-19 10:14:46] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:46] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2023-03-19 10:14:47] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:47] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin877789450401676994
Running compilation step : cd /tmp/ltsmin877789450401676994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin877789450401676994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin877789450401676994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 63 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-19 10:14:50] [INFO ] Invariant cache hit.
[2023-03-19 10:14:51] [INFO ] Implicit Places using invariants in 869 ms returned []
[2023-03-19 10:14:51] [INFO ] Invariant cache hit.
[2023-03-19 10:14:52] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2023-03-19 10:14:52] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 10:14:52] [INFO ] Invariant cache hit.
[2023-03-19 10:14:53] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3494 ms. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin3730202151758352604
[2023-03-19 10:14:53] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2023-03-19 10:14:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:53] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2023-03-19 10:14:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:53] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2023-03-19 10:14:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:53] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3730202151758352604
Running compilation step : cd /tmp/ltsmin3730202151758352604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2476 ms.
Running link step : cd /tmp/ltsmin3730202151758352604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin3730202151758352604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4587612950370410432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 10:15:08] [INFO ] Flatten gal took : 49 ms
[2023-03-19 10:15:08] [INFO ] Flatten gal took : 47 ms
[2023-03-19 10:15:08] [INFO ] Time to serialize gal into /tmp/LTL12819422966416520420.gal : 6 ms
[2023-03-19 10:15:08] [INFO ] Time to serialize properties into /tmp/LTL8578680413760460418.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12819422966416520420.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8714201534303779934.hoa' '-atoms' '/tmp/LTL8578680413760460418.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8578680413760460418.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8714201534303779934.hoa
Detected timeout of ITS tools.
[2023-03-19 10:15:23] [INFO ] Flatten gal took : 53 ms
[2023-03-19 10:15:24] [INFO ] Flatten gal took : 57 ms
[2023-03-19 10:15:24] [INFO ] Time to serialize gal into /tmp/LTL33321697419532141.gal : 7 ms
[2023-03-19 10:15:24] [INFO ] Time to serialize properties into /tmp/LTL2515829012281326805.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL33321697419532141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2515829012281326805.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((F(G("((p359==0)&&(p477==1))"))))
Formula 0 simplified : GF!"((p359==0)&&(p477==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 10:15:39] [INFO ] Flatten gal took : 39 ms
[2023-03-19 10:15:39] [INFO ] Applying decomposition
[2023-03-19 10:15:39] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2912197451088161893.txt' '-o' '/tmp/graph2912197451088161893.bin' '-w' '/tmp/graph2912197451088161893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2912197451088161893.bin' '-l' '-1' '-v' '-w' '/tmp/graph2912197451088161893.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:15:39] [INFO ] Decomposing Gal with order
[2023-03-19 10:15:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:15:39] [INFO ] Removed a total of 149 redundant transitions.
[2023-03-19 10:15:39] [INFO ] Flatten gal took : 49 ms
[2023-03-19 10:15:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 34 ms.
[2023-03-19 10:15:39] [INFO ] Time to serialize gal into /tmp/LTL13002224955445464821.gal : 10 ms
[2023-03-19 10:15:39] [INFO ] Time to serialize properties into /tmp/LTL15715007752650785181.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13002224955445464821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15715007752650785181.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i6.u114.p359==0)&&(i8.u152.p477==1))"))))
Formula 0 simplified : GF!"((i6.u114.p359==0)&&(i8.u152.p477==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin873005938162787026
[2023-03-19 10:15:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin873005938162787026
Running compilation step : cd /tmp/ltsmin873005938162787026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1673 ms.
Running link step : cd /tmp/ltsmin873005938162787026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin873005938162787026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-12 finished in 100708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
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 9 place count 1247 transition count 897
Applied a total of 9 rules in 198 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2023-03-19 10:16:09] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-19 10:16:10] [INFO ] Implicit Places using invariants in 845 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 860 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 73 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2023-03-19 10:16:10] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-19 10:16:12] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2023-03-19 10:16:12] [INFO ] Invariant cache hit.
[2023-03-19 10:16:14] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 3207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4338 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s840 0) (NEQ s1008 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 2 reset in 798 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-13 finished in 5234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
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 9 place count 1247 transition count 897
Applied a total of 9 rules in 122 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2023-03-19 10:16:15] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:16:17] [INFO ] Implicit Places using invariants in 1944 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1947 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 138 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2023-03-19 10:16:17] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:16:18] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-19 10:16:18] [INFO ] Invariant cache hit.
[2023-03-19 10:16:19] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4700 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s585 0) (EQ s966 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 749 ms.
Product exploration explored 100000 steps with 0 reset in 977 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27102 steps, run visited all 1 properties in 282 ms. (steps per millisecond=96 )
Probabilistic random walk after 27102 steps, saw 26522 distinct states, run finished after 282 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 69 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:16:22] [INFO ] Invariant cache hit.
[2023-03-19 10:16:24] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2023-03-19 10:16:24] [INFO ] Invariant cache hit.
[2023-03-19 10:16:28] [INFO ] Implicit Places using invariants and state equation in 3810 ms returned []
Implicit Place search using SMT with State Equation took 5498 ms to find 0 implicit places.
[2023-03-19 10:16:28] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 10:16:28] [INFO ] Invariant cache hit.
[2023-03-19 10:16:28] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6252 ms. Remains : 1243/1243 places, 895/895 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27102 steps, run visited all 1 properties in 280 ms. (steps per millisecond=96 )
Probabilistic random walk after 27102 steps, saw 26522 distinct states, run finished after 280 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 837 ms.
Product exploration explored 100000 steps with 0 reset in 1038 ms.
Built C files in :
/tmp/ltsmin15461817494189371795
[2023-03-19 10:16:31] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2023-03-19 10:16:31] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:31] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2023-03-19 10:16:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:32] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2023-03-19 10:16:32] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:32] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15461817494189371795
Running compilation step : cd /tmp/ltsmin15461817494189371795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2566 ms.
Running link step : cd /tmp/ltsmin15461817494189371795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin15461817494189371795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2604207393347672264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:16:46] [INFO ] Invariant cache hit.
[2023-03-19 10:16:47] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-19 10:16:47] [INFO ] Invariant cache hit.
[2023-03-19 10:16:49] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2023-03-19 10:16:49] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 10:16:49] [INFO ] Invariant cache hit.
[2023-03-19 10:16:50] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3764 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin17107203352616864193
[2023-03-19 10:16:50] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2023-03-19 10:16:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:50] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2023-03-19 10:16:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:50] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2023-03-19 10:16:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:16:50] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17107203352616864193
Running compilation step : cd /tmp/ltsmin17107203352616864193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2520 ms.
Running link step : cd /tmp/ltsmin17107203352616864193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17107203352616864193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6128941301089182077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 10:17:05] [INFO ] Flatten gal took : 29 ms
[2023-03-19 10:17:05] [INFO ] Flatten gal took : 27 ms
[2023-03-19 10:17:05] [INFO ] Time to serialize gal into /tmp/LTL12050934799416693867.gal : 5 ms
[2023-03-19 10:17:05] [INFO ] Time to serialize properties into /tmp/LTL8606131257328832242.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12050934799416693867.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11953811205309200320.hoa' '-atoms' '/tmp/LTL8606131257328832242.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8606131257328832242.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11953811205309200320.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 10:17:20] [INFO ] Flatten gal took : 29 ms
[2023-03-19 10:17:20] [INFO ] Flatten gal took : 38 ms
[2023-03-19 10:17:20] [INFO ] Time to serialize gal into /tmp/LTL1783029632243038517.gal : 8 ms
[2023-03-19 10:17:20] [INFO ] Time to serialize properties into /tmp/LTL10189896087824920693.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1783029632243038517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10189896087824920693.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p586==0)||(p967==1))"))))
Formula 0 simplified : GF!"((p586==0)||(p967==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 10:17:36] [INFO ] Flatten gal took : 85 ms
[2023-03-19 10:17:36] [INFO ] Applying decomposition
[2023-03-19 10:17:36] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9237254161091747730.txt' '-o' '/tmp/graph9237254161091747730.bin' '-w' '/tmp/graph9237254161091747730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9237254161091747730.bin' '-l' '-1' '-v' '-w' '/tmp/graph9237254161091747730.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:17:36] [INFO ] Decomposing Gal with order
[2023-03-19 10:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:17:36] [INFO ] Removed a total of 149 redundant transitions.
[2023-03-19 10:17:36] [INFO ] Flatten gal took : 42 ms
[2023-03-19 10:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2023-03-19 10:17:36] [INFO ] Time to serialize gal into /tmp/LTL15086848529471847072.gal : 8 ms
[2023-03-19 10:17:36] [INFO ] Time to serialize properties into /tmp/LTL3343150829027484479.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15086848529471847072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3343150829027484479.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i11.u187.p586==0)||(i18.u308.p967==1))"))))
Formula 0 simplified : GF!"((i11.u187.p586==0)||(i18.u308.p967==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin761551010692210437
[2023-03-19 10:17:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin761551010692210437
Running compilation step : cd /tmp/ltsmin761551010692210437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1703 ms.
Running link step : cd /tmp/ltsmin761551010692210437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin761551010692210437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-14 finished in 111640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (!p1||X(F(p0)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 64 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-19 10:18:06] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-19 10:18:07] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2023-03-19 10:18:07] [INFO ] Invariant cache hit.
[2023-03-19 10:18:09] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2940 ms to find 0 implicit places.
[2023-03-19 10:18:09] [INFO ] Invariant cache hit.
[2023-03-19 10:18:10] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3807 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s431 0) (EQ s194 1)), p1:(OR (EQ s902 0) (EQ s858 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3052 ms.
Product exploration explored 100000 steps with 50000 reset in 3096 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 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-15 finished in 10314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(p1)))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-050A-LTLCardinality-10
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
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 9 place count 1247 transition count 897
Applied a total of 9 rules in 184 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2023-03-19 10:18:17] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-19 10:18:18] [INFO ] Implicit Places using invariants in 796 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 798 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 71 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2023-03-19 10:18:18] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-19 10:18:18] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-19 10:18:18] [INFO ] Invariant cache hit.
[2023-03-19 10:18:21] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3932 ms. Remains : 1243/1253 places, 895/902 transitions.
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s287 0) (EQ s1136 1)), p1:(OR (EQ s911 0) (EQ s618 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33295 reset in 1051 ms.
Product exploration explored 100000 steps with 33461 reset in 1205 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 634 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 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 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 130872 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 130872 steps, saw 129657 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-19 10:18:27] [INFO ] Invariant cache hit.
[2023-03-19 10:18:28] [INFO ] [Real]Absence check using 548 positive place invariants in 105 ms returned sat
[2023-03-19 10:18:28] [INFO ] After 579ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:18:29] [INFO ] After 764ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-19 10:18:29] [INFO ] After 1269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:18:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 117 ms returned sat
[2023-03-19 10:18:30] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:18:30] [INFO ] After 948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 10:18:30] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 50 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1243/1243 places, 895/895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226636 steps, run timeout after 3002 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226636 steps, saw 224955 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:18:33] [INFO ] Invariant cache hit.
[2023-03-19 10:18:34] [INFO ] [Real]Absence check using 548 positive place invariants in 133 ms returned sat
[2023-03-19 10:18:35] [INFO ] After 955ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:18:35] [INFO ] After 1063ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-19 10:18:35] [INFO ] After 1815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:18:36] [INFO ] [Nat]Absence check using 548 positive place invariants in 95 ms returned sat
[2023-03-19 10:18:36] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:18:37] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 10:18:37] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 58 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1243/1243 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 62 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:18:37] [INFO ] Invariant cache hit.
[2023-03-19 10:18:38] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-19 10:18:38] [INFO ] Invariant cache hit.
[2023-03-19 10:18:39] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-03-19 10:18:40] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 10:18:40] [INFO ] Invariant cache hit.
[2023-03-19 10:18:40] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3526 ms. Remains : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 38 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 10:18:40] [INFO ] Invariant cache hit.
[2023-03-19 10:18:41] [INFO ] [Real]Absence check using 548 positive place invariants in 164 ms returned sat
[2023-03-19 10:18:41] [INFO ] After 528ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:18:41] [INFO ] After 615ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 10:18:41] [INFO ] After 1179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:18:42] [INFO ] [Nat]Absence check using 548 positive place invariants in 99 ms returned sat
[2023-03-19 10:18:42] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:18:42] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-19 10:18:42] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 637 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 76 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:18:44] [INFO ] Invariant cache hit.
[2023-03-19 10:18:44] [INFO ] Implicit Places using invariants in 810 ms returned []
[2023-03-19 10:18:44] [INFO ] Invariant cache hit.
[2023-03-19 10:18:46] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-19 10:18:46] [INFO ] Invariant cache hit.
[2023-03-19 10:18:47] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3456 ms. Remains : 1243/1243 places, 895/895 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 555 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 124288 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 124288 steps, saw 123122 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-19 10:18:52] [INFO ] Invariant cache hit.
[2023-03-19 10:18:52] [INFO ] [Real]Absence check using 548 positive place invariants in 135 ms returned sat
[2023-03-19 10:18:53] [INFO ] After 721ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:18:53] [INFO ] After 805ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 10:18:53] [INFO ] After 1457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:18:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2023-03-19 10:18:54] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:18:54] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-19 10:18:54] [INFO ] After 964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 64 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1243/1243 places, 895/895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 255950 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255950 steps, saw 253786 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:18:57] [INFO ] Invariant cache hit.
[2023-03-19 10:18:58] [INFO ] [Real]Absence check using 548 positive place invariants in 101 ms returned sat
[2023-03-19 10:18:58] [INFO ] After 603ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:18:58] [INFO ] After 697ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-19 10:18:59] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:18:59] [INFO ] [Nat]Absence check using 548 positive place invariants in 92 ms returned sat
[2023-03-19 10:18:59] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:19:00] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-19 10:19:00] [INFO ] After 1169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 52 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1243/1243 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 39 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:19:00] [INFO ] Invariant cache hit.
[2023-03-19 10:19:01] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-19 10:19:01] [INFO ] Invariant cache hit.
[2023-03-19 10:19:03] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2686 ms to find 0 implicit places.
[2023-03-19 10:19:03] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 10:19:03] [INFO ] Invariant cache hit.
[2023-03-19 10:19:03] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3357 ms. Remains : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 42 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 10:19:03] [INFO ] Invariant cache hit.
[2023-03-19 10:19:04] [INFO ] [Real]Absence check using 548 positive place invariants in 86 ms returned sat
[2023-03-19 10:19:04] [INFO ] After 513ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 10:19:04] [INFO ] After 598ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-19 10:19:04] [INFO ] After 1035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:19:05] [INFO ] [Nat]Absence check using 548 positive place invariants in 115 ms returned sat
[2023-03-19 10:19:05] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:19:05] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-19 10:19:05] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33336 reset in 1113 ms.
Product exploration explored 100000 steps with 33343 reset in 1117 ms.
Built C files in :
/tmp/ltsmin15880405778450820383
[2023-03-19 10:19:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15880405778450820383
Running compilation step : cd /tmp/ltsmin15880405778450820383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1757 ms.
Running link step : cd /tmp/ltsmin15880405778450820383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin15880405778450820383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17874733593949339399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 47 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-19 10:19:24] [INFO ] Invariant cache hit.
[2023-03-19 10:19:25] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-19 10:19:25] [INFO ] Invariant cache hit.
[2023-03-19 10:19:27] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
[2023-03-19 10:19:27] [INFO ] Invariant cache hit.
[2023-03-19 10:19:28] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3386 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin4098632386795118607
[2023-03-19 10:19:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4098632386795118607
Running compilation step : cd /tmp/ltsmin4098632386795118607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1657 ms.
Running link step : cd /tmp/ltsmin4098632386795118607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin4098632386795118607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6549200903963762676.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 10:19:43] [INFO ] Flatten gal took : 35 ms
[2023-03-19 10:19:43] [INFO ] Flatten gal took : 27 ms
[2023-03-19 10:19:43] [INFO ] Time to serialize gal into /tmp/LTL15736609483431518528.gal : 4 ms
[2023-03-19 10:19:43] [INFO ] Time to serialize properties into /tmp/LTL3942066727746649412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15736609483431518528.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16647665807419759648.hoa' '-atoms' '/tmp/LTL3942066727746649412.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3942066727746649412.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16647665807419759648.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
1236 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,12.4758,301544,1,0,21,2.05162e+06,31,6,29012,536515,62
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-10 finished in 101427 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 10:19:58] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2043500302745842861
[2023-03-19 10:19:58] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2023-03-19 10:19:59] [INFO ] Applying decomposition
[2023-03-19 10:19:59] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:19:59] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2023-03-19 10:19:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:19:59] [INFO ] Flatten gal took : 49 ms
[2023-03-19 10:19:59] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
[2023-03-19 10:19:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:19:59] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2043500302745842861
Running compilation step : cd /tmp/ltsmin2043500302745842861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16535042476616677922.txt' '-o' '/tmp/graph16535042476616677922.bin' '-w' '/tmp/graph16535042476616677922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16535042476616677922.bin' '-l' '-1' '-v' '-w' '/tmp/graph16535042476616677922.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:19:59] [INFO ] Decomposing Gal with order
[2023-03-19 10:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:19:59] [INFO ] Removed a total of 150 redundant transitions.
[2023-03-19 10:19:59] [INFO ] Flatten gal took : 56 ms
[2023-03-19 10:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 53 ms.
[2023-03-19 10:19:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality17817805356641884913.gal : 14 ms
[2023-03-19 10:19:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality9430113468824870481.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17817805356641884913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9430113468824870481.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((i7.i1.i2.u114.p359==0)&&(i8.u152.p477==1))"))))
Formula 0 simplified : GF!"((i7.i1.i2.u114.p359==0)&&(i8.u152.p477==1))"
Compilation finished in 2735 ms.
Running link step : cd /tmp/ltsmin2043500302745842861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin2043500302745842861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 98533 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2043500302745842861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 132885 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 784745 ms.
BK_STOP 1679221433880
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-050A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713800675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050A.tgz
mv ShieldPPPt-PT-050A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;