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-167903713900691.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-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 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.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 685K 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-100A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679222513422

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-100A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 10:41:56] [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:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:41:56] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-19 10:41:56] [INFO ] Transformed 2503 places.
[2023-03-19 10:41:56] [INFO ] Transformed 1803 transitions.
[2023-03-19 10:41:56] [INFO ] Found NUPN structural information;
[2023-03-19 10:41:56] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 306 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:41:57] [INFO ] Computed 1101 place invariants in 45 ms
[2023-03-19 10:42:00] [INFO ] Implicit Places using invariants in 2964 ms returned []
[2023-03-19 10:42:00] [INFO ] Invariant cache hit.
[2023-03-19 10:42:02] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 5765 ms to find 0 implicit places.
[2023-03-19 10:42:02] [INFO ] Invariant cache hit.
[2023-03-19 10:42:04] [INFO ] Dead Transitions using invariants and state equation in 2133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8235 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 28 out of 2503 places after structural reductions.
[2023-03-19 10:42:05] [INFO ] Flatten gal took : 319 ms
[2023-03-19 10:42:05] [INFO ] Flatten gal took : 159 ms
[2023-03-19 10:42:05] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 10:42:08] [INFO ] Invariant cache hit.
[2023-03-19 10:42:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 425 ms returned sat
[2023-03-19 10:42:14] [INFO ] After 5717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:42:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 334 ms returned sat
[2023-03-19 10:42:18] [INFO ] After 2669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:42:21] [INFO ] After 4962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1287 ms.
[2023-03-19 10:42:22] [INFO ] After 8234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1203 ms.
Support contains 24 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 391 times.
Drop transitions removed 391 transitions
Iterating global reduction 0 with 391 rules applied. Total rules applied 395 place count 2501 transition count 1800
Applied a total of 395 rules in 450 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 103876 steps, run timeout after 6003 ms. (steps per millisecond=17 ) properties seen :{8=1}
Probabilistic random walk after 103876 steps, saw 99741 distinct states, run finished after 6006 ms. (steps per millisecond=17 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:42:32] [INFO ] Computed 1101 place invariants in 7 ms
[2023-03-19 10:42:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 343 ms returned sat
[2023-03-19 10:42:36] [INFO ] After 4237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:42:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 291 ms returned sat
[2023-03-19 10:42:41] [INFO ] After 2275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:42:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:42:42] [INFO ] After 1823ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:42:43] [INFO ] Deduced a trap composed of 7 places in 505 ms of which 1 ms to minimize.
[2023-03-19 10:42:44] [INFO ] Deduced a trap composed of 7 places in 453 ms of which 1 ms to minimize.
[2023-03-19 10:42:44] [INFO ] Deduced a trap composed of 6 places in 524 ms of which 3 ms to minimize.
[2023-03-19 10:42:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1870 ms
[2023-03-19 10:42:46] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 19 ms to minimize.
[2023-03-19 10:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 715 ms
[2023-03-19 10:42:47] [INFO ] After 6420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1538 ms.
[2023-03-19 10:42:49] [INFO ] After 12207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 736 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 1800
Applied a total of 1 rules in 250 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 58687 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58687 steps, saw 55643 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:42:54] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-19 10:42:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 589 ms returned sat
[2023-03-19 10:42:59] [INFO ] After 4829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:43:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 326 ms returned sat
[2023-03-19 10:43:04] [INFO ] After 2566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:43:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:43:06] [INFO ] After 1554ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:43:07] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 1 ms to minimize.
[2023-03-19 10:43:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-19 10:43:08] [INFO ] After 4298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1443 ms.
[2023-03-19 10:43:10] [INFO ] After 10566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 464 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 83 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 120 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-19 10:43:11] [INFO ] Invariant cache hit.
[2023-03-19 10:43:12] [INFO ] Implicit Places using invariants in 1517 ms returned []
[2023-03-19 10:43:12] [INFO ] Invariant cache hit.
[2023-03-19 10:43:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:43:22] [INFO ] Implicit Places using invariants and state equation in 9847 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11412 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 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 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 193 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:43:22] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-19 10:43:25] [INFO ] Implicit Places using invariants in 2478 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2511 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 428 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:43:25] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-19 10:43:27] [INFO ] Implicit Places using invariants in 2259 ms returned []
[2023-03-19 10:43:27] [INFO ] Invariant cache hit.
[2023-03-19 10:43:29] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 10:43:35] [INFO ] Implicit Places using invariants and state equation in 7208 ms returned []
Implicit Place search using SMT with State Equation took 9474 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 24138 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 114060 steps, run timeout after 6002 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 114060 steps, saw 109331 distinct states, run finished after 6002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-19 10:43:43] [INFO ] Invariant cache hit.
[2023-03-19 10:43:44] [INFO ] [Real]Absence check using 1098 positive place invariants in 373 ms returned sat
[2023-03-19 10:43:48] [INFO ] After 4860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:43:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 308 ms returned sat
[2023-03-19 10:43:56] [INFO ] After 6577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:43:56] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 10:43:59] [INFO ] After 3107ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:44:02] [INFO ] After 6165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2104 ms.
[2023-03-19 10:44:04] [INFO ] After 16730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 2900 steps, including 2 resets, run visited all 1 properties in 49 ms. (steps per millisecond=59 )
Parikh walk visited 11 properties in 1086 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((F(p0)&&F(G(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 255 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:44:06] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-19 10:44:08] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-19 10:44:08] [INFO ] Invariant cache hit.
[2023-03-19 10:44:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:44:13] [INFO ] Implicit Places using invariants and state equation in 4999 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6460 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 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 2500 transition count 1798
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 192 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:44:13] [INFO ] Computed 1100 place invariants in 5 ms
[2023-03-19 10:44:15] [INFO ] Implicit Places using invariants in 2256 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2259 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 179 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:44:15] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 10:44:17] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2023-03-19 10:44:17] [INFO ] Invariant cache hit.
[2023-03-19 10:44:22] [INFO ] Implicit Places using invariants and state equation in 4427 ms returned []
Implicit Place search using SMT with State Equation took 6478 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15823 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2003 0) (EQ s163 1)), p1:(AND (EQ s1628 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1691 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 2 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-00 finished in 18098 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' '!((p0 U X(G(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 121 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:44:24] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-19 10:44:26] [INFO ] Implicit Places using invariants in 1476 ms returned []
[2023-03-19 10:44:26] [INFO ] Invariant cache hit.
[2023-03-19 10:44:28] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
[2023-03-19 10:44:28] [INFO ] Invariant cache hit.
[2023-03-19 10:44:29] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4891 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1533 ms.
Product exploration explored 100000 steps with 0 reset in 1915 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 726 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71342 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71342 steps, saw 70500 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:44:37] [INFO ] Invariant cache hit.
[2023-03-19 10:44:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 359 ms returned sat
[2023-03-19 10:44:40] [INFO ] After 1748ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-19 10:44:41] [INFO ] After 2297ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:44:41] [INFO ] After 3380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:44:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 310 ms returned sat
[2023-03-19 10:44:44] [INFO ] After 2210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:44:45] [INFO ] After 3051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 589 ms.
[2023-03-19 10:44:46] [INFO ] After 4836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1725 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 232 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71485 steps, run timeout after 3028 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71485 steps, saw 68072 distinct states, run finished after 3028 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:44:52] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-19 10:44:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 251 ms returned sat
[2023-03-19 10:44:54] [INFO ] After 2558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:44:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 901 ms returned sat
[2023-03-19 10:45:01] [INFO ] After 4854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:45:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-19 10:45:05] [INFO ] After 3763ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:45:08] [INFO ] After 6874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11460 ms.
[2023-03-19 10:45:19] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6609 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-19 10:45:26] [INFO ] Invariant cache hit.
[2023-03-19 10:45:28] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2023-03-19 10:45:28] [INFO ] Invariant cache hit.
[2023-03-19 10:45:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-19 10:45:37] [INFO ] Implicit Places using invariants and state equation in 9270 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10883 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 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 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 154 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:45:37] [INFO ] Computed 1100 place invariants in 11 ms
[2023-03-19 10:45:40] [INFO ] Implicit Places using invariants in 2737 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2742 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 226 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:45:40] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 10:45:42] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2023-03-19 10:45:42] [INFO ] Invariant cache hit.
[2023-03-19 10:45:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:45:52] [INFO ] Implicit Places using invariants and state equation in 10497 ms returned []
Implicit Place search using SMT with State Equation took 12599 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 26683 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67205 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67205 steps, saw 63913 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:45:56] [INFO ] Invariant cache hit.
[2023-03-19 10:45:57] [INFO ] [Real]Absence check using 1098 positive place invariants in 348 ms returned sat
[2023-03-19 10:45:59] [INFO ] After 2648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:46:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 267 ms returned sat
[2023-03-19 10:46:04] [INFO ] After 3696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:46:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:46:08] [INFO ] After 3718ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:46:09] [INFO ] After 5189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1172 ms.
[2023-03-19 10:46:10] [INFO ] After 11030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 3611 steps, including 2 resets, run visited all 2 properties in 112 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 826 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 617 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 123 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:46:12] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-19 10:46:14] [INFO ] Implicit Places using invariants in 2364 ms returned []
[2023-03-19 10:46:14] [INFO ] Invariant cache hit.
[2023-03-19 10:46:19] [INFO ] Implicit Places using invariants and state equation in 4304 ms returned []
Implicit Place search using SMT with State Equation took 6691 ms to find 0 implicit places.
[2023-03-19 10:46:19] [INFO ] Invariant cache hit.
[2023-03-19 10:46:20] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8047 ms. Remains : 2503/2503 places, 1802/1802 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 559 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) 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 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69937 steps, run timeout after 3009 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69937 steps, saw 69101 distinct states, run finished after 3009 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:46:25] [INFO ] Invariant cache hit.
[2023-03-19 10:46:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 331 ms returned sat
[2023-03-19 10:46:27] [INFO ] After 1468ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-19 10:46:28] [INFO ] After 1994ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:46:28] [INFO ] After 3069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:46:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 322 ms returned sat
[2023-03-19 10:46:32] [INFO ] After 2705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:46:32] [INFO ] After 3509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 566 ms.
[2023-03-19 10:46:33] [INFO ] After 5229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1845 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 331 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70086 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70086 steps, saw 66709 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:46:39] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-19 10:46:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 473 ms returned sat
[2023-03-19 10:46:42] [INFO ] After 2616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:46:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 382 ms returned sat
[2023-03-19 10:46:47] [INFO ] After 3789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:46:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-19 10:46:51] [INFO ] After 3853ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:46:54] [INFO ] After 7209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12419 ms.
[2023-03-19 10:47:06] [INFO ] After 24719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6906 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 103 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 93 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-19 10:47:14] [INFO ] Invariant cache hit.
[2023-03-19 10:47:15] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2023-03-19 10:47:15] [INFO ] Invariant cache hit.
[2023-03-19 10:47:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-19 10:47:25] [INFO ] Implicit Places using invariants and state equation in 9991 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11532 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 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 2500 transition count 1798
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 138 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:47:25] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-19 10:47:27] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2023-03-19 10:47:27] [INFO ] Invariant cache hit.
[2023-03-19 10:47:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-19 10:47:37] [INFO ] Implicit Places using invariants and state equation in 9885 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11642 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 239 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:47:37] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 10:47:39] [INFO ] Implicit Places using invariants in 1667 ms returned []
[2023-03-19 10:47:39] [INFO ] Invariant cache hit.
[2023-03-19 10:47:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:47:49] [INFO ] Implicit Places using invariants and state equation in 10663 ms returned []
Implicit Place search using SMT with State Equation took 12359 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 36012 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 65390 steps, run timeout after 3002 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65390 steps, saw 62149 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:47:53] [INFO ] Invariant cache hit.
[2023-03-19 10:47:54] [INFO ] [Real]Absence check using 1098 positive place invariants in 269 ms returned sat
[2023-03-19 10:47:56] [INFO ] After 2456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:47:57] [INFO ] [Nat]Absence check using 1098 positive place invariants in 282 ms returned sat
[2023-03-19 10:48:01] [INFO ] After 3842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:48:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:48:05] [INFO ] After 4159ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:48:06] [INFO ] After 5644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1151 ms.
[2023-03-19 10:48:08] [INFO ] After 11686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 2439 steps, including 0 resets, run visited all 2 properties in 63 ms. (steps per millisecond=38 )
Parikh walk visited 4 properties in 777 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 791 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1710 ms.
Product exploration explored 100000 steps with 0 reset in 2008 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 1802
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 869 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:48:15] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:48:15] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-19 10:48:16] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 1802/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin5930077727895860704
[2023-03-19 10:48:16] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5930077727895860704
Running compilation step : cd /tmp/ltsmin5930077727895860704;'/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/ltsmin5930077727895860704;'/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/ltsmin5930077727895860704;'/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 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 165 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:48:19] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-19 10:48:22] [INFO ] Implicit Places using invariants in 2379 ms returned []
[2023-03-19 10:48:22] [INFO ] Invariant cache hit.
[2023-03-19 10:48:26] [INFO ] Implicit Places using invariants and state equation in 4496 ms returned []
Implicit Place search using SMT with State Equation took 6882 ms to find 0 implicit places.
[2023-03-19 10:48:26] [INFO ] Invariant cache hit.
[2023-03-19 10:48:27] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8308 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin10112371185581290133
[2023-03-19 10:48:28] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10112371185581290133
Running compilation step : cd /tmp/ltsmin10112371185581290133;'/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/ltsmin10112371185581290133;'/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/ltsmin10112371185581290133;'/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)
[2023-03-19 10:48:31] [INFO ] Flatten gal took : 135 ms
[2023-03-19 10:48:31] [INFO ] Flatten gal took : 122 ms
[2023-03-19 10:48:31] [INFO ] Time to serialize gal into /tmp/LTL7384634286992895701.gal : 17 ms
[2023-03-19 10:48:31] [INFO ] Time to serialize properties into /tmp/LTL1113501190671451767.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/LTL7384634286992895701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12285404967615851716.hoa' '-atoms' '/tmp/LTL1113501190671451767.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/LTL1113501190671451767.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12285404967615851716.hoa
Detected timeout of ITS tools.
[2023-03-19 10:48:46] [INFO ] Flatten gal took : 122 ms
[2023-03-19 10:48:46] [INFO ] Flatten gal took : 119 ms
[2023-03-19 10:48:46] [INFO ] Time to serialize gal into /tmp/LTL17634417166757342694.gal : 12 ms
[2023-03-19 10:48:46] [INFO ] Time to serialize properties into /tmp/LTL11769947452574640431.ltl : 4 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/LTL17634417166757342694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11769947452574640431.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...277
Read 1 LTL properties
Checking formula 0 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Detected timeout of ITS tools.
[2023-03-19 10:49:02] [INFO ] Flatten gal took : 151 ms
[2023-03-19 10:49:02] [INFO ] Applying decomposition
[2023-03-19 10:49:02] [INFO ] Flatten gal took : 106 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/graph10107945585747384116.txt' '-o' '/tmp/graph10107945585747384116.bin' '-w' '/tmp/graph10107945585747384116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10107945585747384116.bin' '-l' '-1' '-v' '-w' '/tmp/graph10107945585747384116.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:49:02] [INFO ] Decomposing Gal with order
[2023-03-19 10:49:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:49:02] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 10:49:03] [INFO ] Flatten gal took : 232 ms
[2023-03-19 10:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 437 ms.
[2023-03-19 10:49:03] [INFO ] Time to serialize gal into /tmp/LTL8941123837256867733.gal : 66 ms
[2023-03-19 10:49:03] [INFO ] Time to serialize properties into /tmp/LTL12724570315447527279.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/LTL8941123837256867733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12724570315447527279.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 : !((("((i4.i1.i1.i1.u122.p381==0)||(i30.i1.i0.i1.u753.p2353==1))")U(X(G("((i16.u420.p1318==0)||(i3.i1.i1.i2.u92.p290==1))")))))
Formula 0 simplified : !"((i4.i1.i1.i1.u122.p381==0)||(i30.i1.i0.i1.u753.p2353==1))" R XF!"((i16.u420.p1318==0)||(i3.i1.i1.i2.u92.p290==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8417928981038782935
[2023-03-19 10:49:18] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8417928981038782935
Running compilation step : cd /tmp/ltsmin8417928981038782935;'/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/ltsmin8417928981038782935;'/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/ltsmin8417928981038782935;'/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)
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 297475 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 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 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 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
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 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 367 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2023-03-19 10:49:22] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-19 10:49:24] [INFO ] Implicit Places using invariants in 2466 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2469 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2503 places, 1797/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2493 transition count 1795
Applied a total of 4 rules in 213 ms. Remains 2493 /2495 variables (removed 2) and now considering 1795/1797 (removed 2) transitions.
// Phase 1: matrix 1795 rows 2493 cols
[2023-03-19 10:49:24] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 10:49:27] [INFO ] Implicit Places using invariants in 2231 ms returned []
[2023-03-19 10:49:27] [INFO ] Invariant cache hit.
[2023-03-19 10:49:31] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 6901 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2493/2503 places, 1795/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9950 ms. Remains : 2493/2503 places, 1795/1802 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1686 0) (NEQ s1257 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 0 reset in 1476 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-05 finished in 11562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 97 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:49:33] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-19 10:49:34] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2023-03-19 10:49:34] [INFO ] Invariant cache hit.
[2023-03-19 10:49:39] [INFO ] Implicit Places using invariants and state equation in 4355 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
[2023-03-19 10:49:39] [INFO ] Invariant cache hit.
[2023-03-19 10:49:41] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7909 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s2324 0) (NEQ s1528 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-07 finished in 8096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (G(!p1)||(!p1&&G(!p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 86 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:49:41] [INFO ] Invariant cache hit.
[2023-03-19 10:49:43] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2023-03-19 10:49:43] [INFO ] Invariant cache hit.
[2023-03-19 10:49:47] [INFO ] Implicit Places using invariants and state equation in 4730 ms returned []
Implicit Place search using SMT with State Equation took 6144 ms to find 0 implicit places.
[2023-03-19 10:49:47] [INFO ] Invariant cache hit.
[2023-03-19 10:49:49] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8178 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) p1), (NOT p0), p1, true, (AND p1 p2), p2]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1873 1), p2:(OR (EQ s795 0) (EQ s530 1)), p1:(OR (EQ s172 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-08 finished in 8608 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 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 117 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:49:50] [INFO ] Invariant cache hit.
[2023-03-19 10:49:51] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2023-03-19 10:49:51] [INFO ] Invariant cache hit.
[2023-03-19 10:49:56] [INFO ] Implicit Places using invariants and state equation in 4479 ms returned []
Implicit Place search using SMT with State Equation took 5796 ms to find 0 implicit places.
[2023-03-19 10:49:56] [INFO ] Invariant cache hit.
[2023-03-19 10:49:58] [INFO ] Dead Transitions using invariants and state equation in 2424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8369 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-12 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 s917 0) (EQ s1024 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 7328 ms.
Product exploration explored 100000 steps with 50000 reset in 7518 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 120 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-100A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-12 finished in 23443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 95 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:50:13] [INFO ] Invariant cache hit.
[2023-03-19 10:50:15] [INFO ] Implicit Places using invariants in 1639 ms returned []
[2023-03-19 10:50:15] [INFO ] Invariant cache hit.
[2023-03-19 10:50:19] [INFO ] Implicit Places using invariants and state equation in 4463 ms returned []
Implicit Place search using SMT with State Equation took 6119 ms to find 0 implicit places.
[2023-03-19 10:50:19] [INFO ] Invariant cache hit.
[2023-03-19 10:50:21] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7485 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s858 0) (EQ s1171 1) (EQ s772 1)), p0:(EQ s1496 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7282 ms.
Product exploration explored 100000 steps with 50000 reset in 7568 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 688 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-100A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-15 finished in 23215 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' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100A-LTLCardinality-03
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 221 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:50:37] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-19 10:50:39] [INFO ] Implicit Places using invariants in 2290 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2294 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 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 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 126 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:50:39] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-19 10:50:42] [INFO ] Implicit Places using invariants in 2579 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2581 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 237 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:50:42] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 10:50:44] [INFO ] Implicit Places using invariants in 2429 ms returned []
[2023-03-19 10:50:44] [INFO ] Invariant cache hit.
[2023-03-19 10:50:49] [INFO ] Implicit Places using invariants and state equation in 4674 ms returned []
Implicit Place search using SMT with State Equation took 7124 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 12586 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1478 ms.
Product exploration explored 100000 steps with 0 reset in 1774 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 474 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 79306 steps, run timeout after 3006 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79306 steps, saw 78402 distinct states, run finished after 3007 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:50:57] [INFO ] Invariant cache hit.
[2023-03-19 10:50:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 338 ms returned sat
[2023-03-19 10:51:00] [INFO ] After 1751ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-19 10:51:00] [INFO ] After 2160ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:51:00] [INFO ] After 3225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:51:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 282 ms returned sat
[2023-03-19 10:51:05] [INFO ] After 3706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:51:06] [INFO ] After 4841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 754 ms.
[2023-03-19 10:51:07] [INFO ] After 6642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1933 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 216 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 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 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 66537 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66537 steps, saw 63136 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:51:13] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 10:51:14] [INFO ] [Real]Absence check using 1098 positive place invariants in 308 ms returned sat
[2023-03-19 10:51:15] [INFO ] After 2384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:51:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 276 ms returned sat
[2023-03-19 10:51:20] [INFO ] After 3164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:51:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:51:24] [INFO ] After 3948ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:51:24] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-19 10:51:25] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-19 10:51:25] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2023-03-19 10:51:26] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2023-03-19 10:51:26] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 1 ms to minimize.
[2023-03-19 10:51:27] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-19 10:51:28] [INFO ] Deduced a trap composed of 7 places in 1309 ms of which 2 ms to minimize.
[2023-03-19 10:51:28] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 0 ms to minimize.
[2023-03-19 10:51:29] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-19 10:51:29] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 1 ms to minimize.
[2023-03-19 10:51:30] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-19 10:51:30] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-19 10:51:31] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 0 ms to minimize.
[2023-03-19 10:51:31] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-19 10:51:31] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-19 10:51:32] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 1 ms to minimize.
[2023-03-19 10:51:32] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-19 10:51:32] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 1 ms to minimize.
[2023-03-19 10:51:33] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 1 ms to minimize.
[2023-03-19 10:51:33] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-19 10:51:34] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-19 10:51:34] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-19 10:51:34] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-19 10:51:35] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 0 ms to minimize.
[2023-03-19 10:51:35] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2023-03-19 10:51:36] [INFO ] Deduced a trap composed of 7 places in 784 ms of which 35 ms to minimize.
[2023-03-19 10:51:36] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 8 ms to minimize.
[2023-03-19 10:51:37] [INFO ] Deduced a trap composed of 7 places in 536 ms of which 25 ms to minimize.
[2023-03-19 10:51:37] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-19 10:51:38] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-19 10:51:38] [INFO ] Deduced a trap composed of 7 places in 478 ms of which 1 ms to minimize.
[2023-03-19 10:51:38] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-19 10:51:39] [INFO ] Deduced a trap composed of 7 places in 411 ms of which 1 ms to minimize.
[2023-03-19 10:51:40] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-19 10:51:40] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 1 ms to minimize.
[2023-03-19 10:51:40] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 16567 ms
[2023-03-19 10:51:40] [INFO ] After 20766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 10:51:40] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3991 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 124 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 105 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:51:45] [INFO ] Invariant cache hit.
[2023-03-19 10:51:46] [INFO ] Implicit Places using invariants in 1576 ms returned []
[2023-03-19 10:51:46] [INFO ] Invariant cache hit.
[2023-03-19 10:51:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:51:49] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 4454 ms to find 0 implicit places.
[2023-03-19 10:51:49] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-19 10:51:49] [INFO ] Invariant cache hit.
[2023-03-19 10:51:51] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6628 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 309 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-19 10:51:51] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 10:51:52] [INFO ] [Real]Absence check using 1098 positive place invariants in 332 ms returned sat
[2023-03-19 10:51:54] [INFO ] After 2545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:51:55] [INFO ] [Nat]Absence check using 1098 positive place invariants in 269 ms returned sat
[2023-03-19 10:51:58] [INFO ] After 3125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:52:00] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-19 10:52:00] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-19 10:52:00] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-19 10:52:01] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-19 10:52:01] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 13 ms to minimize.
[2023-03-19 10:52:01] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-19 10:52:01] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 2 ms to minimize.
[2023-03-19 10:52:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2026 ms
[2023-03-19 10:52:05] [INFO ] After 9735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1652 ms.
[2023-03-19 10:52:06] [INFO ] After 12442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 502 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 164 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:52:07] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 10:52:10] [INFO ] Implicit Places using invariants in 2725 ms returned []
[2023-03-19 10:52:10] [INFO ] Invariant cache hit.
[2023-03-19 10:52:15] [INFO ] Implicit Places using invariants and state equation in 4463 ms returned []
Implicit Place search using SMT with State Equation took 7191 ms to find 0 implicit places.
[2023-03-19 10:52:15] [INFO ] Invariant cache hit.
[2023-03-19 10:52:17] [INFO ] Dead Transitions using invariants and state equation in 2093 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9459 ms. Remains : 2494/2494 places, 1796/1796 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 532 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 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 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 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71313 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71313 steps, saw 70447 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 10:52:21] [INFO ] Invariant cache hit.
[2023-03-19 10:52:22] [INFO ] [Real]Absence check using 1098 positive place invariants in 266 ms returned sat
[2023-03-19 10:52:24] [INFO ] After 1660ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-19 10:52:25] [INFO ] After 2269ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:52:25] [INFO ] After 3196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:52:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 337 ms returned sat
[2023-03-19 10:52:29] [INFO ] After 3246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:52:30] [INFO ] After 4371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 888 ms.
[2023-03-19 10:52:31] [INFO ] After 6393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1825 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 223 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64758 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64758 steps, saw 61407 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:52:37] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 10:52:38] [INFO ] [Real]Absence check using 1098 positive place invariants in 478 ms returned sat
[2023-03-19 10:52:40] [INFO ] After 2902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:52:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 277 ms returned sat
[2023-03-19 10:52:44] [INFO ] After 3269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:52:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:52:49] [INFO ] After 4195ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 10:52:49] [INFO ] Deduced a trap composed of 7 places in 417 ms of which 1 ms to minimize.
[2023-03-19 10:52:50] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 0 ms to minimize.
[2023-03-19 10:52:50] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-19 10:52:51] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 3 ms to minimize.
[2023-03-19 10:52:51] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2023-03-19 10:52:52] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 0 ms to minimize.
[2023-03-19 10:52:52] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 14 ms to minimize.
[2023-03-19 10:52:52] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 0 ms to minimize.
[2023-03-19 10:52:53] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 0 ms to minimize.
[2023-03-19 10:52:53] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-19 10:52:54] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:52:54] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2023-03-19 10:52:55] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 0 ms to minimize.
[2023-03-19 10:52:55] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2023-03-19 10:52:56] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-19 10:52:56] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-19 10:52:56] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 0 ms to minimize.
[2023-03-19 10:52:57] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 0 ms to minimize.
[2023-03-19 10:52:57] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2023-03-19 10:52:57] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-19 10:52:58] [INFO ] Deduced a trap composed of 8 places in 479 ms of which 1 ms to minimize.
[2023-03-19 10:52:59] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2023-03-19 10:52:59] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-19 10:52:59] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-19 10:53:00] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-19 10:53:00] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2023-03-19 10:53:00] [INFO ] Deduced a trap composed of 7 places in 311 ms of which 1 ms to minimize.
[2023-03-19 10:53:01] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 0 ms to minimize.
[2023-03-19 10:53:01] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-19 10:53:02] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 0 ms to minimize.
[2023-03-19 10:53:02] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 0 ms to minimize.
[2023-03-19 10:53:02] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2023-03-19 10:53:03] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2023-03-19 10:53:04] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2023-03-19 10:53:05] [INFO ] Deduced a trap composed of 7 places in 425 ms of which 1 ms to minimize.
[2023-03-19 10:53:05] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 10:53:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:53:05] [INFO ] After 25204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 3628 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 94 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 114 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:53:09] [INFO ] Invariant cache hit.
[2023-03-19 10:53:12] [INFO ] Implicit Places using invariants in 3218 ms returned []
[2023-03-19 10:53:12] [INFO ] Invariant cache hit.
[2023-03-19 10:53:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:53:21] [INFO ] Implicit Places using invariants and state equation in 9062 ms returned []
Implicit Place search using SMT with State Equation took 12320 ms to find 0 implicit places.
[2023-03-19 10:53:21] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-19 10:53:21] [INFO ] Invariant cache hit.
[2023-03-19 10:53:24] [INFO ] Dead Transitions using invariants and state equation in 2343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14829 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 271 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-19 10:53:24] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-19 10:53:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 348 ms returned sat
[2023-03-19 10:53:27] [INFO ] After 2705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:53:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 240 ms returned sat
[2023-03-19 10:53:31] [INFO ] After 3381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:53:33] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-19 10:53:33] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-19 10:53:34] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-19 10:53:34] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-19 10:53:34] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 23 ms to minimize.
[2023-03-19 10:53:35] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2023-03-19 10:53:35] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-19 10:53:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2664 ms
[2023-03-19 10:53:38] [INFO ] After 10286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1589 ms.
[2023-03-19 10:53:40] [INFO ] After 12941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 609 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1588 ms.
Product exploration explored 100000 steps with 0 reset in 1980 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 128 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:53:45] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:53:45] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 10:53:46] [INFO ] Dead Transitions using invariants and state equation in 1318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1517 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Built C files in :
/tmp/ltsmin198165900424166589
[2023-03-19 10:53:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin198165900424166589
Running compilation step : cd /tmp/ltsmin198165900424166589;'/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/ltsmin198165900424166589;'/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/ltsmin198165900424166589;'/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 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 140 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:53:49] [INFO ] Invariant cache hit.
[2023-03-19 10:53:52] [INFO ] Implicit Places using invariants in 2532 ms returned []
[2023-03-19 10:53:52] [INFO ] Invariant cache hit.
[2023-03-19 10:53:56] [INFO ] Implicit Places using invariants and state equation in 4526 ms returned []
Implicit Place search using SMT with State Equation took 7081 ms to find 0 implicit places.
[2023-03-19 10:53:56] [INFO ] Invariant cache hit.
[2023-03-19 10:53:58] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8400 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Built C files in :
/tmp/ltsmin5693429741842314945
[2023-03-19 10:53:58] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5693429741842314945
Running compilation step : cd /tmp/ltsmin5693429741842314945;'/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/ltsmin5693429741842314945;'/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/ltsmin5693429741842314945;'/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)
[2023-03-19 10:54:01] [INFO ] Flatten gal took : 109 ms
[2023-03-19 10:54:01] [INFO ] Flatten gal took : 119 ms
[2023-03-19 10:54:01] [INFO ] Time to serialize gal into /tmp/LTL3579558898044139881.gal : 39 ms
[2023-03-19 10:54:01] [INFO ] Time to serialize properties into /tmp/LTL4213280007322981540.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/LTL3579558898044139881.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7735934973941255805.hoa' '-atoms' '/tmp/LTL4213280007322981540.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...317
Loading property file /tmp/LTL4213280007322981540.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7735934973941255805.hoa
Detected timeout of ITS tools.
[2023-03-19 10:54:16] [INFO ] Flatten gal took : 107 ms
[2023-03-19 10:54:16] [INFO ] Flatten gal took : 108 ms
[2023-03-19 10:54:16] [INFO ] Time to serialize gal into /tmp/LTL43375757662235760.gal : 9 ms
[2023-03-19 10:54:16] [INFO ] Time to serialize properties into /tmp/LTL1570893409511657462.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/LTL43375757662235760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1570893409511657462.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 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Detected timeout of ITS tools.
[2023-03-19 10:54:32] [INFO ] Flatten gal took : 140 ms
[2023-03-19 10:54:32] [INFO ] Applying decomposition
[2023-03-19 10:54:32] [INFO ] Flatten gal took : 104 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/graph12189720833914538222.txt' '-o' '/tmp/graph12189720833914538222.bin' '-w' '/tmp/graph12189720833914538222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12189720833914538222.bin' '-l' '-1' '-v' '-w' '/tmp/graph12189720833914538222.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:54:32] [INFO ] Decomposing Gal with order
[2023-03-19 10:54:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:54:32] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 10:54:32] [INFO ] Flatten gal took : 107 ms
[2023-03-19 10:54:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 186 ms.
[2023-03-19 10:54:32] [INFO ] Time to serialize gal into /tmp/LTL15660625799325445852.gal : 29 ms
[2023-03-19 10:54:32] [INFO ] Time to serialize properties into /tmp/LTL10600923749998189099.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/LTL15660625799325445852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10600923749998189099.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 : !((("((i5.u122.p381==0)||(i29.i1.i1.i1.u753.p2353==1))")U(X(G("((i16.i0.i2.i1.u420.p1318==0)||(i4.i0.i0.i1.u92.p290==1))")))))
Formula 0 simplified : !"((i5.u122.p381==0)||(i29.i1.i1.i1.u753.p2353==1))" R XF!"((i16.i0.i2.i1.u420.p1318==0)||(i4.i0.i0.i1.u92.p290==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9196563634812968936
[2023-03-19 10:54:48] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9196563634812968936
Running compilation step : cd /tmp/ltsmin9196563634812968936;'/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/ltsmin9196563634812968936;'/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/ltsmin9196563634812968936;'/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)
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 254246 ms.
[2023-03-19 10:54:51] [INFO ] Flatten gal took : 142 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15186074930837871249
[2023-03-19 10:54:51] [INFO ] Too many transitions (1802) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:54:51] [INFO ] Applying decomposition
[2023-03-19 10:54:51] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15186074930837871249
Running compilation step : cd /tmp/ltsmin15186074930837871249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-19 10:54:51] [INFO ] Flatten gal took : 109 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/graph10354967509709940706.txt' '-o' '/tmp/graph10354967509709940706.bin' '-w' '/tmp/graph10354967509709940706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10354967509709940706.bin' '-l' '-1' '-v' '-w' '/tmp/graph10354967509709940706.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:54:51] [INFO ] Decomposing Gal with order
[2023-03-19 10:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:54:51] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 10:54:51] [INFO ] Flatten gal took : 96 ms
[2023-03-19 10:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 159 ms.
[2023-03-19 10:54:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality4052928803957697484.gal : 16 ms
[2023-03-19 10:54:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality13704805298850922715.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/LTLCardinality4052928803957697484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13704805298850922715.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 1 LTL properties
Checking formula 0 : !((("((i5.i0.i1.i1.u122.p381==0)||(i32.u753.p2353==1))")U(X(G("((i17.u420.p1318==0)||(i3.u92.p290==1))")))))
Formula 0 simplified : !"((i5.i0.i1.i1.u122.p381==0)||(i32.u753.p2353==1))" R XF!"((i17.u420.p1318==0)||(i3.u92.p290==1))"
Compilation finished in 4244 ms.
Running link step : cd /tmp/ltsmin15186074930837871249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15186074930837871249;'/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'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.071: LTL layer: formula: ((LTLAPp0==true) U X([]((LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.073: "((LTLAPp0==true) U X([]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.078: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.989: There are 1805 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.990: State length is 2504, there are 1811 groups
pins2lts-mc-linux64( 0/ 8), 0.990: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.990: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.990: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.990: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.258: [Blue] ~119 levels ~960 states ~3896 transitions
pins2lts-mc-linux64( 4/ 8), 1.446: [Blue] ~239 levels ~1920 states ~9408 transitions
pins2lts-mc-linux64( 4/ 8), 1.823: [Blue] ~478 levels ~3840 states ~19648 transitions
pins2lts-mc-linux64( 4/ 8), 2.502: [Blue] ~953 levels ~7680 states ~38856 transitions
pins2lts-mc-linux64( 4/ 8), 3.770: [Blue] ~1910 levels ~15360 states ~81520 transitions
pins2lts-mc-linux64( 4/ 8), 6.214: [Blue] ~3830 levels ~30720 states ~191840 transitions
pins2lts-mc-linux64( 4/ 8), 10.911: [Blue] ~7670 levels ~61440 states ~420056 transitions
pins2lts-mc-linux64( 4/ 8), 19.623: [Blue] ~15321 levels ~122880 states ~801096 transitions
pins2lts-mc-linux64( 4/ 8), 36.861: [Blue] ~30633 levels ~245760 states ~1596328 transitions
pins2lts-mc-linux64( 4/ 8), 70.542: [Blue] ~61276 levels ~491520 states ~3351608 transitions
pins2lts-mc-linux64( 4/ 8), 137.565: [Blue] ~122505 levels ~983040 states ~6827208 transitions
pins2lts-mc-linux64( 4/ 8), 271.218: [Blue] ~245052 levels ~1966080 states ~14129208 transitions
pins2lts-mc-linux64( 5/ 8), 395.363: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 395.534:
pins2lts-mc-linux64( 0/ 8), 395.534: Explored 1834395 states 14753349 transitions, fanout: 8.043
pins2lts-mc-linux64( 0/ 8), 395.534: Total exploration time 394.490 sec (394.360 sec minimum, 394.431 sec on average)
pins2lts-mc-linux64( 0/ 8), 395.534: States per second: 4650, Transitions per second: 37399
pins2lts-mc-linux64( 0/ 8), 395.534:
pins2lts-mc-linux64( 0/ 8), 395.534: State space has 8540408 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 395.534: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 395.534: blue states: 1834395 (21.48%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 395.534: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 395.534: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 395.534:
pins2lts-mc-linux64( 0/ 8), 395.534: Total memory used for local state coloring: 27.9MB
pins2lts-mc-linux64( 0/ 8), 395.534:
pins2lts-mc-linux64( 0/ 8), 395.534: Queue width: 8B, total height: 1830250, memory: 13.96MB
pins2lts-mc-linux64( 0/ 8), 395.534: Tree memory: 321.2MB, 39.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 395.534: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 395.534: Stored 1829 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 395.534: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 395.534: Est. total memory use: 335.1MB (~1038.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15186074930837871249;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15186074930837871249;'/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'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
ITS-tools command line returned an error code 137
[2023-03-19 11:16:26] [INFO ] Applying decomposition
[2023-03-19 11:16:28] [INFO ] Flatten gal took : 1482 ms
[2023-03-19 11:16:28] [INFO ] Decomposing Gal with order
[2023-03-19 11:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:16:30] [INFO ] Removed a total of 600 redundant transitions.
[2023-03-19 11:16:31] [INFO ] Flatten gal took : 1060 ms
[2023-03-19 11:16:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 694 ms.
[2023-03-19 11:16:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality10568967038580299878.gal : 87 ms
[2023-03-19 11:16:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality8887404514345085009.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10568967038580299878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8887404514345085009.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 1 LTL properties
Checking formula 0 : !((("((i122.u214.p381==0)||(u1318.p2353==1))")U(X(G("((i420.u739.p1318==0)||(i92.u1675.p290==1))")))))
Formula 0 simplified : !"((i122.u214.p381==0)||(u1318.p2353==1))" R XF!"((i420.u739.p1318==0)||(i92.u1675.p290==1))"
ITS-tools command line returned an error code 137
[2023-03-19 11:31:00] [INFO ] Flatten gal took : 8852 ms
[2023-03-19 11:31:04] [INFO ] Input system was already deterministic with 1802 transitions.
[2023-03-19 11:31:05] [INFO ] Transformed 2503 places.
[2023-03-19 11:31:05] [INFO ] Transformed 1802 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 11:31:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality14700867166777504574.gal : 65 ms
[2023-03-19 11:31:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality15053309540432879594.ltl : 9 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/LTLCardinality14700867166777504574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15053309540432879594.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11322272 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15838800 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-100A"
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-100A, 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-167903713900691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;